English
Related papers

Related papers: Wilf's conjecture and Macaulay's theorem

200 papers

We prove a conjecture of Helfgott on the structure of sets of bounded tripling in bounded rank, which states the following. Let $A$ be a finite symmetric subset of $\mathrm{GL}_n(\mathbf{F})$ for any field $\mathbf{F}$ such that $|A^3| \leq…

Group Theory · Mathematics 2025-08-04 Sean Eberhard , Brendan Murphy , László Pyber , Endre Szabó

In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…

Commutative Algebra · Mathematics 2026-03-02 Om Prakash Bhardwaj , Carmelo Cisto

Let $\mathfrak{g}=\mathfrak{g}_{\bar 0}+\mathfrak{g}_{\bar 1}$ be a basic Lie superalgebra over $\mathbb{C}$, and $e$ a minimal nilpotent element in $\mathfrak{g}_{\bar 0}$. Set $W_\chi'$ to be the refined $W$-superalgebra associated with…

Representation Theory · Mathematics 2020-07-02 Yang Zeng , Bin Shu

Foulkes' conjecture has several generalisations due to Doran, Abdesselam--Chipalkatti, Bergeron, and Troyka. For the special linear Lie algebra $\mathfrak{sl}_2(\mathbb{C})$, these assert that given $a \le c \le d \le b$ with $ab=cd$, the…

Combinatorics · Mathematics 2025-08-05 Álvaro Gutiérrez , Michał Szwej

Let L be a number field and let E be any subgroup of the units O_L^* of L. If rank(E) = 1, Lehmer's conjecture predicts that the height of any non-torsion element of E is bounded below by an absolute positive constant. If rank(E) =…

Number Theory · Mathematics 2023-03-08 Ted Chinburg , Eduardo Friedman , Fernando Rodriguez-Villegas , James Sundstrom

Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…

Representation Theory · Mathematics 2020-08-10 Andrew R. Linshaw

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

Combinatorics · Mathematics 2025-12-18 Carl Schildkraut

In this paper, we are motivated by the conjectures proposed by C.~Bender \textit{et al.}, \cite{C} in 2024. We have settled the first two conjectures negatively by providing a counter example in \cite{KTJ}, whereas in this paper, we prove…

Combinatorics · Mathematics 2026-04-20 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed a…

Combinatorics · Mathematics 2025-12-04 Cicely Henderson , Luke Postle

Suppose $g=g_0+g_1$ is a finite-dimensional restricted Lie superalgebra over an algebraically closed field $k$ of characteristic $p>2$. In this article, we propose a conjecture for maximal dimensions of irreducible modules over the…

Representation Theory · Mathematics 2024-10-10 Bin Shu

Let $S=\langle d_1,\dots,d_m\rangle$ be a numerical semigroup and $k[S]$ its semigroup ring. The Hilbert numerator of $k[S]$ determines normalized alternating syzygy power sums $K_p(S)$ encoding alternating power sums of syzygy degrees. Fel…

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

Combinatorics · Mathematics 2022-11-24 Luke Pebody

We prove the inverse conjecture for the Gowers U^{s+1}[N]-norm for all s >= 3; this is new for s > 3, and the cases s<3 have also been previously established. More precisely, we establish that if f : [N] -> [-1,1] is a function with || f…

Combinatorics · Mathematics 2026-04-24 Ben Green , Terence Tao , Tamar Ziegler

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

Combinatorics · Mathematics 2021-01-01 Noga Alon , Noah Kravitz , Matt Larson

Let $N$ be a nilpotent normal subgroup of the finite group $G$. Assume that $u$ is a unit of finite order in the integral group ring $\mathbb{Z} G$ of $G$ which maps to the identity under the linear extension of the natural homomorphism $G…

Group Theory · Mathematics 2017-10-26 Leo Margolis , Ángel del Río

Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…

Combinatorics · Mathematics 2024-11-27 Zejun Huang , Jiahui Liu , Chenxi Yang

We study Euler systems for $\mathbb{G}_m$ over a number field $k$. Motivated by a distribution-theoretic idea of Coleman, we formulate a conjecture regarding the existence of such systems that is elementary to state and yet strictly finer…

Number Theory · Mathematics 2023-03-07 Dominik Bullach , David Burns , Alexandre Daoud , Soogil Seo

Let $S^{\cdot}$ be a noetherian graded algebra over a commutative $k$-algebra $A$, where $k$ is a commutative ring, and assume it is a module over a Lie algebroid ${\mathfrak g}_{A/k}$. If $S^\cdot$ is semi-simple over ${\mathfrak g}_{A/k}$…

Rings and Algebras · Mathematics 2012-12-20 Rolf Källström

For a finite group $G$, let $\mathrm{diam}(G)$ denote the maximum diameter of a connected Cayley graph of $G$. A well-known conjecture of Babai states that $\mathrm{diam}(G)$ is bounded by ${(\log_{2} |G|)}^{O(1)}$ in case $G$ is a…

Group Theory · Mathematics 2019-08-14 Zoltán Halasi , Attila Maróti , László Pyber , Youming Qiao

A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most (n+1)/2.…

Combinatorics · Mathematics 2019-11-13 Fabio Botler , Maycon Sambinelli
‹ Prev 1 3 4 5 6 7 10 Next ›