English
Related papers

Related papers: Discrete Fourier restriction via efficient congrue…

200 papers

Consider any Dirichlet series sum a_n/n^z with nonnegative coefficients a_n and finite sum function f(z)=f(x+iy) when x is greater than 1. Denoting the partial sum a_1+...+a_N by s_N, the paper gives the following necessary and sufficient…

Number Theory · Mathematics 2008-07-04 Jacob Korevaar

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

In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…

Combinatorics · Mathematics 2020-10-20 Mehdi Makhul , Oliver Roche-Newton , Sophie Stevens , Audie Warren

Let $D$ be a set of positive integers. A $D$-diffsequence of length $k$ is a sequence of positive integers $a_1 < \cdots < a_k$ such that $a_{i+1}-a_i\in D$ for $i=1,\ldots,k-1$. For $D=\{2^i\mid i\in \mathbb{Z}_{\ge 0}\}$, it is known that…

Combinatorics · Mathematics 2025-09-01 Kanav Talwar , Utkarsh Gupta

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Combinatorics · Mathematics 2019-12-11 Imre Ruzsa , George Shakan , Jozsef Solymosi , Endre Szemerédi

Let $K_n(x)$ denote the Fej\'er kernel given by $$K_n(x)=\sum_{j=-n}^n\left(1-\frac{|j|}{n+1}\right)e^{-ijx}$$ and let $\sigma_nf(x)=(K_n\ast f)(x)$, where as usual $f\ast g$ denotes the convolution of $f$ and $g$. Let the sequence…

Classical Analysis and ODEs · Mathematics 2022-06-09 Sakin Demir

Bounds consistency is usually enforced on continuous constraints by first decomposing them into binary and ternary primitives. This decomposition has long been shown to drastically slow down the computation of solutions. To tackle this,…

Artificial Intelligence · Computer Science 2007-05-23 Frederic Goualard , Laurent Granvilliers

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

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

We generalize the notion of Davenport constants to a `higher degree' and obtain various lower and upper bounds, which are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. Two simple examples…

Combinatorics · Mathematics 2022-02-15 Yair Caro , Benjamin Girard , John R. Schmitt

Let $A \subseteq F_2^n$ be a set with $|2A| = K|A|$. We prove that if (1) for at least a fraction $1-K^{-9}$ of all $s \in 2A$, the set $(A+s) \cap A$ has size at most $L\cdot|A|/K$, or (2) for at least a fraction $K^{-L}$ of all $s \in…

Discrete Mathematics · Computer Science 2013-11-04 Thomas Holenstein

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

Number Theory · Mathematics 2016-09-14 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan , Roberto Tauraso , László Tóth

We develop refined Strichartz estimates at $L^2$ regularity for a class of time-dependent Schr\"{o}dinger operators. Such refinements begin to characterize the near-optimizers of the Strichartz estimate, and play a pivotal part in the…

Analysis of PDEs · Mathematics 2020-11-18 Casey Jao

Let $N$ be a fixed positive integer, and let $f\in S_k(N)$ be a primitive cusp form given by the Fourier expansion $f(z)=\sum_{n=1}^{\infty} \lambda_f(n)n^{\frac{k-1}{2}}e(nz)$. We consider the partial sum $S(x,f)=\sum_{n\leq…

Number Theory · Mathematics 2023-08-15 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

We show that for any union-closed family $\mathcal{F} \subseteq 2^{[n]}, \mathcal{F} \neq \{\emptyset\}$, there exists an $i \in [n]$ which is contained in a $0.01$ fraction of the sets in $\mathcal{F}$. This is the first known constant…

Combinatorics · Mathematics 2022-11-29 Justin Gilmer

We use transference principle to show that whenever $s$ is suitably large depending on $k \geq 2$, every sufficiently large natural number $n$ satisfying some congruence conditions can be written in the form $n = p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2019-03-06 Juho Salmensuu

We consider the sharp Sobolev-Poincar\'e constant for the embedding of $W^{1,2}_0(\Omega)$ into $L^q(\Omega)$. We show that such a constant exhibits an unexpected dual variational formulation, in the range $1<q<2$. Namely, this can be…

Analysis of PDEs · Mathematics 2021-06-11 Lorenzo Brasco

If $G$ is a finite Abelian group, define $s_{k}(G)$ to be the minimal $m$ such that a sequence of $m$ elements in $G$ always contains a $k$-element subsequence which sums to zero. Recently Bitz et al. proved that if $n = exp(G)$, then…

Combinatorics · Mathematics 2017-12-07 Jesse Geneson

In this paper, we use the Approximation Formula for the Fourier transform of the solution set of lattice points on k-spheres and methods of Bourgain and Ionescu to refine the l^p(Z^d)-boundedness results for discrete k- spherical maximal…

Classical Analysis and ODEs · Mathematics 2015-09-16 Kevin Hughes

For $ 1\le k <n$, we prove that for functions $F,G$ on $ {\Bbb R}^{n}$, any $k$-dimensional affine subspace $H \subset {\Bbb R}^{n}$, and $p,q,r \ge 2$ with $\frac{1}{p}+\frac{1}{q}+\frac{1}{r}=1$, one has the estimate $$…

Classical Analysis and ODEs · Mathematics 2016-05-13 Dan-Andrei Geba , Allan Greenleaf , Alex Iosevich , Eyvindur Palsson , Eric Sawyer