Related papers: Solving sums of squares in global fields

It is well known that every non-degenerate quadratic form admits a decomposition into an orthogonal sum of its anisotropic part and a hyperbolic form. This decomposition is unique up to isometry. In this paper we present an algorithm for…

Optimizing over the cone of nonnegative polynomials, and its dual counterpart, optimizing over the space of moments that admit a representing measure, are fundamental problems that appear in many different applications from engineering and…

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

A widely used method for solving SOS (Sum Of Squares) decomposition problem is to reduce it to the problem of semi-definite programs (SDPs) which can be efficiently solved in theory. In practice, although many SDP solvers can work out some…

The main purpose of this paper is to prove that the positive real numbers can be decomposed into finitely many disjoint pieces which are also closed under addition and multiplication. As a byproduct of the argument we determine all the…

This paper presents a practical method for finding the globally optimal solution to the sum-of-ratios problem arising in image processing, engineering and management. Unlike traditional methods which may get trapped in local minima due to…

This paper discusses how to find the global minimum of functions that are summations of small polynomials (``small'' means involving a small number of variables). Some sparse sum of squares (SOS) techniques are proposed. We compare their…

Let R be the ring of S-integers of an algebraic function field (in one variable) over a perfect field, where S is finite and not empty. It is shown that for every positive integer N there exist elements of R that can not be written as a sum…

A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)

In the process of proving a sharpened form of G\r{a}rding's inequality, Fefferman & Phong demonstrated that every non-negative function $f\in C^{3,1}(\mathbb{R}^n)$ can be written as a finite sum of squares of functions in…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

The aim of this article is to study (additively) indecomposable algebraic integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally positive quadratic forms with coefficients in $\mathcal O_K$. There are given…

We consider the problem of decomposing a regular non-negative function as a sum of squares of functions which preserve some form of regularity. In the same way as decomposing non-negative polynomials as sum of squares of polynomials allows…

We use a representability theorem of G. L. Watson to examine sums of squares in Quaternion rings with integer coefficients. This allows us to determine a large family of such rings where every element expressible as the sum of squares can…

This is the second in a series of three papers dealing with sums of squares and hypoellipticity in the infinitely degenerate regime. We give sharp conditions on the entries of a positive semidefinite NxN matrix function F on n-dimensional…

It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…