English
Related papers

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

200 papers

Malle proposed a conjecture for counting the number of $G$-extensions $L/K$ with discriminant bounded above by $X$, denoted $N(K,G;X)$, where $G$ is a fixed transitive subgroup $G\subset S_n$ and $X$ tends towards infinity. We introduce a…

Number Theory · Mathematics 2022-02-09 Brandon Alberts

The long standing Lech's conjecture in commutative algebra states that for a flat local extension $(R,\mathfrak{m})\to (S,\mathfrak{n})$ of Noetherian local rings, we have an inequality on the Hilbert--Samuel multiplicities: $e(R)\leq…

Commutative Algebra · Mathematics 2022-08-16 Linquan Ma

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…

Combinatorics · Mathematics 2025-06-23 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

In 1971, Kac and Weisfeiler made two influential conjectures describing the dimensions of simple modules of a restricted Lie algebra $\mathfrak{g}$. The first predicts the maximal dimension of simple $\mathfrak{g}$-modules and in this paper…

Representation Theory · Mathematics 2019-01-29 Benjamin Martin , David Stewart , Akaki Tikaradze , Lewis Topley

The circumference denoted by $c(G)$ of a graph $G$ is the length of its longest cycle. Let $\delta(G)$ and $\omega(G)$ denote the minimum degree and the clique number of a graph $G$, respectively. In [\emph{Electron. J. Combin.} 31(4)(2024)…

Combinatorics · Mathematics 2025-10-31 Na Chen , Yurui Tang

We consider the finite W-superalgebras for a basic classical Lie superalgebra g associated with an even nilpotent element in g both over the field of complex numbers field and and over a filed of positive characteristic. We present the PBW…

Representation Theory · Mathematics 2014-05-13 Yang Zeng , Bin Shu

We prove that if $G$ is a finite simple group of Lie type and $S$ a subset of $G$ of size at least two then $G$ is a product of at most $c\log|G|/\log|S|$ conjugates of $S$, where $c$ depends only on the Lie rank of $G$. This confirms a…

Group Theory · Mathematics 2012-05-18 Nick Gill , László Pyber , Ian Short , Endre Szabó

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

A fundamental theorem of Wilson states that, for every graph $F$, every sufficiently large $F$-divisible clique has an $F$-decomposition. Here a graph $G$ is $F$-divisible if $e(F)$ divides $e(G)$ and the greatest common divisor of the…

Combinatorics · Mathematics 2018-09-05 Ben Barber , Daniela Kühn , Allan Lo , Deryk Osthus

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

Number Theory · Mathematics 2019-12-13 Brandon Alberts

Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$. We present several interrelated results establishing…

Combinatorics · Mathematics 2020-03-10 Joshua N. Cooper

Let $G$ be an arbitrary finite group. The McKay conjecture asserts that $G$ and the normaliser $N_G (P)$ of a Sylow $p$-subgroup $P$ in $G$ have the same number of characters of degree not divisible by $p$ (that is, of $p'$-degree). We…

Representation Theory · Mathematics 2014-02-26 Anton Evseev

We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class…

Commutative Algebra · Mathematics 2021-04-01 José C. Rosales , M. B. Branco , Márcio A. Traesel

Koml\'os conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We…

Combinatorics · Mathematics 2017-07-26 Jaehoon Kim , Hong Liu , Maryam Sharifzadeh , Katherine Staden

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

Group Theory · Mathematics 2016-08-16 Emmanuel Breuillard , Matthew Tointon

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

Number Theory · Mathematics 2014-02-04 Caixia Shen , Li-meng Xia , Yuanlin Li

We prove a modified version for a conjecture of Weiss from 2004. Let $G$ be a semisimple real algebraic group defined over $\mathbb{Q}$, $\Gamma$ be an arithmetic subgroup of $G$. A trajectory in $G/\Gamma$ is divergent if eventually it…

Dynamical Systems · Mathematics 2021-05-07 Nattalie Tamam

Let $\Gamma < G$ be a discrete subgroup of a locally compact unimodular group $G$. Let $m\in C_b(G)$ be a $p$-multiplier on $G$ with $1 \leq p < \infty$ and let $T_{m}: L_p(\widehat{G}) \rightarrow L_p(\widehat{G})$ be the corresponding…

Operator Algebras · Mathematics 2023-03-21 Martijn Caspers , Bas Janssens , Amudhan Krishnaswamy-Usha , Lukas Miaskiwskyi

For a 1-tough graph $G$ we define $\sigma_3(G) = \min\{\deg(u) + \deg(v)+ \deg(w):$ $\{u, v, w\}$ is an independent set of vertices$\}$ and $NC2(G)=\min \{|N(u)\cup N(v)|: d(u,v)=2\}$. D. Bauer, G. Fan and H.J.Veldman proved that $c(G)\geq…

Combinatorics · Mathematics 2013-09-27 Tri Lai

Let $G$ be a finite group. The small Davenport constant $\mathsf d(G)$ of $G$ is the maximal integer $\ell$ such that there is a sequence of length $\ell$ over $G$ which has no nonempty product-one subsequence. In 2007, Bass conjectured…

Combinatorics · Mathematics 2025-02-20 Guoqing Wang , Yang Zhao