Related papers: Rosenbrock's Theorem on System Matrices over Eleme…
In this work, linearized multivariate skew polynomials over division rings are introduced. Such polynomials are right linear over the corresponding centralizer and generalize linearized polynomial rings over finite fields, group rings or…
In this paper we revisit the greatest common right divisor (GCRD) extraction from a set of polynomial matrices $P_i(\lambda)\in \F[\la]^{m_i\times n}$, $i=1,\ldots,k$ with coefficients in a generic field $\F$, and with common column…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
Boris Shapiro and Michael Shapiro have a conjecture concerning the Schubert calculus and real enumerative geometry and which would give infinitely many families of zero-dimensional systems of real polynomials (including families of…
It is a consequence of the Jacobi Inversion Theorem that a line bundle over a Riemann surface M of genus g has a meromorphic section having at most g poles, or equivalently, the divisor class of a divisor D over M contains a divisor having…
It is well known that the ring radical theory can be approached via language of modules. In this work, we present some generalizations of classical results from module theory, in the two-sided and graded sense. Let $\mathsf{G}$ be a group,…
The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with…
We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…
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…
We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…
The GM-MDS theorem, conjectured by Dau-Song-Dong-Yuen and proved by Lovett and Yildiz-Hassibi, shows that the generator matrices of Reed-Solomon codes can attain every possible configuration of zeros for an MDS code. The recently emerging…
We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on…
The classical Perron-Frobenius theory asserts that for two matrices $A$ and $B$, if $0\leq B \leq A$ and $r(A)=r(B)$ with $A$ being irreducible, then $A=B$. This was recently extended in Bernik et al. (2012) to positive operators on…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
The geometric and algebraic theory of monomial ideals and multigraded modules is initiated over real-exponent polynomial rings and, more generally, monoid algebras for real polyhedral cones. The main results include the generalization of…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…
This paper investigates equivalence of square multivariate polynomial matrices with the determinant being some power of a univariate irreducible polynomial. We first generalized a global-local theorem of Vaserstein. Then we proved these…
A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…