Related papers: A nice involution for multivariable polynomial rin…
A nonzero nonnegative definite hermitian m by m matrix A has increasing principal minors if the value of each principle minor of A is not less than the value each of its subminors. For $m>1$ we show $A$ has increasing principal minors if…
We develop a diagrammatic categorification of the polynomial ring $Z[x]$. Our categorification satisfies a version of Bernstein-Gelfand-Gelfand reciprocity property with the indecomposable projective modules corresponding to $x^n$ and…
Let p > 2 be a prime, let n > m > 0. Let pi_n be the norm of zeta_{p^n} - 1 under C_{p-1}, so that Z_(p)[pi_n] | Z_(p) is a purely ramified extension of discrete valuation rings of degree p^{n-1}. The minimal polynomial of pi_n over Q(pi_m)…
Schinzel's Hypothesis H is a general conjecture in number theory on prime values of polynomials that generalizes, e.g., the twin prime conjecture and Dirichlet's theorem on primes in arithmetic progression. We prove an arithmetic analog of…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
For each pair (k,r) of positive integers with r>1, we consider an ideal I^(k,r)_n of the ring of symmetric polynomials in n variables. The ideal I_n^(k,r) has a basis consisting of Macdonald polynomials P(x_1,...,x_n;q,t) at…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
A non-zero constant Jacobian polynomial map $F=(P,Q):\mathbb{C}^2 \longrightarrow \mathbb{C}^2$ has a polynomial inverse if the component $P$ is a simple polynomial, i.e. if, when $P$ extended to a morphism $p:X\longrightarrow \mathbb{P}^1$…
We introduce a new map from polynomials orthogonal on the unit circle to polynomials orthogonal on the real axis. This map is closely related with the theory of CMV matrices. It contains an arbitrary parameter which leads to a linear…
We study the addditon problem for strongly matricially free random variables which generalize free random variables. Using operators of Toeplitz type, we derive a linearization formula for the `matricial R-transform' related to the…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
The Schinzel Hypothesis is a conjecture about irreducible polynomials in one variable over the integers: under some standard condition, they should assume infinitely many prime values at integers. We consider a relative version: if the…
The classical Hilbert specialization property is a field-theoretic tool ensuring that polynomial irreducibility over a field is preserved under specialization of some of the variables. We develop an integral counterpart by introducing the…
A set of polynomials G in a polynomial ring S over a field is said to be a universal Groebner basis, if G is a Groebner basis with respect to every term order on S. Twenty years ago Bernstein, Sturmfels, and Zelevinsky proved that the set…
We study the polynomial algebra (over a ring containing the rationals) in an n by m matrix of variables, and subject to the relation that says that the product of any two variables in the same column is zero. We show that the sub-algebra of…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…
Suppose that $X_1,\...,X_n,\...$ are i.i.d. rotationally invariant $N$-by-$N$ matrices. Let $\Pi_n=X_n\... X_1$. It is known that $n^{-1}\log |\Pi_n|$ converges to a nonrandom limit. We prove that under certain additional assumptions on…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
Following work of Keel and Tevelev, we give explicit polynomials in the Cox ring of $\mathbb{P}^1\times\cdots\times\mathbb{P}^{n-3}$ that, conjecturally, determine $\overline{M}_{0,n}$ as a subscheme. Using Macaulay2, we prove that these…
The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…