Related papers: Semi-scalar equivalence of polynomial matrices

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater…

Let $\Gamma$ be a $T$-ideal of identities of an affine PI-algebra over an algebraically closed field $F$ of characteristic zero. Consider the family $\mathcal{M}_{\Gamma}$ of finite dimensional algebras $\Sigma$ with $Id(\Sigma) = \Gamma$.…

A symmetric tensor may be regarded as a partially symmetric tensor in several different ways. These produce different notions of rank for the symmetric tensor which are related by chains of inequalities. By exploiting algebraic tools such…

We define a family of symmetric and a family of non-symmetric polynomials in terms of vanishing conditions. These families depend on two paramters, q and t. Their main feature is that they consist of non-homogeneous polynomials. The…

Principal matrices of a numerical semigroup of embedding dimension n are special types of $n \times n$ matrices over integers of rank $\leq n - 1$. We show that such matrices and even the pseudo principal matrices of size n must have rank…

A strong $\ell$-ification of a matrix polynomial $P(\lambda)=\sum A_i\lambda^i$ of degree $d$ is a matrix polynomial $\mathcal{L}(\lambda)$ of degree $\ell$ having the same finite and infinite elementary divisors, and the same numbers of…

In this note, we prove that an affine cellular algebra $A$ is semisimple if and only if the scheme associated to $A$ is reduced and 0-dimensional, and the bilinear forms with respect to all layers of $A$ are isomorphisms. Moreover, if the…

The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…

Let $p,q$ be coprime integers such that $|p|+|q|>2$. We characterize the matrices $A\in\mathcal{M}_n(\mathbb{C})$ such that $A^p$ and $A^q$ are similar. If $A$ is invertible, we prove that $A$ is a polynomial in $A^p$ and $A^q$. To achieve…

This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…

The partial transpose map is a linear map widely used quantum information theory. We study the equality condition for a matrix inequality generated by partial transpose, namely $\rank(\sum^K_{j=1} A_j^T \otimes B_j)\le K \cdot…

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

The main goal of the paper is the discussion of a deeper interaction between matrix theory over polynomial rings over a field and typical methods of commutative algebra and related algebraic geometry. This is intended in the sense of…

This paper concerns the enumeration of isomorphism classes of modules of a polynomial algebra in several variables over a finite field. This is the same as the classification of commuting tuples of matrices over a finite field up to…

A subspace of matrices over $\mathbb{F}_{q^e}^{m\times n}$ can be naturally embedded as a subspace of matrices in $\mathbb{F}_q^{em\times en}$ with the property that the rank of any of its matrix is a multiple of $e$. It is quite natural to…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebras generated by strictly positive matrices are described up to similarity, including the commutative, simple, and semisimple cases. We provide sufficient conditions for some block diagonal matrix algebras to be generated by a set of…

We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…

Let $R$ be a domain and $B=R[x_1^{\pm1},\ldots,x_n^{\pm1}]$ the Laurent polynomial ring over $R$. In this paper we study pre-factorially closed (pfc) and quasi-factorially closed (qfc) $R$-subalgebras of $B$, which generalize the notion of…