English
Related papers

Related papers: Explicit SoS lower bounds from high-dimensional ex…

200 papers

We consider the problem of computing exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We provide a hybrid numeric-symbolic algorithm…

Symbolic Computation · Computer Science 2026-02-24 Victor Magron , Mohab Safey El Din

This is a detailed version of the paper math.FA/0212273. The main motivation for this work was to find an explicit formula for a "Szego-regularized" determinant of a zeroth order pseudodifferential operator (PsDO) on a Zoll manifold. The…

Functional Analysis · Mathematics 2007-05-23 Dimitri Gioev

We report on an analysis of the Vasiliev construction for minimal bosonic higher-spin master fields with oscillators that are vectors of SO(D-1,2) and doublets of Sp(2,R). We show that, if the original master field equations are…

High Energy Physics - Theory · Physics 2007-05-23 A. Sagnotti , E. Sezgin , P. Sundell

The coupling of spin-3 gauge fields to three-dimensional Maxwell and $AdS$-Lorentz gravity theories is presented. After showing how the usual spin-3 extensions of the $AdS$ and the Poincar\'e algebras in three dimensions can be obtained as…

High Energy Physics - Theory · Physics 2018-07-19 Ricardo Caroca , Patrick Concha , Octavio Fierro , Evelyn Rodríguez , Patricio Salgado-Rebolledo

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

Algebraic Geometry · Mathematics 2023-03-10 Ngoc Hoang Anh Mai , Victor Magron

We construct explicit (i.e., non-random) examples of Salem sets in $\mathbb{R}^2$ of dimension $s$ for every $0 \leq s \leq 2$. In particular, we give the first explicit examples of Salem sets in $\mathbb{R}^2$ of dimension $0 < s < 1$.…

Classical Analysis and ODEs · Mathematics 2016-10-03 Kyle Hambrook

This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic constructions also called a tensor) and obtain upper bounds on the asymptotic complexity of matrix multiplication. Compared with…

Data Structures and Algorithms · Computer Science 2021-10-05 François Le Gall

We introduce the problem of constructing explicit variety evasive subspace families. Given a family $\mathcal{F}$ of subvarieties of a projective or affine space, a collection $\mathcal{H}$ of projective or affine $k$-subspaces is…

Computational Complexity · Computer Science 2024-10-15 Zeyu Guo

We introduce and develop a theory of orthogonality with respect to Sobolev inner products on the real line for sequences of functions with a tridiagonal, skew-Hermitian differentiation matrix. While a theory of such L2-orthogonal systems is…

Classical Analysis and ODEs · Mathematics 2022-06-16 Arieh Iserles , Marcus Webb

We investigate the high-dimensional regression problem using adjacency matrices of unbalanced expander graphs. In this frame, we prove that the $\ell_{2}$-prediction error and the $\ell_{1}$-risk of the lasso and the Dantzig selector are…

Statistics Theory · Mathematics 2015-03-17 Yohann de Castro

We construct two-dimensional families of complex hyperbolic structures on disc orbibundles over the sphere with three cone points. This contrasts with the previously known examples of the same type, which are locally rigid. In particular,…

Geometric Topology · Mathematics 2025-04-15 Hugo C. Botós , Carlos H. Grossi

The review is based on the author's papers since 1985 in which a new approach to the separation of variables (\SoV) has being developed. It is argued that \SoV, understood generally enough, could be the most universal tool to solve…

solv-int · Physics 2016-09-08 E. K. Sklyanin

In this work, third-order semi-implicit schemes on staggered meshes for the shallow water and Saint-Venant-Exner systems are presented. They are based on a third-order extension of the technique introduced in Cassulli \& Cheng [1]. The…

Numerical Analysis · Mathematics 2025-06-23 Enrique D. Fernandez-Nieto , Jose Garres-Diaz , Emanuele Macca , Giovanni Russo

We describe a general expansion of spherical (full-sky) bispectra into a set of orthogonal modes. For squeezed shapes, the basis separates physically-distinct signals and is dominated by the lowest moments. In terms of reduced bispectra, we…

Cosmology and Nongalactic Astrophysics · Physics 2024-07-23 Julien Carron , Antony Lewis

Deterministic constructions of expander graphs have been an important topic of research in computer science and mathematics, with many well-studied constructions of infinite families of expanders. In some applications, though, an infinite…

Data Structures and Algorithms · Computer Science 2015-07-07 Michael Dinitz , Michael Schapira , Asaf Valadarsky

Let $\mathbb{F}_p$ be a prime field of order $p>2$, and $A$ be a set in $\mathbb{F}_p$ with very small size in terms of $p$. In this note, we show that the number of distinct cubic distances determined by points in $A\times A$ satisfies…

Combinatorics · Mathematics 2018-07-03 Doowon Koh , Hossein Nassajian Mojarrad , Thang Pham , Claudiu Valculescu

This work studies the complexity of refuting the existence of a perfect matching in spectral expanders with an odd number of vertices, in the Polynomial Calculus (PC) and Sum of Squares (SoS) proof system. Austrin and Risse [SODA, 2021]…

Combinatorics · Mathematics 2026-02-12 Ari Biswas , Rajko Nenadov

We investigate operator growth in quantum systems with two-dimensional Schr\"odinger group symmetry by studying the Krylov complexity. While feasible for semisimple Lie algebras, cases such as the Schr\"odinger algebra which is…

Quantum Physics · Physics 2024-04-10 Dimitrios Patramanis , Watse Sybesma

We extend traditional complexity analyses of trust-region methods for unconstrained, possibly nonconvex, optimization. Whereas most complexity analyses assume uniform boundedness of the model Hessians, we work with potentially unbounded…

Optimization and Control · Mathematics 2025-12-01 Youssef Diouane , Mohamed Laghdaf Habiboullah , Dominique Orban

We introduce the concept of strong high-order approximate minimizers for nonconvex optimization problems. These apply in both standard smooth and composite non-smooth settings, and additionally allow convex or inexpensive constraints. An…

Optimization and Control · Mathematics 2020-01-30 Coralia Cartis , Nick Gould , Philippe L. Toint