Related papers: Improved Fourier restriction estimates in higher d…

Rapid growth of constraints is often observed in free evolutions of highly gravitating systems. To alleviate this problem we investigate the effect of adding spatial derivatives of the constraints to the right hand side of the evolution…

In the last decade, various works have used statistics on relations to improve both the theory and practice of conjunctive query execution. Starting with the AGM bound which took advantage of relation sizes, later works incorporated…

Let $\bf f$ be a primitive Hilbert cusp form of weight $k$ and level $\mathfrak{n}$ with Fourier coefficients $c_{\bf f}(\mathfrak{m})$. We prove a non-trivial upper bound for almost all Fourier coefficients $c_{\bf f}(\mathfrak{m})$ of…

In this paper, we present a different proof on the discrete Fourier restriction. The proof recovers Bourgain's level set result on Strichartz estimates associated with Schr\"odinger equations on torus. Some sharp estimates on…

We consider several problems related to the restriction of $(\nabla^k) \hat{f}$ to a surface $\Sigma \subset \mathbb R^d$ with nonvanishing Gauss curvature. While such restrictions clearly exist if $f$ is a Schwartz function, there are few…

This paper develops an information-theoretic framework for algorithmic complexity under regular identifiable fibering. The central question is: when a decoder is given information about the fiber label in a fibered geometric set, how much…

We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…

Grothendieck constants $K_G(d)$ bound the advantage of $d$-dimensional strategies over $1$-dimensional ones in a specific optimisation task. They have applications ranging from approximation algorithms to quantum nonlocality. However, apart…

To resolve the non-convex optimization problem in partial wave analysis, this paper introduces a novel approach that incorporates fraction constraints into the likelihood function. This method offers significant improvements in both the…

In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…

We give improved bounds for the equidistribution of (multiparameter) nilsequences subject to any degree filtration. The bounds we obtain are single exponential in dimension, improving on double exponential bounds of Green and Tao. To obtain…

We prove weighted versions of the 2D Restriction Conjecture for the unit sphere in $\mathbb{R}^2$. Our results involve the weight functions $(1+|x|)^\alpha(1+|y|)^\beta$ and $(1+|x|+|y|)^\gamma$ with $\alpha,\beta,\gamma\geq 0$.

The classical Stein--Tomas theorem extends the theory of linear Fourier restriction estimates from smooth manifolds to fractal measures exhibiting Fourier decay. In the multilinear setting, transversality allows for Fourier extension…

In this article we revisit some classical conjectures in harmonic analysis in the setting of mixed norm spaces $L^p_{rad} L^2_{ang} (\mathbb{R}^n)$. We produce sharp bounds for the restriction of the Fourier transform to compact…

The Frank Wolfe algorithm (FW) is a popular projection-free alternative for solving large-scale constrained optimization problems. However, the FW algorithm suffers from a sublinear convergence rate when minimizing a smooth convex function…

We establish some bounds on the number of higher-dimensional partitions by volume. In particular, we give bounds via vector partitions and MacMahon's numbers.

Using the polynomial method of Dvir \cite{dvir}, we establish optimal estimates for Kakeya sets and Kakeya maximal functions associated to algebraic varieties $W$ over finite fields $F$. For instance, given an $n-1$-dimensional projective…

We conjecture an upper bound on the growth of the Yokota invariant of polyhedral graphs, extending a previous result on the growth of the $6j$-symbol. Using Barrett's Fourier transform we are able to prove this conjecture in a large family…

We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…

We compute effective bounds for $\alpha(n)$, the Fourier coefficients of Ramunujan's mock theta function $f(q)$ utilizing a finite algebraic formula due to Bruinier and Schwagenscheidt. We then use these bounds to prove two conjectures of…