English
Related papers

Related papers: $2$-large sets are sets of Bohr recurrence

200 papers

We show that for every finite nonempty set L of integers greater than or equal to 2 there are a numerical monoid H and a squarefree element a $\in$ H whose set of lengths L(a) is equal to L.

Commutative Algebra · Mathematics 2018-01-18 Alfred Geroldinger , Wolfgang Schmid

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

A system of linear equations $L$ is common over $\mathbb{F}_p$ if, as $n\to\infty$, any 2-coloring of $\mathbb{F}_p^n$ gives asymptotically at least as many monochromatic solutions to $L$ as a random 2-coloring. The notion of common linear…

Combinatorics · Mathematics 2024-05-22 Dingding Dong , Anqi Li , Yufei Zhao

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

Probability · Mathematics 2025-06-17 Marcus Michelen , Oren Yakir

In the present note we study the interrelations between the sets of so-called typical numbers and numbers that are normal in base two. Employing results by Nakai and Shiokawa, we exhibit examples of numbers that belong to one set but do not…

Logic · Mathematics 2024-01-23 Jakub Tomaszewski

We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along…

Combinatorics · Mathematics 2022-05-26 Matt Bowen

A good range of problems on trees can be described by the following general setting: Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, we need to estimate the largest possible absolute value…

Combinatorics · Mathematics 2025-07-15 Vuong Bui

The problem which can be viewed as the higher order version of an old question concerning Bohr sets is investigated: for any $d\in \N$ does the collection of $\{n\in \Z: S\cap (S-n)\cap...\cap (S-dn)\neq \emptyset\}$ with $S$ syndetic…

Dynamical Systems · Mathematics 2011-09-19 Wen Huang , Song Shao , Xiangdong Ye

A set of integers $S \subset \mathbb{N}$ is an $\alpha$-strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on $\alpha$, more specifically if $| (x+w) - (y+z) | \geq \max \{…

Combinatorics · Mathematics 2019-12-09 David Fabian , Juanjo Rué , Christoph Spiegel

We prove an old conjecture of Erd{\H o}s and Graham on sums of unit fractions: There exists a constant $b>0$ such that if we $r$-color the integers in $2,b^r]$, then there exists a monochromatic set $S$ such that $\sum_{n \in S} 1/n=1$.

Number Theory · Mathematics 2007-05-23 Ernest S. Croot

Suppose $A\subset \mathbb{R}$ of size $k$ has distinct consecutive $r$--differences, that is for $1 \leq i \leq k -r$, the $r$--tuples $$(a_{i+1} - a_i , \ldots , a_{i+r} - a_{i + r -1})$$ are distinct. Then for any finite $B \subset…

Number Theory · Mathematics 2018-06-06 Junxian Li , George Shakan

A long standing question asks whether $\mathbb{Z}$ is uniformly 2-repetitive [Justin 1972, Pirillo and Varricchio, 1994], that is, whether there is an infinite sequence over a finite subset of $\mathbb{Z}$ avoiding two consecutive blocks of…

Combinatorics · Mathematics 2016-10-03 Michaël Rao , Matthieu Rosenfeld

A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…

Combinatorics · Mathematics 2015-09-10 Alejandro Erickson , Abraham Isgur , Bradley W. Jackson , Frank Ruskey , Stephen M. Tanny

For a set of nonnegative integers $S$ let $R_{S}(n)$ denote the number of unordered representations of the integer $n$ as the sum of two different terms from $S$. In this paper we focus on partitions of the natural numbers into two sets…

Number Theory · Mathematics 2016-08-22 Sándor Z. Kiss , Csaba Sándor

Given a set $\mathcal{S}$ of positive measure on the circle and a set of integers $\Lambda$, one may consider the family of exponentials $E\left(\Lambda\right):=\left\{ e^{i\lambda t}\right\}_{\lambda\in\Lambda}$ and ask whether it is a…

Classical Analysis and ODEs · Mathematics 2016-06-13 Itay Londner , Alexander Olevskii

We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\ldots,n_s}$ there exists a monochromatic (i)…

Combinatorics · Mathematics 2019-05-14 József Balogh , Alexandr Kostochka , Mikhail Lavrov , Xujun Liu

Given a graph $G$ and an integer $k$, a token addition and removal ({\sf TAR} for short) reconfiguration sequence between two dominating sets $D_{\sf s}$ and $D_{\sf t}$ of size at most $k$ is a sequence $S= \langle D_0 = D_{\sf s}, D_1…

Discrete Mathematics · Computer Science 2020-07-01 Nicolas Bousquet , Alice Joffard , Paul Ouvrard

We construct explicit (i.e., non-random) examples of Salem sets in $\mathbb{R}^2$ of dimension $s$ for every $0 \leq s \leq 2$. In particular, we give the first explicit examples of Salem sets in $\mathbb{R}^2$ of dimension $0 < s < 1$.…

Classical Analysis and ODEs · Mathematics 2016-10-03 Kyle Hambrook

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

Number Theory · Mathematics 2020-10-01 Daqing Wan , Hang Yin

For $S$ a set of positive integers, and $k$ and $r$ fixed positive integers, denote by $f(S,k;r)$ the least positive integer $n$ (if it exists) such that within every $r$-coloring of $\{1,2,...,n\}$ there must be a monochromatic sequence…

Combinatorics · Mathematics 2007-05-23 Bruce M. Landman , Aaron Robertson