English
Related papers

Related papers: Discrete Fourier restriction via efficient congrue…

200 papers

A classical result of Aubin states that the constant in Moser-Trudinger-Onofri inequality on $\mathbb{S}^{2}$ can be imporved for furnctions with zero first order moments of the area element. We generalize it to higher order moments case.…

Differential Geometry · Mathematics 2020-06-29 Sun-Yung A. Chang , Fengbo Hang

We give a simple method to estimate the number of distinct copies of some classes of spanning subgraphs in hypergraphs with high minimum degree. In particular, for each $k\geq 2$ and $1\leq \ell\leq k-1$, we show that every $k$-graph on $n$…

Combinatorics · Mathematics 2024-11-20 Richard Montgomery , Matías Pavez-Signé

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Number Theory · Mathematics 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

In this article, we define the Fourier-Dunkl transform, which generalizes the Fourier transform. We prove Strichartz's restriction theorem for the Fourier-Dunkl transform for a cone-hyper-surface and its generalisation to the family of…

Classical Analysis and ODEs · Mathematics 2022-12-08 P Jitendra Kumar Senapati , Pradeep Boggarapu , Shyam Swarup Mondal , Hatem Mejjaoli

In the work of Donoho and Stark, they study a manifestation of the uncertainty principle in signal recovery. They conjecture that, for a function with support of bounded size T, the maximum concentration of its Fourier transform in the low…

Functional Analysis · Mathematics 2023-07-11 Oriol Baeza-Guasch

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Computational Geometry · Computer Science 2012-05-03 Boris Bukh , Gabriel Nivasch

Given a positive integer $N$ and real number $\alpha\in [0, 1]$, let $m(\alpha,N)$ denote the minimum, over all sets $A\subset \mathbb{Z}/N\mathbb{Z}$ of size at least $\alpha N$, of the normalized count of 3-term arithmetic progressions…

Combinatorics · Mathematics 2014-09-11 Pablo Candela , Olof Sisask

We establish a sharp adjoint Fourier restriction inequality for the end-point Tomas-Stein restriction theorem on the circle under a certain arithmetic constraint on the support set of the Fourier coefficients of the given function. Such…

Classical Analysis and ODEs · Mathematics 2024-02-15 Valentina Ciccone , Felipe Gonçalves

Fourier series of smooth, non-periodic functions on $[-1,1]$ are known to exhibit the Gibbs phenomenon, and exhibit overall slow convergence. One way of overcoming these problems is by using a Fourier series on a larger domain, say $[-T,T]$…

Numerical Analysis · Computer Science 2015-09-02 Roel Matthysen , Daan Huybrechs

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

For each $1\leq i \le n$, let $k_i\geq 1$ and let $\Delta_i$ be a set of vertices of a non-degenerate simplex of $k_i+1$ points in $\mathbb{R}^{k_i+1}$. If $A\subseteq [0,1]^{k_1+1}\times \cdots \times [0,1]^{k_n+1}$ is a Lebesgue…

Combinatorics · Mathematics 2022-06-22 Polona Durcik , Mario Stipčić

Let M be a subset of {0, .., n} and F be a family of subsets of an n element set such that the size of A intersection B is in M for every A, B in F. Suppose that l is the maximum number of consecutive integers contained in M and n is…

Combinatorics · Mathematics 2012-05-04 Dhruv Mubayi , Vojtech Rodl

We improve the discretization technique for weighted Lorentz norms by eliminating all "non-degeneracy" restrictions on the involved weights. We use the new method to provide equivalent estimates on the optimal constant $C$ such that the…

Functional Analysis · Mathematics 2023-02-14 Martin Křepela , Zdeněk Mihula , Hana Turčinová

Let $l\geq 6$ be any integer, where $l\equiv 2$ mod $4$. Suppose that $\mu(\tau)d\tau$ is a measure with bounded variation and is supported on a compact subset of the complex plane, where…

Number Theory · Mathematics 2021-05-06 Naser Talebizadeh Sardari

We establish various forms of the following certainty principle: a set $S \subset \mathbb{R}^{n}$ contains a given finite linear pattern, provided that $S$ is a support of the Fourier transform of a sufficiently singular probability measure…

Classical Analysis and ODEs · Mathematics 2024-10-22 Rami Ayoush

We study the limiting behavior of the discrete spectra associated to the principal congruence subgroups of a reductive group over a number field. While this problem is well understood in the cocompact case (i.e., when the group is…

Representation Theory · Mathematics 2015-06-10 Tobias Finis , Erez Lapid , Werner Mueller

We prove new large sieve inequalities for the Fourier coefficients $\rho_{j\mathfrak{a}}(n)$ of exceptional Maass forms of a given level, weighted by sequences $(a_n)$ with sparse Fourier transforms - including two key types of sequences…

Number Theory · Mathematics 2026-02-25 Alexandru Pascadi

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

Combinatorics · Mathematics 2023-06-07 Dmitry Krachun , Fedor Petrov

Given a subset S of R^n, let c(S,k) be the smallest number t such that whenever finitely many convex sets have exactly k common points in S, there exist at most t of these sets that already have exactly k common points in S. For S = Z^n,…

Combinatorics · Mathematics 2016-02-26 Gennadiy Averkov , Bernardo González Merino , Matthias Henze , Ingo Paschke , Stefan Weltge
‹ Prev 1 3 4 5 6 7 10 Next ›