English
Related papers

Related papers: On Sumsets and Spectral Gaps

200 papers

If $s$ is a positive integer and $A$ is a set of positive integers, we say that $B$ is an $s$-divisor of $A$ if $\sum_{b\in B} b\mid s\sum_{a\in A} a$. We study the maximal number of $k$-subsets of an $n$-element set that can be…

Combinatorics · Mathematics 2015-05-21 Samuel Zbarsky

For $n\in \mathbb{N}$ let $S_n$ be the smallest number $S>0$ satisfying the inequality $$ \int_K f \le S \cdot |K|^{\frac 1n} \cdot \max_{\xi\in S^{n-1}} \int_{K\cap \xi^\bot} f $$ for all centrally-symmetric convex bodies $K$ in…

Metric Geometry · Mathematics 2017-08-24 Bo'az Klartag , Alexander Koldobsky

Suppose that f is a boolean function from F_2^n to {0,1} with spectral norm (that is the sum of the absolute values of its Fourier coefficients) at most M. We show that f may be expressed as +/- 1 combination of at most 2^(2^(O(M^4)))…

Classical Analysis and ODEs · Mathematics 2010-04-02 Ben Green , Tom Sanders

Let $f$ be a smooth real function with strictly monotone first $k$ derivatives. We show that for a finite set $A$, with $|A+A|\leq K|A|$, $|2^kf(A)-(2^k-1)f(A)|\gg_k |A|^{k+1-o(1)}/K^{O_k(1)}$. We deduce several new sum-product type…

Number Theory · Mathematics 2020-05-04 Brandon Hanson , Oliver Roche-Newton , Misha Rudnev

The Fourier spectrum is a family of dimensions that interpolates between the Fourier and Hausdorff dimensions and are defined in terms of certain energies which capture Fourier decay. In this paper we obtain a convenient discrete…

Classical Analysis and ODEs · Mathematics 2024-03-20 Marc Carnovale , Jonathan M. Fraser , Ana E. de Orellana

Let $S$ be a finite set of primes. The $S$-part $[m]_S$ of a non-zero integer $m$ is the largest positive divisor of $m$ that is composed of primes from $S$. In 2013, Gross and Vincent proved that if $f(X)$ is a polynomial with integer…

Number Theory · Mathematics 2023-09-19 Yann Bugeaud , Jan-Hendrik Evertse , Kálmán Győry

For integers $n \geq k \geq 1$, the {\em Kneser graph} $K(n, k)$ is the graph with vertex-set consisting of all the $k$-element subsets of $\{1,2,\ldots,n\}$, where two $k$-element sets are adjacent in $K(n,k)$ if they are disjoint. We show…

Combinatorics · Mathematics 2025-03-19 Hou Tin Chau , David Ellis , Ehud Friedgut , Noam Lifshitz

A subset P of N x N is called Schur bounded if every infinite matrix with bounded entries which is zero off of P yields a bounded Schur multiplier on B(H). Such sets are characterized as being the union of a subset with at most k entries in…

Operator Algebras · Mathematics 2007-05-23 Kenneth R. Davidson , Allan P. Donsig

For an integer $m >1$, we denote by $P(m)$ the largest prime divisor of $m$. We prove that $\limsup_{n \rightarrow +\infty} P(n!+1)/n \geqslant 1+9\log 2>7.238$, which improves a result of Stewart. More generally, for any nonzero polynomial…

Number Theory · Mathematics 2021-03-30 Li Lai

Let $f$ be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let $\{\lambda_f(n)\}_n$ be its sequence of normalized Fourier coefficients. We show that if $K/ \mathbb{Q}$ is any number field, and $\mathcal{N}_K$ denotes the…

Number Theory · Mathematics 2022-06-07 Alexander P. Mangerel

Let $i(n,k)$ be the proportion of permutations $\pi\in\mathcal{S}_n$ having an invariant set of size $k$. In this note we adapt arguments of the second author to prove that $i(n,k) \asymp k^{-\delta} (1+\log k)^{-3/2}$ uniformly for $1\leq…

Combinatorics · Mathematics 2019-10-22 Sean Eberhard , Kevin Ford , Ben Green

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

Number Theory · Mathematics 2016-11-10 Laurent Habsieger , Alain Plagne

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

Data Structures and Algorithms · Computer Science 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

We show that if A is a subset of F_2^n and |A+A| < K|A| then A is contained in a subspace of size at most 2^{O(K^{3/2}log K)}|A|. This improves on the previous best of 2^{O(K^2)}.

Number Theory · Mathematics 2010-04-02 Tom Sanders

We consider simultaneous $(s,s+t,s+2t,\dots,s+pt)$-core partitions in the large-$p$ limit, or (when $s<t$), partitions in which no hook may be of length $s \pmod{t}$. We study generating functions, containment properties, and congruences…

Combinatorics · Mathematics 2025-12-18 William Keith , Rishi Nath , James Sellers

We analyze sumsets A+B = {a+b : a in A, b in B} where A,B are sets of integers, A is infinite, and B has positive upper Banach density. For each k, we show that A+B contains at least the expected density of k-term arithmetic progressions…

Dynamical Systems · Mathematics 2010-11-23 John T. Griesmer

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

Number Theory · Mathematics 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

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

Let $F$ be a Siegel cusp form of degree 2, even weight $k \geq 2$ and odd squarefree level $N$. We undertake a detailed study of the analytic properties of Fourier coefficients $a(F,S)$ of $F$ at fundamental matrices $S$ (i.e., with $-4…

Number Theory · Mathematics 2023-06-22 Jesse Jääsaari , Stephen Lester , Abhishek Saha

In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i \in Q in groups F_2^n is…

Number Theory · Mathematics 2007-12-10 I. D. Shkredov
‹ Prev 1 4 5 6 7 8 10 Next ›