Related papers: G{\aa}rding Polynomials

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

In this paper we give a version of Krivine-Stengle's Positivstellensatz, Schweighofer's Positivstellensatz, Scheiderer's local-global principle, Scheiderer's Hessian criterion and Marshall's boundary Hessian conditions for polynomial…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

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…

We study a class of bivariate deformed Hermite polynomials and some of their properties using classical analytic techniques and the Wigner map. We also prove the positivity of certain determinants formed by the deformed polynomials. Along…

Given a reductive algebraic group $G$ and a finite dimensional algebraic $G$-module $V$, we study how close is the algebra of $G$-invariant polynomials on $V^{\oplus n}$ to the subalgebra generated by polarizations of $G$-invariant…

We show that many important convex matrix functions can be represented as the partial infimal projection of the generalized matrix fractional (GMF) and a relatively simple convex function. This representation provides conditions under which…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

We carry out some algebraic and analytic properties of a new class of orthogonal polyanalytic polynomials, including their operational formulas, recurrence relations, generating functions, integral representations and different…

We study GL-equivariant modules over the infinite variable polynomial ring $S = k[x_1, x_2, ..., x_n, ...]$ with $k$ an infinite field of characteristic $p > 0$. We extend many of Sam--Snowden's far-reaching results from characteristic zero…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Random matrices like GUE, GOE and GSE have been studied for decades and have been shown that they possess a lot of nice properties. In 2005, a new property of independent GUE random matrices is discovered by Haagerup and Thorbj{\o}rnsen in…

We investigate the strong Rayleigh property of matroids for which the basis enumerating polynomial is invariant under a Young subgroup of the symmetric group on the ground set. In general, the Grace-Walsh-Szeg\H{o} theorem can be used to…

Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…

We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…

We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

The $G^{+}$ method is a new method, a powerful one, for the study of (homogeneous and nonhomogeneous) products of nonnegative matrices -- for problems on the products of nonnegative matrices. To study such products, new classes of matrices…