Related papers: The characteristic polynomial and determinant are …
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique…
After sketching the basic theory of injective ideals of homogeneous polynomials, we characterize injective polynomial ideals by means of a domination property and applications of this characterization to some classical operator ideals and…
Let k be a field of characteristic p>0, and G be a finite group. The first result of this paper is an explicit formula for the determinant of the Cartan matrix of the Mackey algebra mu_k(G) of G over k. The second one is a formula for the…
This paper defines and develops cycle indices for the finite classical groups. These tools are then applied to study properties of a random matrix chosen uniformly from one of these groups. Properties studied by this technique will include…
We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…
Canonical matrices are given for (a) bilinear forms over an algebraically closed or real closed field; (b) sesquilinear forms over an algebraically closed field and over real quaternions with any nonidentity involution; and (c) sesquilinear…
Let $k$ be a field of characteristic $p>0$ and $R$ be a subalgebra of $k[X]=k[x_1,...,x_n]$. Let $J(R)$ be the ideal in $k[X]$ defined by $J(R)\Omega_{k[X]/k}^n=k[X]\Omega_{R/k}^n$. It is shown that if it is a principal ideal then $J(R)^q$…
A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…
We show that a determinantal ideal generated by $t$-minors does not contain any nonzero polynomials with $t!/2$ or fewer terms. Geometrically this means that any nonzero polynomial vanishing on all matrices of rank at most $t-1$ has more…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…
This paper aims at studying how finitely many generalized polarization tensors of an algebraic domain can be used to determine its shape. Precisely, given a planar set with real algebraic boundary, it is shown that the minimal polynomial…
In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…
We study the question of algebraic rank or transcendence degree preserving homomorphisms over finite fields. This concept was first introduced by Beecken, Mittmann and Saxena (2013), and exploited by them, and Agrawal, Saha, Saptharishi and…
We characterize the mixed discriminant of positive semi definite matrices using its most basic properties. As a corollary we establish its minimality among non negative and multi additive functionals.
A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…
An integral quadratic polynomial (with positive definite quadratic part) is called almost universal if it represents all but finitely many positive integers. In this paper, we introduce the conductor of a quadratic polynomial, and give an…
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…