English
Related papers

Related papers: On the uniform distribution in residue classes of …

200 papers

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

Number Theory · Mathematics 2024-04-02 Siddharth Iyer

We study the learnability of sums of independent integer random variables given a bound on the size of the union of their supports. For $\mathcal{A} \subset \mathbf{Z}_{+}$, a sum of independent random variables with collective support…

Data Structures and Algorithms · Computer Science 2020-11-13 Anindya De , Philip M. Long , Rocco A. Servedio

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

Number Theory · Mathematics 2018-12-18 Mohammad Javaheri

In this paper, we investigate the distribution of the maximum of partial sums of certain cubic exponential sums, commonly known as "Birch sums". Our main theorem gives upper and lower bounds (of nearly the same order of magnitude) for the…

Number Theory · Mathematics 2020-07-15 Youness Lamzouri

Using a probabilistic model, based on random walks on the additive group $\mathbb{Z}/m\mathbb{Z}$, we prove that the values of certain real character sums are uniformly distributed in residue classes modulo $m$.

Number Theory · Mathematics 2011-04-27 Youness Lamzouri , Alexandru Zaharescu

Let $\mathcal{A}$ be a union-closed family of sets with base set $b(\mathcal{A})=\bigcup_{A \in \mathcal{A}}A$ denoted by $[n]=\{1, \cdots, n\}$, and for any real $x>0$, let $\mathcal{A}_{<x} = \{A \in \mathcal{A} \ | \ |A| < x\}$. Also,…

Combinatorics · Mathematics 2025-09-17 Christopher Bouchard

The task of the binary classification problem is to determine which of two distributions has generated a length-$n$ test sequence. The two distributions are unknown; two training sequences of length $N$, one from each distribution, are…

Information Theory · Computer Science 2016-04-18 Dayu Huang , Sean Meyn

We generalize and solve the $\roman{mod}\,q$ analogue of a problem of Littlewood and Offord, raised by Vaughan and Wooley, concerning the distribution of the $2^n$ sums of the form $\sum_{i=1}^n\varepsilon_ia_i$, where each $\varepsilon_i$…

Number Theory · Mathematics 2016-09-06 Jerrold R. Griggs

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

Number Theory · Mathematics 2007-05-23 Pieter Moree

A seminal theorem due to Weyl states that if (a_n) is any sequence of distinct integers, then, for almost every real number x, the sequence (a_n x) is uniformly distributed modulo one. In particular, for almost every x in the unit interval,…

Logic · Mathematics 2012-07-17 Jeremy Avigad

A Sidon set is a set A of integers such that no integer has two essentially distinct representations as the sum of two elements of A. More generally, for every positive integer g, a B_2[g]-set is a set A of integers such that no integer has…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Let $G$ be a finite abelian group of order $n$, and for each $a\in G$ and integer $1\le h\le n$ let $\mathcal{F}_a(h)$ denote the family of all $h$-element subsets of $G$ whose sum is $a$. A problem posed by Katona and Makar-Limanov is to…

Combinatorics · Mathematics 2025-09-11 Jing Wang

In this paper we establish connections between covers of $\mathbb Z$ by residue classes and subset sums in a field. Suppose that $A_0=\{a_s(n_s)\}_{s=0}^k$ covers each integer at least $p$ times with the residue class…

Number Theory · Mathematics 2020-08-11 Zhi-Wei Sun

We study the typical behavior of the size of the ratio set $A/A$ for a random subset $A\subset \{1,\dots , n\}$. For example, we prove that $|A/A|\sim \frac{2\text{Li}_2(3/4)}{\pi^2}n^2 $ for almost all subsets $A \subset\{1,\dots ,n\}$. We…

Combinatorics · Mathematics 2021-06-09 Javier Cilleruelo , Jorge Guijarro-Ordonez

A random dense countable set is characterized (in distribution) by independence and stationarity. Two examples are `Brownian local minima' and `unordered infinite sample'. They are identically distributed. A framework for such concepts,…

Probability · Mathematics 2007-05-23 Boris Tsirelson

A More Sums Than Differences (MSTD, or sum-dominant) set is a finite set $A\subset \mathbb{Z}$ such that $|A+A|<|A-A|$. Though it was believed that the percentage of subsets of $\{0,...,n\}$ that are sum-dominant tends to zero, in 2006…

Number Theory · Mathematics 2011-12-15 Geoffrey Iyer , Oleg Lazarev , Steven J. Miller , Liyang Zhang

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

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in…

Number Theory · Mathematics 2016-12-08 Neil Lyall , Alex Rice

In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…

Combinatorics · Mathematics 2007-07-16 M. M. Skriganov