More Like this

1. On Weissler’s Conjecture on the Hamming Cube I

   https://doi.org/10.1093/imrn/rnaa363  

   Ivanisvili, P; Nazarov, F (December 2020, International Mathematics Research Notices)

   null (Ed.)

   Abstract Let $$1\leq p \leq q <\infty $$ and let $$w \in \mathbb{C}$$. Weissler conjectured that the Hermite operator $$e^{w\Delta }$$ is bounded as an operator from $$L^{p}$$ to $$L^{q}$$ on the Hamming cube $$\{-1,1\}^{n}$$ with the norm bound independent of $$n$$ if and only if $$\begin{align*} |p-2-e^{2w}(q-2)|\leq p-|e^{2w}|q. \end{align*}$$It was proved in [ 1], [ 2], and [ 17] in all cases except $$2<p\leq q <3$$ and $$3/2<p\leq q <2$$, which stood open until now. The goal of this paper is to give a full proof of Weissler’s conjecture in the case $p=q$. Several applications will be presented. 

   more » « less
2. Asymptotic stability of solitary waves of the 3D quadratic Zakharov-Kuznetsov equation

   https://doi.org/10.1353/ajm.2023.a913295  

   Farah, Luiz Gustavo; Holmer, Justin; Roudenko, Svetlana; Yang, Kai (December 2023, American Journal of Mathematics)

   Abstract: We consider the quadratic Zakharov-Kuznetsov equation $$\partial_t u + \partial_x \Delta u + \partial_x u^2=0$$ on $$\Bbb{R}^3$$. A solitary wave solution is given by $Q(x-t,y,z)$, where $$Q$$ is the ground state solution to $$-Q+\Delta Q+Q^2=0$$. We prove the asymptotic stability of these solitary wave solutions. Specifically, we show that initial data close to $$Q$$ in the energy space, evolves to a solution that, as $$t\to\infty$$, converges to a rescaling and shift of $Q(x-t,y,z)$ in $L^2$ in a rightward shifting region $$x>\delta t-\tan\theta\sqrt{y^2+z^2}$$ for $$0\leq\theta\leq{\pi\over 3}-\delta$$. 

   more » « less
3. Sharp lower bounds on the manifold widths of Sobolev and Besov spaces

   https://doi.org/10.1016/j.jco.2024.101884  

   Siegel, Jonathan W (December 2024, Journal of Complexity)

   We consider the problem of determining the manifold $$n$$-widths of Sobolev and Besov spaces with error measured in the $$L_p$$-norm. The manifold widths control how efficiently these spaces can be approximated by general non-linear parametric methods with the restriction that the parameter selection and parameterization maps must be continuous. Existing upper and lower bounds only match when the Sobolev or Besov smoothness index $$q$$ satisfies $$q\leq p$$ or $$1 \leq p \leq 2$$. We close this gap and obtain sharp lower bounds for all $$1 \leq p,q \leq \infty$$ for which a compact embedding holds. A key part of our analysis is to determine the exact value of the manifold widths of finite dimensional $$\ell^M_q$$-balls in the $$\ell_p$$-norm when $$p\leq q$$. Although this result is not new, we provide a new proof and apply it to lower bounding the manifold widths of Sobolev and Besov spaces. Our results show that the Bernstein widths, which are typically used to lower bound the manifold widths, decay asymptotically faster than the manifold widths in many cases. 

   more » « less
4. Quantum algorithms and approximating polynomials for composed functions with shared inputs

   https://doi.org/10.22331/q-2021-09-16-543  

   Bun, Mark; Kothari, Robin; Thaler, Justin (September 2021, Quantum)

   We give new quantum algorithms for evaluating composed functions whose inputs may be shared between bottom-level gates. Let f be an m -bit Boolean function and consider an n -bit function F obtained by applying f to conjunctions of possibly overlapping subsets of n variables. If f has quantum query complexity Q ( f ) , we give an algorithm for evaluating F using O ~ ( Q ( f ) ⋅ n ) quantum queries. This improves on the bound of O ( Q ( f ) ⋅ n ) that follows by treating each conjunction independently, and our bound is tight for worst-case choices of f . Using completely different techniques, we prove a similar tight composition theorem for the approximate degree of f .By recursively applying our composition theorems, we obtain a nearly optimal O ~ ( n 1 − 2 − d ) upper bound on the quantum query complexity and approximate degree of linear-size depth- d AC 0 circuits. As a consequence, such circuits can be PAC learned in subexponential time, even in the challenging agnostic setting. Prior to our work, a subexponential-time algorithm was not known even for linear-size depth-3 AC 0 circuits.As an additional consequence, we show that AC 0 ∘ ⊕ circuits of depth d + 1 require size Ω ~ ( n 1 / ( 1 − 2 − d ) ) ≥ ω ( n 1 + 2 − d ) to compute the Inner Product function even on average. The previous best size lower bound was Ω ( n 1 + 4 − ( d + 1 ) ) and only held in the worst case (Cheraghchi et al., JCSS 2018). 

   more » « less
5. Asymptotic second moment of Dirichlet L -functions along a thin coset

   https://doi.org/10.1017/fms.2025.44  

   Garcia, Bradford; Young, Matthew P (January 2025, Forum of Mathematics, Sigma)

   Abstract We prove an asymptotic formula for the second moment of central values of DirichletL-functions restricted to a coset. More specifically, consider a coset of the subgroup of characters modulodinside the full group of characters moduloq. Suppose that$$\nu _p(d) \geq \nu _p(q)/2$$for all primespdividingq. In this range, we obtain an asymptotic formula with a power-saving error term; curiously, there is a secondary main term of rough size$$q^{1/2}$$here which is not predicted by the integral moments conjecture of Conrey, Farmer, Keating, Rubinstein, and Snaith. The lower-order main term does not appear in the second moment of the Riemann zeta function, so this feature is not anticipated from the analogous archimedean moment problem. We also obtain an asymptotic result for smallerd, with$$\nu _p(q)/3 \leq \nu _p(d) \leq \nu _p(q)/2$$, with a power-saving error term fordlarger than$$q^{2/5}$$. In this more difficult range, the secondary main term somewhat changes its form and may have size roughlyd, which is only slightly smaller than the diagonal main term. 

   more » « less