English
Related papers

Related papers: The Burnside problem for odd exponents

200 papers

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

Classical Analysis and ODEs · Mathematics 2007-12-04 Luc Vinet , Alexei Zhedanov

Classical (or ``global'') Bernstein theory establishes sharp control on entire functions of exponential type that are bounded and real-valued on the real axis. We localize some of this theory to rectangular regions $\{ x+iy: x \in I, 0 \leq…

Classical Analysis and ODEs · Mathematics 2026-04-23 Terence Tao

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…

Representation Theory · Mathematics 2016-09-07 Alexander Fel'shtyn , Evgenij Troitsky

We give a lower bound for the exponent of certain elements in the integral cohomology of the total spaces of principal BC-bundles for C a finite cyclic group. As applications we give a proof of the theorem of A. Adem and H.-W. Henn that a…

Algebraic Topology · Mathematics 2007-12-03 Ian J Leary

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

Bresinsky defined a class of monomial curves in $\mathbb{A}^{4}$ with the property that the minimal number of generators or the first Betti number of the defining ideal is unbounded above. We prove that the same behaviour of unboundedness…

Commutative Algebra · Mathematics 2019-01-11 Ranjana Mehta , Joydip Saha , Indranath Sengupta

We prove new bounds for Ramsey numbers for book graphs $B_n$. In particular, we show that $R(B_{n-1},B_n) = 4n-1$ for an infinite family of $n$ using a block-circulant construction similar to Paley graphs. We obtain improved bounds for…

Combinatorics · Mathematics 2025-12-24 William J. Wesley

We propose the existence theorem for bounded solutions to the system of 2-nd order ODE. Dynamical applications have been considered.

Dynamical Systems · Mathematics 2015-03-03 Oleg Zubelevich

We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\mathcal{O}_{\epsilon}(n^{3/5+\epsilon})$ solutions of…

Number Theory · Mathematics 2018-05-09 Christian Elsholtz , Stefan Planitzer

We construct a finitely presented non-amenable group without free non-cyclic subgroups thus providing a finitely presented counterexample to von Neumann's problem. Our group is an extension of a group of finite exponent n >> 1 by a cyclic…

Group Theory · Mathematics 2007-05-23 A. Yu. Olshanskii , M. V. Sapir

The bipartite Ramsey number $b(s,t)$ is the smallest integer $n$ such that every blue-red edge coloring of $K_{n,n}$ contains either a blue $K_{s,s}$ or a red $K_{t,t}$. In the bipartite $K_{2,2}$-free process, we begin with an empty graph…

Combinatorics · Mathematics 2018-08-08 Deepak Bal , Patrick Bennett

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

Combinatorics · Mathematics 2026-05-12 Chunchao Fan , Mingze Li , Qizhong Lin , Bo Ning

We prove prime exponential sums have no better than square root cancellation on average on short intervals, in the sense that $$\frac{1}{x} \sum_{-y< n\le x} \left|\sum_{\substack{n< m \le n+y\\ 1\le m \le x}} \Lambda(m) \mathrm{e}(\alpha…

Number Theory · Mathematics 2025-09-19 Pierre-Alexandre Bazin

We establish an explicit upper bound B(p,l,m), depending on p,l,m, on the number of conjugacy classes of order p^2 torsion elements u of type <l,m> of the Nottingham group defined over the prime field of characteristic p >0. In the cases…

Group Theory · Mathematics 2018-10-29 Chun Yin Hui , Krishna Kishore

For every odd integer $n \geq 3$, we prove that there exist infinitely many number fields of degree $n$ and associated Galois group $S_n$ whose class number is odd. To do so, we study the class groups of families of number fields of degree…

Number Theory · Mathematics 2018-05-23 Wei Ho , Arul Shankar , Ila Varma

In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel…

Discrete Mathematics · Computer Science 2010-07-29 Zan Pan

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

A $k$-uniform hypergraph with $n$ vertices is an $(n,k,\ell)$-omitting system if it does not contain two edges whose intersection has size exactly $\ell$. If in addition it does not contain two edges whose intersection has size greater than…

Combinatorics · Mathematics 2021-01-13 Tom Bohman , Xizhi Liu , Dhruv Mubayi

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

Given a free group of rank r >= 3 and two exponentially growing outer automorphisms {\psi} and {\phi} with dual lamination pairs {\Lambda^\pm}_{\psi} and {\Lambda^\pm}_{\phi} associated to them, which satisfy a notion of independence…

Group Theory · Mathematics 2015-11-26 Pritam Ghosh