Related papers: Bilinear matrix inequalities and polynomials in se…

In this paper polynomial maps are represented by the use of matrices whose entries are numbered by pair of multiindices and a new product of such matrices is introduced. A matrix representation of composition of polynomial maps is given. In…

A geometric view of the polarimetric properties of a nondepolarizing medium is presented by means of a pair of vectors in the Poincar\'e sphere. An alternative representation constituted by a set of vectors contained in the equatorial plane…

Real or complex polynomial mappings between affines spaces admitting a Lipschitz-trivial value are completely characterized.

We revisit the Bohnenblust--Hille multilinear and polynomial inequalities and prove some new properties. Our main result is a multilinear version of a recent result on polynomials whose monomials have a uniformly bounded number of…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

A noncommutative polynomial is stable if it is nonsingular on all tuples of matrices whose imaginary parts are positive definite. In this paper a characterization of stable polynomials is given in terms of strongly stable linear matrix…

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

This paper considers matrix convex sets invariant under several types of rotations. It is known that matrix convex sets that are free semialgebraic are solution sets of Linear Matrix Inequalities (LMIs); they are called free spectrahedra.…

Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…

We find a class of algebras A satisfying the following property: for every nontrivial noncommutative polynomial, the linear span of all its values in A equals A. This class includes the algebras of all bounded and all compact operators on…

The paper presents the classification of matrix valued superpotentials corresponding to shape invariant systems of Schr\"odinger equations. All inequivalent irreducible matrix superpotentials realized by matrices of arbitrary dimension with…

In this paper we consider the problem of how to computationally test whether a matrix inequality is positive semidefinite on a semialgebraic set. We propose a family of sufficient conditions using the theory of matrix Positivstellensatz…

We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.

Linear matrix inequalities (LMIs) are ubiquitous in real algebraic geometry, semidefinite programming, control theory and signal processing. LMIs with (dimension free) matrix unknowns are central to the theories of completely positive maps…

We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…

Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the…