English
Related papers

Related papers: Expansion, divisibility and parity

200 papers

For every fixed finite field $\F_q$, $p \in (0,1-1/q)$ and $\epsilon > 0$, we prove that with high probability a random subspace $C$ of $\F_q^n$ of dimension $(1-H_q(p)-\epsilon)n$ has the property that every Hamming ball of radius $pn$ has…

Information Theory · Computer Science 2010-01-13 Venkatesan Guruswami , Johan Hastad , Swastik Kopparty

Let $D\in\mathbb{N}$, let $A>D+1$, and let $Q\geqslant3$. Consider the class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ such that $|\sum_{n\leqslant x}f(n)|\le x(\log Q)^{A-D-1}/(\log x)^A$ for all $x\geqslant Q$, and such that…

Number Theory · Mathematics 2026-05-05 Dimitris Koukoulopoulos

Let $F$ and $G$ be linear recurrences over a number field $\mathbb{K}$, and let $\mathfrak{R}$ be a finitely generated subring of $\mathbb{K}$. Furthermore, let $\mathcal{N}$ be the set of positive integers $n$ such that $G(n) \neq 0$ and…

Number Theory · Mathematics 2017-08-29 Carlo Sanna

Let $\Omega\subset\mathbb{R}^\nu$, $\nu\ge 2$, be a $C^{1,1}$ domain whose boundary $\partial\Omega$ is either compact or behaves suitably at infinity. For $p\in(1,\infty)$ and $\alpha>0$, define \[…

Spectral Theory · Mathematics 2017-04-27 Hynek Kovarik , Konstantin Pankrashkin

Let $x_1,...,x_n$ be a list of real numbers, let $s :=\sum_{i=1}^{n}x_i$ and let $h:\mathbb{N} \rightarrow \mathbb{R}$ be a function. We gave a necessary and sufficient condition for $s>h(n)$ (respectively, $s<h(n)$). Let $G=(V,E)$ be a…

Combinatorics · Mathematics 2024-03-05 Xiwu Yang

We investigate locality of the supercritical regime for Bernoulli percolation on transitive graphs with polynomial growth, by which we mean the following. Take a transitive graph of polynomial growth $\mathscr{G}$ satisfying…

Probability · Mathematics 2026-03-03 Sébastien Martineau , Christoforos Panagiotis

Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving upon recent bounds of the first three and…

Number Theory · Mathematics 2019-10-22 Kevin Ford , Ben Green , Sergei Konyagin , James Maynard , Terence Tao

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. We provide details for the proof of a statement of Erd\H{o}s implying that, for any function $\xi(n)$ tending to infinity with…

Number Theory · Mathematics 2019-05-01 Gérald Tenenbaum

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

Combinatorics · Mathematics 2013-01-04 Terence Tao

In this article, we try to give an answer to the simple question: ``\textit{What is the critical growth rate of the dimension $p$ as a function of the sample size $n$ for which the Central Limit Theorem holds uniformly over the collection…

Probability · Mathematics 2020-08-12 Debraj Das , Soumendra Lahiri

Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an…

Number Theory · Mathematics 2026-05-04 John M. Campbell

Let $G=(V,E)$ be a graph of density $p$ on $n$ vertices. Following Erd\H{o}s, \L uczak and Spencer, an $m$-vertex subgraph $H$ of $G$ is called {\em full} if $H$ has minimum degree at least $p(m - 1)$. Let $f(G)$ denote the order of a…

Combinatorics · Mathematics 2016-10-24 Victor Falgas-Ravry , Klas Markström , Jacques Verstraëte

We study properties of arithmetic sets coming from multiplicative number theory and obtain applications in the theory of uniform distribution and ergodic theory. Our main theorem is a generalization of K\'atai's orthogonality criterion.…

Number Theory · Mathematics 2022-05-16 V. Bergelson , J. Kułaga-Przymus , M. Lemańczyk , F. K. Richter

We estimate exponential sums with the Fermat-like quotients $$ f_g(n) = \frac{g^{n-1} - 1}{n} \mand h_g(n)=\frac{g^{n-1}-1}{P(n)}, $$ where $g$ and $n$ are positive integers, $n$ is composite, and P(n) is the largest prime factor of $n$.…

Number Theory · Mathematics 2007-05-23 William D. Banks , Moubariz Z. Garaev , Florian Luca , Igor E. Shparlinski

For $\alpha >0$, let $$\mathscr{A}=\{ a_1<a_2<a_3<\cdots\}$$ and $$\mathscr{L}=\{ \ell_1, \ell_2, \ell_3,\cdots\} \quad \text{(not~necessarily~different)}$$ be two sequences of positive integers with $\mathscr{A}(m)>(\log m)^\alpha $ for…

Number Theory · Mathematics 2023-04-14 Yong-Gao Chen , Yuchen Ding

Let $F(X)= \prod_{i=1}^k(a_iX+b_i)$ be a polynomial with $a_i, b_i$ being integers. Suppose the discriminant of $F$ is non-zero and $F$ is admissible. Given any natural number $N$, let $S(F,N)$ denotes those integers less than or equal to…

Number Theory · Mathematics 2014-04-01 Gyan Prakash

In this paper, we analyze the convergence speed of a series related with $\mathcal{P}_\tau^\alpha f$ by discussing the behavior of the family of operators \begin{equation*} T_N^\alpha f(t) = \sum_{j=N_1}^{N_2}…

Classical Analysis and ODEs · Mathematics 2020-12-15 Chao Zhang , Tao Ma , José L. Torrea

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

Combinatorics · Mathematics 2016-10-17 Jacob Fox , Janos Pach , Andrew Suk

For a family of interpolation norms $\| \cdot \|_{1,2,s}$ on $\mathbb{R}^n$, we provide a distribution over random matrices $\Phi_s \in \mathbb{R}^{m \times n}$ parametrized by sparsity level $s$ such that for a fixed set $X$ of $K$ points…

Data Structures and Algorithms · Computer Science 2015-06-03 Felix Krahmer , Rachel Ward

We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…

Combinatorics · Mathematics 2024-02-23 Ilay Hoshen , Wojciech Samotij , Maksim Zhukovskii