中文
相关论文

相关论文: Sum of squares representation for the B\"ottcher-W…

200 篇论文

The vector valued theta series of a positive-definite even lattice is a modular form for the Weil representation of $\mathrm{SL}_2(\mathbb{Z})$. We show that the space of cusp forms for the Weil representation is generated by such…

数论 · 数学 2024-10-22 Manuel K. -H. Müller

Sum-of-squares (SOS) optimization provides a computationally tractable framework for certifying polynomial nonnegativity. If the considered problem is convex, the SOS problem can be transcribed into and solved by semi-definite programs.…

最优化与控制 · 数学 2026-04-14 Jan Olucak , Torbjørn Cunis

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…

数值分析 · 数学 2018-12-14 Alexander Taveira Blomenhofer

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

数论 · 数学 2025-07-01 Ruikai Chen

We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.

数论 · 数学 2020-02-05 Fernando Chamizo , Roberto J. Miatello

This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…

符号计算 · 计算机科学 2025-10-06 Zhenbing Zeng , Yong Huang , Lu Yang , Yongsheng Rao

Denote the maximum sos rank of $m \times n$ sum of squares (SOS) biquadratic forms by $BSR(m, n)$. In this paper, we show that $BSR(m, n) \ge z(m, n)$ and conjecture that $BSR(m, n) = z(m, n)$, where $z(m, n)$ is the Zarankiewicz number.…

最优化与控制 · 数学 2026-02-24 Chunfeng Cui , Liqun Qi , Yi Xu

We investigate the maximum sum-of-squares (SOS) rank of biquadratic forms in the critical case of $4 \times 3$ variables, where the general bounds are currently $7 \leq \mathrm{BSR}(4,3) \leq 11$. By analyzing two important structured…

最优化与控制 · 数学 2026-02-26 Yi Xu , Chunfeng Cui , Liqun Qi

Suppose a positive integer $n$ is written as a sum of squares of $m$ integers. What can one say about the value $T$ of the sum of these $m$ integers itself? Which $T$ can be obtained if one considers all possible representations of $n$ as a…

数论 · 数学 2019-02-22 Detlev W. Hoffmann

We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…

综合数学 · 数学 2015-04-30 Nikos Bagis , M. L Glasser

The moment-sum-of-squares (moment-SOS) hierarchy is one of the most celebrated and widely applied methods for approximating the minimum of an n-variate polynomial over a feasible region defined by polynomial (in)equalities. A key feature of…

最优化与控制 · 数学 2023-05-25 Sander Gribling , Sven Polak , Lucas Slot

We study sum-of-squares representations of symmetric univariate real matrix polynomials that are positive semidefinite along the real line. We give a new proof of the fact that every positive semidefinite univariate matrix polynomial of…

代数几何 · 数学 2017-07-27 Christoph Hanselka , Rainer Sinn

We prove that convex ternary quartic forms are sum-of-squares-convex (sos-convex). This result is in a meaningful sense the ``convex analogue'' a celebrated theorem of Hilbert from 1888, where he proves that nonnegative ternary quartic…

最优化与控制 · 数学 2024-04-24 Amir Ali Ahmadi , Grigoriy Blekherman , Pablo A. Parrilo

We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible…

代数几何 · 数学 2009-03-09 Daniel Plaumann

We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…

代数几何 · 数学 2018-10-11 Santiago Laplagne

Every convex homogeneous polynomial (or form) is nonnegative. Blekherman has shown that there exist convex forms that are not sums of squares via a nonconstructive argument. We provide an explicit example of a convex form of degree four in…

最优化与控制 · 数学 2022-08-23 James Saunderson

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

In this paper, we examine structured tensors which have sum-of-squares (SOS) tensor decomposition, and study the SOS-rank of SOS tensor decomposition. We first show that several classes of even order symmetric structured tensors available…

谱理论 · 数学 2015-10-13 Haibin Chen , Guoyin Li , Liqun Qi

The \emph{sum-of-squares (SoS) complexity} of a $d$-multiquadratic polynomial $f$ (quadratic in each of $d$ blocks of $n$ variables) is the minimum $s$ such that $f = \sum_{i=1}^s g_i^2$ with each $g_i$ $d$-multilinear. In the case $d=2$,…

计算复杂性 · 计算机科学 2025-12-02 Benjamin Rossman , Davidson Zhu

We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…

数论 · 数学 2021-08-25 Ben Green