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.
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 combine their decreasing greedy construction with the sharper factorial divisor-gap estimate of Berend-Harmse. Counting the steps separately below and above $\sqrt{n!}$, with the upper range handled through reciprocal divisors, retains the leading coefficient in the gap exponent and yields the explicit constant $2\log2$.
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 complements have order $n^{2/3}$ when $d=3$, and asked for a leading constant. They also asked whether, more generally, $n-F_{k,d}(n)$ and $n-f_{k,d}(n)$ have order $n^{k/d}$ for $1<k<d$. We establish asymptotic formula in the case $k=2$ for every fixed $d\geq3$, \[ n-F_{2,d}(n)\sim n-f_{2,d}(n) \sim C_d\, n^{2/d}(\log n)^{d-3}, \] where $C_d>0$ is given explicitly by an Euler product and a polytope volume. In particular, the extra logarithmic factor gives a negative answer to the second question for every $d\geq4$. For $d=3$ we obtain \[ C_3=\frac{\pi^2}{4} \prod_p\left(1-\frac3{p^2}+\frac2{p^3}\right), \] which answers the first question. The proof uses an exact decomposition into complementary $d$-free kernel classes, a squarefree sieve in multiplicative boxes, and a two-height polytope calculation.
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 algebraic and incidence-theoretic proof that, for every field $k$ with $\mathrm{char}(k)$ not dividing $n$, there is a natural bijection between $X_1(n)^\circ(k)$ and rescaling classes of $k$-realizations of $T_n$. For $k = \mathbb{C}$, this recovers a theorem of Borisov and Roulleau. We then upgrade the field-valued correspondence to an isomorphism of schemes over $\mathbb{Z}[1/n]$. The main new ingredient is a deformation-theoretic argument which allows us to verify the isomorphism on points valued in Artinian local rings. As consequences, the modular curve $X_1(n)^\circ$ acquires a natural model over $\mathbb{Z}[1/n]$ as a matroid realization space, and, for primes $p \geq 11$, the non-representability of $T_p$ over $\mathbb{Q}$ is equivalent to the prime-order case of Mazur's celebrated theorem on rational torsion points of elliptic curves. In an appendix, we explain how to upgrade the realization space of a matroid from an affine scheme over $\mathbb{Z}$ to an affine band scheme (in the sense of Baker-Jin-Lorscheid) over $\mathbb{F}_1^{\pm}$.
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$. More precisely, we prove that \(R(K_n,\Z_3)=n+3\) for every $n\ge 10$ satisfying $n\equiv 1\pmod 3$. Consequently, for $k\ge 1$, \(R(K_{9k+7},\Z_3)=9k+10\), resolving a problem of Caro and Mifsud.
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 $h_2(2p) = 2$ for every prime $p$ such that $2$ is a primitive root modulo $p$. By constacyclic codes, we show that $h_q((q-1)n) = 0$ when $h_q(n) = 0$ and $\gcd(n,q-1) = 1$. We also derive a lower bound on $h_q(n)$ by the concept of support weight distribution, which is important in coding theory. Finally, using irreducible cyclic codes, we present several families of $n$ such that $h_q(n) = 0$.
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 series of $D_n$. We first prove that, for $1\leq r<i\leq n$, $d_{i,r}\in \gamma_{i-r}(D_n)\setminus\gamma_{i-r+1}(D_n)$. For each $i=2,\ldots,n$, this calculation leads to a filtration $\{W_{i,c}\}_{c\geq1}$ of $U_i=\langle d_{i,1},\ldots,d_{i,i-1}\rangle$. For every $c\geq1$, we obtain an explicit iterated semidirect-product decomposition of $\gamma_c(D_n)$ in terms of the subgroups $W_{i,c}$, and prove that $U_i\cap\gamma_c(D_n)=W_{i,c}$ for $i=2,\ldots,n$. The construction also gives an explicit basis for each quotient $\gamma_c(D_n)/\gamma_{c+1}(D_n)$ in terms of basic commutators and determines the exact lower-central depth of every such commutator. Consequently, $D_n$ is a Magnus group.
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.
