Related papers: Discrete Fourier restriction via efficient congrue…

We propose an inexact proximal augmented Lagrangian framework with explicit inner problem termination rule for composite convex optimization problems. We consider arbitrary linearly convergent inner solver including in particular stochastic…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

We prove sharp stability estimates for the Truncated Laplace Transform and Truncated Fourier Transform. The argument combines an approach recently introduced by Alaifari, Pierce and the second author for the truncated Hilbert transform with…

We study congruences involving truncated hypergeometric series of the form_rF_{r-1}(1/2,...,1/2;1,...,1;\lambda)_{(mp^s-1)/2} = \sum_{k=0}^{(mp^s-1)/2} ((1/2)_k/k!)^r \lambda^k where p is a prime and m, s, r are positive integers. These…

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

Karush-Kuhn-Tucker (KKT) conditions for equality and inequality constrained optimization problems on smooth manifolds are formulated. Under the Guignard constraint qualification, local minimizers are shown to admit Lagrange multipliers. The…

We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As…

For an integer \( k \geq 2 \), the sequence of \( k \)-generalized Lucas numbers is defined by the recurrence relation \( L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \) for all \( n \geq 2 \), with initial conditions \( L_0^{(k)} = 2…

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

Bennett, Hart, Iosevich, Pakianathan, and Rudnev found an exponent $s<d$ such that any set $E\subset \mathbb{F}_q^d$ with $|E|\gtrsim q^s$ determines $\gtrsim q^{\binom{k+1}{2}}$ congruence classes of $(k+1)$-point configurations for $k\leq…

We ask, for which $n$ does there exists a $k$, $1 \leq k < n$ and $(k,n)=1$, so that $k/n$ has a continued fraction whose partial quotients are bounded in average by a constant $B$? This question is intimately connected with several other…

This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output detection, and maximum mean discrepancy calculation et al. The…

The concentration of measure phenomenon in Gauss' space states that every $L$-Lipschitz map $f$ on $\mathbb R^n$ satisfies \[ \gamma_{n} \left(\{ x : | f(x) - M_{f} | \geqslant t \} \right) \leqslant 2 e^{ - \frac{t^2}{ 2L^2} }, \quad t>0,…

Real-world data often comes in compressed form. Analyzing compressed data directly (without decompressing it) can save space and time by orders of magnitude. In this work, we focus on fundamental sequence comparison problems and try to…

We prove that for fixed $r\ge k\ge 2$, every $k$-uniform hypergraph on $n$ vertices having minimum codegree at least $(1-(\binom{r-1}{k-1}+\binom{r-2}{k-2})^{-1})n+o(n)$ contains the $(r-k+1)$th power of a tight Hamilton cycle. This result…

We prove that the class of convolution-type kernels satisfying suitable decay conditions of the Fourier transform, appearing in the works of Christ, Christ-Rubio de Francia, and Duoandikoetxea-Rubio de Francia gives rise to maximally…

We consider the problem of minimizing a continuous function f over a compact set K. We analyze a hierarchy of upper bounds proposed by Lasserre in [SIAM J. Optim. 21(3) (2011), pp. 864--885], obtained by searching for an optimal probability…

We study $k$-clustering problems with lower bounds, including $k$-median and $k$-means clustering with lower bounds. In addition to the point set $P$ and the number of centers $k$, a $k$-clustering problem with (uniform) lower bounds gets a…

We investigate the strong convergence properties of a proximal-gradient inertial algorithm with two Tikhonov regularization terms in connection to the minimization problem of the sum of a convex lower semi-continuous function $f$ and a…

In this paper we find the sharp forms and characterize the complex-valued extremizers of the adjoint Fourier restriction inequalities on the sphere $$\big\|\widehat{f \sigma}\big\|_{L^{p}(\mathbb{R}^{d})} \lesssim…