Related papers: Upper bounds for Grothendieck constants, quantum c…
We extend the De Giorgi--Nash--Moser theory to a class of kinetic Fokker-Planck equations and deduce new results on the Landau-Coulomb equation. More precisely, we first study the H{\"o}lder regularity and establish a Harnack inequality for…
Recently, Gottlob, Lee, Valiant, and Valiant (GLVV) presented an output size bound for join queries with functional dependencies (FD), based on a linear program on polymatroids. GLVV bound strictly generalizes the bound of Atserias, Grohe…
The Bekenstein bound takes the holographic principle into the realm of flat space, promising new insights on the relation of non-gravitational physics to quantum gravity. This makes it important to obtain a precise formulation of the bound.…
We provide a general framework for getting expected linear time constant factor approximations (and in many cases FPTASs) to several well-known problems in Computational Geometry, such as $k$-center clustering and farthest nearest neighbor.…
The fidelity susceptibility serves as a universal probe for quantum phase transitions, offering an order-parameter-free metric that captures ground-state sensitivity to Hamiltonian perturbations and exhibits critical scaling. Classical…
Many practical sampling patterns for function approximation on the rotation group utilizes regular samples on the parameter axes. In this paper, we relate the mutual coherence analysis for sensing matrices that correspond to a class of…
In practical conjugate gradient (CG) computations it is important to monitor the quality of the approximate solution to $Ax=b$ so that the CG algorithm can be stopped when the required accuracy is reached. The relevant convergence…
We consider Kramers-Fokker-Planck operators with general degenerate coefficients. We prove semiclassical hypocoercivity estimates for a large class of such operators. Then, we manage to prove Eyring-Kramers formulas for the bottom of the…
It is shown that for every $k\in \N$ there exists a Borel probability measure $\mu$ on $\{-1,1\}^{\R^{k}}\times \{-1,1\}^{\R^{k}}$ such that for every $m,n\in \N$ and $x_1,..., x_m,y_1,...,y_n\in S^{m+n-1}$ there exist…
Efficient optimization of quantum systems is a necessity for reaching fault tolerant thresholds. A standard tool for optimizing simulated quantum dynamics is the gradient-based \textsc{grape} algorithm, which has been successfully applied…
In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…
We treat an unbalanced shifted convolution sum of Fourier coefficients of cusp forms. As a consequence, we obtain an upper bound for correlation of three Hecke eigenvalues of holomorphic cusp forms $\sum_{H\leq h\leq…
We establish quantitative upper and lower bounds for Schr\"odinger operators with complex potentials that satisfy some weak form of sparsity. Our first result is a quantitative version of an example, due to S.\ Boegli (Comm. Math. Phys.,…
We consider Higgs production in gluon fusion and in particular the prediction of the Higgs transverse momentum distribution. We discuss the ambiguities affecting the matching procedure between fixed order matrix elements and the resummation…
Let $R$ be a polynomial ring over a field and $M= \bigoplus_n M_n$ a finitely generated graded $R$-module, minimally generated by homogeneous elements of degree zero with a graded $R$-minimal free resolution $\mathbf{F}$. A Cohen-Macaulay…
Our principal aim in the present article is to establish a uniform hybrid bound for individual values on the critical line of Hecke $L$-functions associated with cusp forms over the full modular group. This is rendered in the statement that…
In the classical transformer attention scheme, we are given three $n \times d$ size matrices $Q, K, V$ (the query, key, and value tokens), and the goal is to compute a new $n \times d$ size matrix $D^{-1} \exp(QK^\top) V$ where $D =…
The Colin de Verdi\`ere number $\mu(G)$ of a graph $G$ is the maximum corank of a Colin de Verdi\`ere matrix for $G$ (that is, of a Schr\"odinger operator on $G$ with a single negative eigenvalue). In 2001, Lov\'asz gave a construction that…
We prove a quantitative distortion theorem for iterated function systems that generate sets of continued fractions. As a consequence, we obtain upper and lower bounds on the Hausdorff dimension of any set of real or complex continued…
Let $A$ be an $s$-sparse Hermitian matrix, $f(x)$ be a univariate function, and $i, j$ be two indices. In this work, we investigate the query complexity of approximating $\bra{i} f(A) \ket{j}$. We show that for any continuous function…