English
Related papers

Related papers: Upper bounds for Grothendieck constants, quantum c…

200 papers

Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…

Data Structures and Algorithms · Computer Science 2019-06-14 Madhur Tulsiani , Julia Wolf

It is common in functional data analysis to look at a set of related functions: a set of learning curves, a set of brain signals, a set of spatial maps, etc. One way to express relatedness is through an additive model, whereby each…

Computation · Statistics 2014-02-21 Simon Barthelme

We show new upper bounds for permanents and hafnians, which are particularly useful for complex matrices. Multidimensional permanents and hyperhafnians are considered as well. The permanental bounds improve on a Hadamard type inequality of…

Classical Analysis and ODEs · Mathematics 2020-05-12 Bero Roos

We study the interplay of general relativity, the equivalence principle, and high-precision experiments involving atomic transitions and g factor measurements. In particular, we derive a generalized Dirac Hamiltonian, which describes both…

High Energy Physics - Phenomenology · Physics 2019-04-26 Ulrich D. Jentschura

We consider the problem of reproducing the correlations obtained by arbitrary local projective measurements on the two-qubit Werner state $\rho = v |\psi_- > <\psi_- | + (1- v ) \frac{1}{4}$ via a local hidden variable (LHV) model, where…

Applying Gaussian processes (GPs) to very large datasets remains a challenge due to limited computational scalability. Matrix structures, such as the Kronecker product, can accelerate operations significantly, but their application commonly…

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…

Metric Geometry · Mathematics 2022-07-12 Han Huang , Boaz A. Slomka , Tomasz Tkocz , Beatrice-Helen Vritsiou

Recently, the author and Melentijevi\'c resolved the longstanding Gaussian curvature problem by proving the sharp inequality \[ |\mathcal{K}| < c_0 = \frac{\pi^2}{2} \] for minimal graphs over the unit disk, evaluated at the point of the…

Differential Geometry · Mathematics 2025-08-26 David Kalaj

Unconditional guaranteed lower and upper eigenvalue bounds are mandatory for the understanding of the Schr\"odinger eigenvalue spectrum and its spectral gaps. While upper eigenvalue bounds are naturally induced by conforming…

Numerical Analysis · Mathematics 2026-04-24 Carsten Carstensen , Tim Stiebert

Let X be a noetherian scheme of finite Krull dimension, having 2 invertible in its ring of regular functions, an ample family of line bundles, and a global bound on the virtual mod-2 cohomological dimensions of its residue fields. We prove…

K-Theory and Homology · Mathematics 2015-02-20 A. J. Berrick , M. Karoubi , M. Schlichting , P. A. Østvær

The quantum Grothendieck ring of a certain category of finite-dimensional modules over a quantum loop algebra associated with a complex finite-dimensional simple Lie algebra $\mathfrak{g}$ has a quantum cluster algebra structure of…

Representation Theory · Mathematics 2023-10-11 Il-Seung Jang , Kyu-Hwan Lee , Se-jin Oh

For smooth mappings of the unit disc into the oriented Grassmannian manifold $\mathbb G_{n,2}$, H\'elein (2002) conjectured the global existence of Coulomb frames with bounded conformal factor provided the integral of $|\boldsymbol A|^2$,…

Analysis of PDEs · Mathematics 2020-11-10 P. I. Plotnikov , J. F. Toland

Coherence vectors and correlation matrices are important functions frequently used in physics. The numerical calculation of these functions directly from their definitions, which involves Kronecker products and matrix multiplications, may…

Quantum Physics · Physics 2016-07-01 Jonas Maziero

The rigidity of a matrix measures how many of its entries need to be changed in order to reduce its rank to some value. Good lower bounds on the rigidity of an explicit matrix would imply good lower bounds for arithmetic circuits as well as…

Quantum Physics · Physics 2007-05-23 Ronald de Wolf

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-10 Corinna Coupette , Christoph Lenzen

The Gr\"uneisen ratio $\Gamma$, i.e., the singular part of the ratio of thermal expansion to the specific heat, has been broadly employed to explore both finite-$T$ and quantum critical points (QCPs). For a genuine quantum phase transition…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Quantum Physics · Physics 2019-08-20 Mark Bun , Robin Kothari , Justin Thaler

We use rational approximants to study missing higher orders in the massless scalar-current quark correlator. We predict the yet unknown six-loop coefficient of its imaginary part, related to $\Gamma(H\to b \bar b)$, to be $c_5=-6900\pm…

High Energy Physics - Phenomenology · Physics 2022-02-02 Diogo Boito , Cristiane Y. London , Pere Masjuan

A classical inequality by Gr\"unbaum provides a sharp lower bound for the ratio $\mathrm{vol}(K^{-})/\mathrm{vol}(K)$, where $K^{-}$ denotes the intersection of a convex body with non-empty interior $K\subset\mathbb{R}^n$ with a halfspace…

The Gilbert--Varshamov (GV) bound is a central benchmark in coding theory, establishing existential guarantees for error-correcting codes and serving as a baseline for both Hamming and quantum fault-tolerant information processing. Despite…

Information Theory · Computer Science 2026-01-27 Chen Yuan , Ruiqi Zhu
‹ Prev 1 3 4 5 6 7 10 Next ›