相关论文: Central polynomials of minimal degree for matrices

Given a central division algebra $D$ of degree $d$ over a field $F$, we associate to any standard polynomial $\phi(z)=z^n+c_{n-1} z^{n-1}+\dots+c_0$ over $D$ a "companion polynomial" $\Phi(z)$ of degree $n d$ with coefficients in $F$ whose…

We compute the Gauss-Manin differential equation for any period of a polynomial in \ $\C[x_{0},\dots, x_{n}]$ \ with \ $(n+2)$ \ monomials. We give two general factorizations theorem in the algebra \ $\C< z, (\frac{\partial}{\partial…

This paper studies generic and perturbation properties inside the linear space of $m\times (m+n)$ polynomial matrices whose rows have degrees bounded by a given list $d_1, \ldots, d_m$ of natural numbers, which in the particular case $d_1 =…

We introduce a sequence $P_{2n}$ of monic reciprocal polynomials with integer coefficients having the central coefficients fixed. We prove that the ratio between number of nonunimodular roots of $P_{2n}$ and its degree $d$ has a limit when…

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

We study the polynomial functions on tensor states in $(C^n)^{\otimes k}$ which are invariant under $SU(n)^k$. We describe the space of invariant polynomials in terms of symmetric group representations. For $k$ even, the smallest degree for…

For a degree $5$ real polynomial with roots $x_1\leq \cdots \leq x_5$ and roots $\xi_1\leq \cdots \leq \xi_4$ of its derivative, we set $z_j:=(x_j+x_{j+1})/2$, $1\leq j\leq 4$. We prove that one cannot have at the same time $\min_{1\leq…

The algebra of holomorphic polynomial Sp_{2n}-invariants of k complex 2n by 2n matrices (under diagonal conjugation action) is generated by the traces of words in these matrices and their symplectic adjoints. No concrete minimal generating…

We classify all two-dimensional simple algebras (which may be non-associative) over an algebraically closed field. For each two-dimensional algebra $\mathcal{A}$, we describe a minimal (with respect to inclusion) generating set for the…

We determine minimal Cayley--Hamilton and Capelli identities for matrices over a Grassmann algebra of finite rank. For minimal standard identities, we give lower and upper bounds on the degree. These results improve on upper bounds given by…

A recently-established necessary condition for polynomials that preserve the class of entrywise nonnegative matrices of a fixed order is shown to be necessary and sufficient for the class of nonnegative monomial matrices. Along the way, we…

An $n$-independent set in two dimensions is a set of nodes admitting (not necessarily unique) bivariate interpolation with polynomials of total degree at most $n.$ For an arbitrary $n$-independent node set $\mathcal X$ we are interested…

We describe an algebraic structure on chain complexes yielding algebraic models which classify homotopy types of Poincare duality complexes of dimension 4. Generalizing Turaev's fundamental triples of Poincare duality complexes of dimension…

The study of central derivations in low-dimensional algebraic structures is a crucial area of research in mathematics, with applications in understanding the internal symmetries and deformations of these structures. In this article, we…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

Configuration polynomials generalize the classical Kirchhoff polynomial defined by a graph. Their study sheds light on certain polynomials appearing in Feynman integrands. Contact equivalence provides a way to study the associated…

We develop a general theory of Cartesian and non-Cartesian polynomials on products of complex spaces $\mathbb{C}^{n_1} \times \cdots \times \mathbb{C}^{n_k}$. We prove that, for any fixed degree $d \ge 2$, a (Zariski) generic polynomial is…

Let $f(X)$ be a nonconstant polynomial over $\mathbb{F}_{q}$, with a nonzero constant term. The order of $f(X)$ is a classical notion in the theory of polynomials over finite fields, and recently the definition of freeness of binomials of…

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…