Related papers: Rosenbrock's Theorem on System Matrices over Eleme…

We study several rigidity properties of $p$-adic local systems on a smooth rigid analytic space $X$ over a $p$-adic field. We prove that the monodromy of the log isocrystal attached to a $p$-adic local system is ''rigid'' along irreducible…

By any measure, semisimple modules form one of the most important classes of modules and play a distinguished role in the module theory and its applications. One of the most fundamental results in this area is the Wedderburn-Artin theorem.…

For an integral domain $R$ and a commutative cancellative monoid $M$, the ring consisting of all polynomial expressions with coefficients in $R$ and exponents in $M$ is called the monoid ring of $M$ over $R$. An integral domain is called…

Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…

Nonclassical symmetries and reductions of polynomial equations and systems of polynomial equations are considered. It is shown that specific polynomial equations having "hidden" symmetries can be reduced to classical symmetric systems of…

Since the seminal works of Strassen and Valiant it has been a central theme in algebraic complexity theory to understand the relative complexity of algebraic problems, that is, to understand which algebraic problems (be it bilinear maps…

Let $\mathbb{D}$ be a division ring and $\mathbb{F}$ be a subfield of the center of $\mathbb{D}$ over which $\mathbb{D}$ has finite dimension $d$. Let $n,p,r$ be positive integers and $\mathcal{V}$ be an affine subspace of the…

Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…

The S-matrix bootstrap is extended to a 1+1d theory with $O(N)$ symmetry and a boundary in what we call the R-matrix bootstrap since the quantity of interest is the reflection matrix (R-matrix). Given a bulk S-matrix, the space of allowed…

James' submodule theorem is a fundamental result in the representation theory of the symmetric groups and the finite general linear groups. In this note we consider a version of that theorem for a general finite group with a split…

Primary Cyclic matrices were used (but not named) by Holt and Rees in their version of Parker's MEAT-AXE algorithm to test irreducibility of finite matrix groups and algebras. They are matrices $X$ with at least one cyclic component in the…

We study the combinatorial and algebraic properties of Nonnegative Matrices. Our results are divided into three different categories. 1. We show a quantitative generalization of the 100 year-old Perron-Frobenius theorem, a fundamental…

Polynomial minimal bases of rational vector subspaces are a classical concept that plays an important role in control theory, linear systems theory, and coding theory. It is a common practice to arrange the vectors of any minimal basis as…

Let $E$ be a number field and $X$ a smooth geometrically connected variety defined over a characteristic $p$ finite field. Given an $n$-dimensional pure $E$-compatible system of semisimple $\lambda$-adic representations of the \'etale…

A general theorem on factorization of matrices with polynomial entries is proven and it is used to reduce polynomial Darboux matrices to linear ones. Some new examples of linear Darboux matrices are discussed.

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…

The Grassmannian cluster algebra $\mathbb{C}[\text{Gr}(k, n)]$ admits a distinguished basis known as the dual canonical basis, whose elements correspond to rectangular semi-standard Young tableaux with $k$ rows and with entries in $[n]$. We…

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…