English
Related papers

Related papers: The Burnside problem for odd exponents

200 papers

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…

Group Theory · Mathematics 2011-05-19 Martin Kassabov , Francesco Matucci

We give an exponential lower bound for Berge-Ramsey problems.

Combinatorics · Mathematics 2020-01-23 Dömötör Pálvölgyi

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

Number Theory · Mathematics 2025-04-22 Chi Hoi Yip

We prove that, for any $B \subset \mathbb R$, the Cartesian product set $B \times B$ determines $\Omega(|B|^{2+c})$ distinct angles.

Combinatorics · Mathematics 2024-06-11 Oliver Roche-Newton

In this note, we consider irreducible semigroups of real, complex, and quaternionic matrices with real spectra. We prove Burnside type theorems in the settings of reals and quaternions. First, we prove that an irreducible semigroup of…

Rings and Algebras · Mathematics 2018-09-13 Bamdad R. Yahaghi

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Group Theory · Mathematics 2019-12-03 Mark Pengitore

We prove that the pigeonhole upper bound $\lambda(s,m) \leq \binom{m}{2}(s+1)$ is asymptotically tight whenever $s/\!\sqrt{m} \to \infty$. In particular, $\lambda(s,m) \sim \binom{m}{2}\,s$ in this regime. As corollaries: $\lambda(n,n)/n^3…

Combinatorics · Mathematics 2026-02-18 Jesse Geneson

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of nonabelian simple groups. The minimum number of nonsolvable factors attained on all possible such series is called the…

Group Theory · Mathematics 2018-05-16 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

We prove surjectivity of certain word maps on finite non-abelian simple groups. More precisely, we prove the following: if N is a product of two prime powers, then the word map sending (x,y) to the product of the Nth powers of x and y is…

Group Theory · Mathematics 2015-05-05 Robert Guralnick , Martin Liebeck , Eamon O'Brien , Aner Shalev , Pham Tiep

Let $\gamma_n=[x_1,\dots,x_n]$ be the $n$th lower central word. Denote by $X_n$ the set of $\gamma_n$-values in a group $G$ and suppose that there is a number $m$ such that $|g^{X_n}|\leq m$ for each $g\in G$. We prove that…

Group Theory · Mathematics 2019-07-08 Eloisa Detomi , Guram Donadze , Marta Morigi , Pavel Shumyatsky

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

Combinatorics · Mathematics 2008-06-23 Jozsef Solymosi

It is shown that, for any pair of cardinals with infinite sum, there exist a group and an equation over this group such that the first cardinal is the number of solutions to this equation and the second cardinal is the number of…

Group Theory · Mathematics 2007-05-23 Anton A. Klyachko , Anton V. Trofimov

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform…

Combinatorics · Mathematics 2018-02-21 Dhruv Mubayi , Andrew Suk

We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group.…

Group Theory · Mathematics 2016-03-08 Volodymyr Nekrashevych

We introduce a model for random groups in varieties of $n$-periodic groups as $n$-periodic quotients of triangular random groups. We show that for an explicit $d_{\mathrm{crit}}\in(1/3,1/2)$, for densities $d\in(1/3,d_{\mathrm{crit}})$ and…

Group Theory · Mathematics 2022-08-23 Dominik Gruber , John M. Mackay

Rigid graph theory is an active area with many open problems, especially regarding embeddings in $\mathbb{R}^d$ or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number…

Algebraic Geometry · Mathematics 2020-07-06 Evangelos Bartzos , Ioannis Z. Emiris , Josef Schicho

A set $A$ is MSTD (more-sum-than-difference) if $|A+A|>|A-A|$. Though MSTD sets are rare, Martin and O'Bryant proved that there exists a positive constant lower bound for the proportion of MSTD subsets of $\{1,2,\ldots ,r\}$ as…

Number Theory · Mathematics 2019-10-23 Hung Viet Chu , Noah Luntzlara , Steven J. Miller , Lily Shao

We prove a Margulis' Lemma \`a la Besson Courtois Gallot, for manifolds whose fundamental group is a nontrivial free product A*B, without 2-torsion. Moreover, if A*B is torsion-free we give a lower bound for the homotopy systole in terms of…

Differential Geometry · Mathematics 2012-05-25 Filippo Cerocchi

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

Discrete Mathematics · Computer Science 2012-10-05 Niranjan Balachandran , Srimanta Bhattacharya
‹ Prev 1 3 4 5 6 7 10 Next ›