English
Related papers

Related papers: Sums of Squares on the Hypercube

200 papers

We consider symmetric polynomials, p, in the noncommutative free variables (x_1, x_2, ..., x_g). We define the noncommutative complex hessian of p and we call a noncommutative symmetric polynomial noncommutative plurisubharmonic if it has a…

Operator Algebras · Mathematics 2011-01-17 Jeremy M. Greene , J. William Helton , Victor Vinnikov

Hilbert's Nullstellensatz characterizes polynomials that vanish on the vanishing set of an ideal in C[x]. In the free algebra C<X> the vanishing set of a two-sided ideal I is defined in a dimension-free way using images in…

Rings and Algebras · Mathematics 2018-04-27 Igor Klep , Victor Vinnikov , Jurij Volčič

In the smallest cases where there exist nonnegative polynomials that are not sums of squares we present a complete explanation of this distinction. The fundamental reason that the cone of sums of squares is strictly contained in the cone of…

Algebraic Geometry · Mathematics 2012-02-09 Grigoriy Blekherman

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

Symbolic Computation · Computer Science 2014-08-19 Ye Liang

A generalization of the classical Lipschitz summation formula is proposed. It involves new polylogarithmic rational functions constructed via the Fourier expansion of certain sequences of Bernoulli--type polynomials. Related families of…

Number Theory · Mathematics 2007-12-16 Stefano Marmi , Piergiulio Tempesta

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

Number Theory · Mathematics 2024-09-04 Fernando Szechtman

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

Number Theory · Mathematics 2026-03-25 Dante Bonolis , Lillian B. Pierce

We use a global version of Heath-Brown's $p-$adic determinant method developed by Salberger to give upper bounds for the number of rational points of height at most $B$ on non-singular cubic curves defined over $\mathbb{Q}$. The bounds are…

Number Theory · Mathematics 2018-05-03 Manh Hung Tran

Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda + \sum_{k = 1}^d [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are linear forms in…

Complex Variables · Mathematics 2007-05-23 Gabriel Katz

We show that the intersection of the irreducible components of a hypersurface defined by a polynomial with square-free support has F-rational singularities in characteristic $p>0$. As a consequence, we obtain that hypersurfaces defined by…

Commutative Algebra · Mathematics 2025-01-28 Aldo Conca , Alessandro De Stefani , Luis Núñez-Betancourt , Ilya Smirnov

Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…

Functional Analysis · Mathematics 2015-06-03 Olavi Nevanlinna

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…

Combinatorics · Mathematics 2026-03-04 Florian Bridoux , Christophe Crespelle , Thi Ha Duong Phan , Adrien Richard

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…

Symbolic Computation · Computer Science 2015-04-08 Graham H. Norton

Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We…

Algebraic Geometry · Mathematics 2022-04-13 Teresa Krick , Bernard Mourrain , Agnes Szanto

We interpret a counterexample to Hilbert's 14th problem by S. Kuroda geometrically in two ways: As ring of regular functions on a smooth rational quasiprojective variety over any field K of characteristic 0, and, in the special case where K…

Algebraic Geometry · Mathematics 2013-01-01 Sebastian Krug

We show how multiplier ideals can be used to obtain uniform multiplicative bounds for certain families of ideals on a smooth complex algebraic variety. In particular we prove a quick but rather surprising result about symbolic powers of…

Algebraic Geometry · Mathematics 2009-10-31 Lawrence Ein , Robert Lazarsfeld , Karen E. Smith

We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert--Artin, Reznick, Putinar, and Putinar--Vasilescu Positivstellens\"atze. First, we…

Optimization and Control · Mathematics 2021-11-23 Yang Zheng , Giovanni Fantuzzi

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…

Optimization and Control · Mathematics 2025-07-01 Vu Trung Hieu , Alfredo Noel Iusem , Paul Hugo Schmölling , Akiko Takeda
‹ Prev 1 8 9 10 Next ›