Skip to content
Preprint

Zero-free columns in character tables of symmetric groups

Aug 2026 · 0 citations · 13 references
Mathematics

Abstract

The rows and columns of the character table of the symmetric group $S_n$ are both naturally indexed by partitions of $n$. Let $D(n)$ denote the number of conjugacy classes of $S_n$ whose column contains no zero entry. The identity column is always zero-free, so $D(n)\geq 1$. It is known that $D(n)\ll n^2$. We prove that $D(n)\ll n^{3/4}$. Second, we prove for almost all positive integers $n$ that $D(n)\ll_B n^{1/2}(\log n)^B$ for every $B>5/6$, with a quantitative bound for the exceptional set, using work of Matom\"aki and Radziwill. Finally, we offer a heuristic supporting our conjecture that $D(n)\ll_{\varepsilon} n^{\varepsilon}$. AxiomProver formalized the results in this paper in Lean assuming preexisting literature.

View source

Similar papers

Preprint Sep 2026

Sums of distinct divisors of factorials

For practical $N$ let $h(N)$ be the least $k$ such that every integer $1\le m\le N$ is a sum of at most $k$ distinct divisors of $N$. We prove $h(n!)\le(2\log2+o(1))\,n/\log n$. This improves the bounds of order $n/(\log n)^{1/2-\varepsilon}$ established in Tenenbaum-Yokota's Lemma 4 and Yokota's 1995 knapsack note. We...

S. D. Hughes · 0 citations
Preprint Aug 2026

Products of Two Integers Avoiding Perfect Powers

For integers $d\geq 3$, let $F_{2,d}(n)$ be the largest size of a subset of $[n]$ containing no two distinct elements whose product is a perfect $d$-th power, and let $f_{2,d}(n)$ denote the analogous quantity when the two elements need not be distinct. Fleiner, Juh\'asz, K\"ov\'er, Pach, and S\'andor proved that both...

Quan-Hui Yang, Li-Lu Zhao · 0 citations
Preprint Aug 2026

Elliptic matroids and modular curves

For $n\geq 4$, let $T_n$ be the rank-3 matroid on $\mathbb{Z}/n\mathbb{Z}$ whose bases are the three-element non-zero-sum subsets. Let $X_1(n)^\circ$ denote the open subscheme of the modular curve $X_1(n)$ obtained by removing the cusps corresponding to reducible N\'eron polygons. For $n \geq 10$, we give a purely alge...

Matthew Baker · 0 citations
Preprint Jul 2026

A note on zero-sum Ramsey numbers of complete graphs

For a graph $H$ with $3\mid e(H)$, the zero-sum Ramsey number $R(H,\Z_3)$ is the least integer $N$ such that every labeling of the edges of $K_N$ by elements of $\Z_3$ contains a copy of $H$ whose edge labels sum to zero. We determine the last previously unresolved infinite family in the complete-graph case modulo $3$....

Cheng Chi, Jia-Lin He, Fuhong Ma · 0 citations
Jul 2026

Cyclic codes and cyclically covering subspaces

A subspace of $\mathbb{F}_q^n$ is called cyclically covering if the union of $\sigma^i(U)$ can cover the whole space $\mathbb{F}_q^n$, where $\sigma$ is the cyclic shift, $0 \leqslant i \leqslant n-1$. Let $h_q(n)$ be the largest possible co-dimension of a cyclically covering subspace of $\mathbb{F}_q^n$. We show that...

Xuan Wang, Minjia Shi · 0 citations
Preprint Aug 2026

The Lower Central Series of Right Lower-Triangular Nielsen Automorphism Groups

Let $F_n$ be a free group of rank $n\geq3$, freely generated by $x_1,\ldots,x_n$. For $1\leq j<i\leq n$, let $d_{i,j}$ denote the Nielsen automorphism of $F_n$ defined by $d_{i,j}(x_i)=x_ix_j$ and $d_{i,j}(x_k)=x_k$ for $k\neq i$, and let $D_n=\langle d_{i,j}\mid 1\leq j<i\leq n\rangle$. We determine the lower central...

C. Kofinas · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.