Related papers: On real Waring decompositions of real binary forms

We determine the Waring ranks of all sextic binary forms with complex coefficients using a Geometric Invariant Theory approach. Using the five basic invariants for sextic binary forms, our results give a rapid method to determine the Waring…

Let $\mathbb{N}_0$ be a class of natural numbers whose binary expansions contain even numbers of ones. Waring problem in numbers of class $\mathbb{N}_0$ is solved.

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

A presentation of a degree $d$ form in $n+1$ variables as the sum of homogenous elements ``essentially'' involving $n$ variables is called a {\em codimension one decomposition}. Codimension one decompositions are introduced and the related…

A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

The new identifiable case appeared in \cite{AGMO}, together with the analysis on simultaneous identifiability of pairs of ternary forms recently developed in \cite{BG}, suggested the following conjecture towards a complete classification of…

In this paper, we give a complete description of the complex and the real Waring ranks of reducible cubic forms over C.

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Let $n>1$ be a positive integer. Let $R$ be a henselian local ring with residue field $k$ of $n$th level $s_n(k)$. We give some upper and lower bounds for the $n$th Waring number $w_n(R)$ in terms of $w_n(k)$ and $s_n(k)$. In large number…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Let R be a ring and let B be a commutative ring. Let p be a homogeneous multiplicative polynomial law of degree n from R to B. We show that p is essentially a determinant, in the sense that p is obtained from a determinant by left and right…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

The present article is focused on the study of a special class of systems of nonlinear transcendental equations for which classical algebraic and symbolic methods are inapplicable. For the purpose of the study of such systems, we develop a…

In this paper, various polynomial representations of strange classical Lie superalgebras are investigated. It turns out that the representations for the algebras of type P are indecomposable, and we obtain the composition series of the…

We study three variations of the Waring problem for polynomials, concerning the Waring rank, the border rank and the cactus rank of a form and we show how the Lefschetz properties of the associated algebra affect them. The main tool is the…