相关论文: Computing the Length of Sum of Squares and Pythago…
Global polynomial optimization is an important tool across applied mathematics, with many applications in operations research, engineering, and physical sciences. In various settings, the polynomials depend on external parameters that may…
Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…
It is shown that the sum of squares by Yates's method of weighted squares of means is equivalent to numerator sums of squares formulated by other methods. These relations are established first for hypotheses about fixed effects in a general…
In this note is presented a method, given nodal values on multidimensional nonconforming spectral elements, for calculating global Fourier-series coefficients. This method is ``exact'' in that given the approximation inherent in the…
An elementary approach is shown which derives the value of the Gauss sum of a cubic character over a finite field $\mathbb F_{2^s}$ without using Davenport-Hasse's theorem (namely, if $s$ is odd the Gauss sum is -1, and if $s$ is even its…
In the present paper we are concerned with a numerical algorithm for the approximation of the two-dimensional neural field equation with delay. We consider three numerical examples that have been analysed before by other authors and are…
We propose a method for determining which integers can be written as a sum of two integral squares for quadratic fields $\Q(\sqrt{\pm p})$, where $p$ is a prime.
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…
We study the sums of squares on cylinders of the form $X \times \mathbb{A}_K$ for a (weakly) factorial curve $C$. We prove the equality of the Pythagoras numbers of the ring of regular functions on the cylinder with that of the field of…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
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…
Harmonic sums and their generalizations are extremely useful in the evaluation of higher-order perturbative corrections in quantum field theory. Of particular interest have been the so-called nested sums,where the harmonic sums and their…
An algorithm for calculating generalized fractal dimension of a time series using the general information function is presented. The algorithm is based on a strings sort technique and requires $O(N \log_2 N)$ computations. A rough estimate…
We calculate some finite and infinite sums containing the digamma function in closed-form. For this purpose, we differentiate selected reduction formulas of the hypergeometric function with respect to the parameters applying some derivative…
We study the Pythagoras numbers $py(3,2d)$ of real ternary forms, defined for each degree $2d$ as the minimal number $r$ such that every degree $2d$ ternary form which is a sum of squares can be written as the sum of at most $r$ squares of…
Extending the methods from our previous work on quantum knots and quantum graphs, we describe a general procedure for quantizing a large class of mathematical structures which includes, for example, knots, graphs, groups, algebraic…
In this paper we present an algorithm that computes the genus of a global function field. Let F/k be function field over a field k, and let k0 be the full constant field of F/k. By using lattices over subrings of F, we can express the genus…
The pentaquark width is calculated in QCD sum rules. The higher dimension operators contribution is accounted. It is shown, that $\Gamma_{\Theta}$ should be very small, less than $1Mev$.
We use the Sum of Squares method to develop new efficient algorithms for learning well-separated mixtures of Gaussians and robust mean estimation, both in high dimensions, that substantially improve upon the statistical guarantees achieved…
The Sum-of-Squares (SOS) approximation method is a technique used in optimization problems to derive lower bounds on the optimal value of an objective function. By representing the objective function as a sum of squares in a feature space,…