English
Related papers

Related papers: A density version of the Carlson--Simpson theorem

200 papers

Strong bounds are obtained for the number of automorphic forms for the group $\Gamma_0(q) \subseteq \operatorname{Sp}(4,\mathbb{Z})$ violating the Ramanujan conjecture at any given unramified place, which go beyond Sarnak's density…

Number Theory · Mathematics 2022-03-09 Siu Hang Man

A theorem of Gao, Jackson and Seward, originally conjectured to be false by Glasner and Uspenskij, asserts that every countable group admits a $2$-coloring. A direct consequence of this result is that every countable group has a strongly…

Dynamical Systems · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Stéphan Thomassé

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

Group Theory · Mathematics 2024-08-13 Sobhi Massalha

We prove two results about width of words in $SL_n(\mathbb{Z})$. The first is that, for every $n \geq 3$, there is a constant $C(n)$ such that the width of any word in $SL_n(\mathbb{Z})$ is less than $C(n)$. The second result is that, for…

Group Theory · Mathematics 2019-06-19 Nir Avni , Chen Meiri

We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a…

Formal Languages and Automata Theory · Computer Science 2025-08-08 Valérie Berthé , Herman Goulet-Ouellet , Dominique Perrin

Consider a Gaussian stationary sequence with unit variance $X=\{X_k;k\in {\mathbb{N}}\cup\{0\}\}$. Assume that the central limit theorem holds for a weighted sum of the form $V_n=n^{-1/2}\sum^{n-1}_{k=0}f(X_k)$, where $f$ designates a…

Probability · Mathematics 2015-09-30 Yaozhong Hu , David Nualart , Samy Tindel , Fangjun Xu

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

Number Theory · Mathematics 2020-12-08 Dmitry I. Khomovsky

For a compact set $K\subset \mathbb{R}^m$, we have two indexes given under simple parameters of the set $K$ (these parameters go back to Besicovitch and Taylor in the late 50's). In the present paper we prove that with the exception of a…

Functional Analysis · Mathematics 2019-05-22 Panagiotis Georgopoulos , Constantinos Gryllakis

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

Number Theory · Mathematics 2025-05-15 Daniel R. Johnston , Simon N. Thomas

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

Number Theory · Mathematics 2010-10-11 Matthew L. Smith

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

Let $k\geq2$ and $s$ be positive integers. Let $\theta\in(0,1)$ be a real number. In this paper, we establish that if $s>k(k+1)$ and $\theta>0.55$, then every sufficiently large natural number $n$, subjects to certain congruence conditions,…

Number Theory · Mathematics 2022-07-21 Mengdi Wang

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

Word $W$ is said to encounter word $V$ provided there is a homomorphism $\phi$ mapping letters to nonempty words so that $\phi(V)$ is a substring of $W$. For example, taking $\phi$ such that $\phi(h)=c$ and $\phi(u)=ien$, we see that…

Combinatorics · Mathematics 2016-10-18 Joshua Cooper , Danny Rorabaugh

In this paper we explore a new hierarchy of classes of languages and infinite words and its connection with complexity classes. Namely, we say that a language belongs to the class $L_k$ if it is a subset of the catenation of $k$ languages…

Formal Languages and Automata Theory · Computer Science 2014-06-17 J. Cassaigne , A. E. Frid , S. Puzynina , L. Q. Zamboni

A subsequence of a word $w$ is a word $u$ such that $u = w[i_1] w[i_2] \dots w[i_{k}]$, for some set of indices $1 \leq i_1 < i_2 < \dots < i_k \leq \lvert w\rvert$. A word $w$ is $k$-subsequence universal over an alphabet $\Sigma$ if every…

Formal Languages and Automata Theory · Computer Science 2023-11-20 Duncan Adamson , Pamela Fleischmann , Annika Huch , Tore Koß , Florin Manea , Dirk Nowotka

In this note we prove that for every sequence $(m_q)_{q}$ of positive integers and for every real $0<\delta\leqslant1$ there is a sequence $(n_q)_{q}$ of positive integers such that for every sequence $(H_q)_{q}$ of finite sets such that…

Combinatorics · Mathematics 2012-11-19 Stevo Todorcevic , Konstantinos Tyros

Let $\A=\{a_1<a_2<a_3.....<a_n<...\}$ be an infinite sequence of integers and let $R_2(n)=|\{(i,j):\ \ a_i+a_j=n;\ \ a_i,a_j\in \A;\ \ i\le j\}|$. We define $S_k=\s_{l=1}^k(R_2(2l)-R_2(2l+1))$. We prove that, if $L^{\infty}$ norm of…

Number Theory · Mathematics 2014-11-27 R. Balasubramanian , Sumit Giri

We prove a lower bound of exp(-C (log(2/alpha))^7)N^{k-1} to the number of solutions of an invariant equation in k variables, contained in a set of density alpha. Moreover, we give a Behrend-type construction for the same problem with the…

Number Theory · Mathematics 2023-06-16 Tomasz Kosciuszko