English
Related papers

Related papers: On a density conjecture about unit fractions

200 papers

In this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every aperiodic dynamical system, for every increasing sequence $(a_n)_{n\in\N}\subset\R_+$ such that $a_n\nearrow\infty$ and…

Dynamical Systems · Mathematics 2009-06-04 Olivier Durieu , Dalibor Volny

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é

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

Combinatorics · Mathematics 2012-12-03 Henry Towsner

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

We show that a dense subset of a sufficiently large group multiplication table contains either a large part of the addition table of the integers modulo some $k$, or the entire multiplication table of a certain large abelian group, as a…

Combinatorics · Mathematics 2019-04-10 Jason Long

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…

Dynamical Systems · Mathematics 2017-02-15 Alexander Fish

Let $s(n)$ denote the sum of the proper divisors of the natural number $n$. We show that the number of $n \leq x$ such that $s(n)$ is a sum of two squares has order of magnitude $x/\sqrt{\log x}$, which agrees with the count of $n \leq x$…

Number Theory · Mathematics 2019-03-01 Lee Troupe

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

Combinatorics · Mathematics 2014-12-17 Sean Eberhard

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

A well-known application of the dependent random choice asserts that any $n$-vertex graph $G$ with positive edge density contains a `rich' vertex subset $U$ of size $n^{1-o(1)}$ such that every pair of vertices in $U$ has at least…

Combinatorics · Mathematics 2024-02-23 Seonghyuk Im , Suyun Jiang , Hong Liu , Tuan Tran

We prove that if $E \subseteq \mathbb{R}^d$ ($d\geq 2$) is a Lebesgue-measurable set with density larger than $\frac{n-2}{n-1}$, then $E$ contains similar copies of every $n$-point set $P$ at all sufficiently large scales. Moreover,…

Classical Analysis and ODEs · Mathematics 2023-01-03 Kenneth Falconer , Vjekoslav Kovač , Alexia Yavicoli

For $S \in \mathbb{N}^n$ and $T \in \mathbb{N}$, the Subset Sum Problem (SSP) $\exists^? x \in \{0,1\}^n $ such that $S^T\cdot x = T$ can be interpreted as the problem of deciding whether the intersection of the positive unit hypercube $Q_n…

Computational Geometry · Computer Science 2024-10-31 Marius Costandin

This article examines the value distribution of $S_{N}(f, \alpha) := \sum_{n=1}^N f(n\alpha)$ for almost every $\alpha$ where $N \in \mathbb{N}$ is ranging over a long interval and $f$ is a $1$-periodic function with discontinuities or…

Number Theory · Mathematics 2023-11-02 Lorenz Frühwirth , Manuel Hauke

Let $\mathrm{d}(A)$ be the asymptotic density (if it exists) of a sequence of integers $A$. For any real numbers $0\leq\alpha\leq\beta\leq 1$, we solve the question of the existence of a sequence $A$ of positive integers such that…

Number Theory · Mathematics 2019-05-21 Pierre-Yves Bienvenu , François Hennecart

For any subset $A \subseteq \mathbb{N}$, we define its upper density to be $\limsup_{ n \rightarrow \infty } |A \cap \{ 1, \dotsc, n \}| / n$. We prove that every $2$-edge-colouring of the complete graph on $\mathbb{N}$ contains a…

Combinatorics · Mathematics 2018-10-23 Allan Lo , Nicolás Sanhueza-Matamala , Guanghui Wang

Let $n_1,\cdots,n_r$ be any finite sequence of integers and let $S$ be the set of all natural numbers $n$ for which there exists a divisor $d(x)=1+\sum_{i=1}^{deg(d)}c_ix^i$ of $x^n-1$ such that $c_i=n_i$ for $1\leq i \leq r$. In this paper…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

We offer a new proof of Furstenberg and Katznelson's density version of the Hales-Jewett Theorem: For any $\delta > 0$ there is some $N_0 \geq 1$ such that whenever $A \subseteq [k]^N$ with $N \geq N_0$ and $|A|\geq \delta k^N$, $A$…

Probability · Mathematics 2011-04-20 Tim Austin