Related papers: Discrete Fourier restriction via efficient congrue…
We call a CNF formula linear if any two clauses have at most one variable in common. Let m(k) be the largest integer m such that any linear k-CNF formula with <= m clauses is satisfiable. We show that 4^k / (4e^2k^3) <= m(k) < ln(2) k^4…
Consider generalized adapted stochastic integrals with respect to independently scattered random measures with second moments. We use a decoupling technique, known as the "principle of conditioning", to study their stable convergence…
The Lagrange problem is established in the discrete field theory subject to constraints with values in a Lie group. For the admissible sections that satisfy a certain regularity condition, we prove that the critical sections of such…
We show that there exists a sequence $\{n_k, k\ge 1\}$ growing at least geometrically such that for any finite non-negative measure $\nu$ such that $\hat \nu\ge 0$, any $T>0$, $$ \int_{-2^{n_k} T}^{2^{n_k} T} \hat \nu(x) \dd x \ll_\e…
In this paper, we bound the number of solutions to a general Vinogradov system of equations $x_1^j+\dots+x_s^j=y_1^j+\dots+y_s^j$, $(1\leq j\leq k)$, as well as other related systems, in which the variables are required to satisfy digital…
We study the quantitative stability associated with the adjoint Fourier restriction inequality, focusing on the paraboloid and two-dimensional sphere cases. We show that these Strichartz-stability inequalities admit minimizers attaining…
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…
Let $G$ be a locally compact abelian group, and let $\widehat{G}$ denote its dual group, equipped with a Haar measure. A variant of the uncertainty principle states that for any $S \subset G$ and $\Sigma \subset \widehat{G}$, there exists a…
In this paper, we establish a general discrete Fourier restriction theorem. As an application, we make some progress on the discrete Fourier restriction associated with KdV equation.
In this paper we show that, if an increasing sequence $\Lambda=(\lambda_k)_{k\in\mathbb{Z}}$ has gaps going to infinity $\lambda_{k+1}-\lambda_k\to +\infty$ when $k\to\pm\infty$, then for every $T>0$ and every sequence…
We study the dynamics of a chain of coupled particles subjected to a restoring force (Klein-Gordon lattice) in the cases of either periodic or Dirichlet boundary conditions. Precisely, we prove that, when the initial data are of small…
We prove, in respect of an arbitrary Hecke congruence subgroup \Gamma =\Gamma_0(q_0) of the group SL(2,Z[i]), some new upper bounds (or `spectral large sieve inequalities') for sums involving Fourier coefficients of \Gamma -automorphic cusp…
For any large prime $q$, $x \leq 1$ and any real $k\geq 2$, we prove a lower bound for the following $2k$-th moment \begin{equation*} \sum_{\substack{\chi \in X_q^*}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k}, \end{equation*} where…
The adjoint Fourier restriction inequality for the sphere $S^2$ states that if $f\in\lt(S^2,\sigma)$ then $\widehat{f\sigma}\in L^4(\reals^3)$. We prove that all critical points $f$ of the functional…
Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…
A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…
We obtain partial improvement toward the pointwise convergence problem of Schr\"odinger solutions, in the general setting of fractal measure. In particular, we show that, for $n\geq 3$, $\lim_{t \to 0} e^{it\Delta}f(x) = f(x)$ almost…
Using the theory of Stienstra and Beukers, we prove various elementary congruences for the numbers \sum \binom{2i_1}{i_1}^2\binom{2i_2}{i_2}^2...\binom{2i_k}{i_k}^2, where k,n \in N, and the summation is over the integers i_1, i_2, ...i_k…
For N=1,2,..., let S_N be a simple random sample of size n=n_N from a population A_N of size N, where 0<=n<=N. Then with f_N=n/N, the sampling fraction, and 1_A the inclusion indicator that A is in S_N, for any H a subset of A_N of size k>=…
An iterative optimization method applied to a function $f$ on $\mathbb{R}^n$ will produce a sequence of arguments $\{\mathbf{x}_k\}_{k \in \mathbb{N}}$; this sequence is often constrained such that $\{f(\mathbf{x}_k)\}_{k \in \mathbb{N}}$…