English
Related papers

Related papers: Matrix equivalence to Smith normal form: new theor…

200 papers

In 1978, Frost and Storey asserted that a bivariate polynomial matrix is equivalent to its Smith normal form if and only if the reduced minors of all orders generate the unit ideal. In this paper, we first demonstrate by constructing an…

Symbolic Computation · Computer Science 2025-07-29 Dong Lu , Dingkang Wang , Fanghui Xiao , Xiaopeng Zheng

The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…

Rings and Algebras · Mathematics 2025-09-04 Jinwang Liu , Tao Wu , Jiancheng Guan , Ying Kang

This paper delves into the equivalence problem of Smith forms for multivariate polynomial matrices. Generally speaking, multivariate ($n \geq 2$) polynomial matrices and their Smith forms may not be equivalent. However, under certain…

Symbolic Computation · Computer Science 2024-07-10 Dong Lu , Dingkang Wang , Fanghui Xiao , Xiaopeng Zheng

This paper investigates the equivalence reduction for several classes of multivariate polynomial matrices and their Smith forms, establishing some criteria for such reduction. In particular, we employ algebra isomorphisms as a key tool to…

Commutative Algebra · Mathematics 2026-04-24 Zuo Chen , Jiancheng Guan , Dongmei Li

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…

Commutative Algebra · Mathematics 2024-06-25 Jiancheng Guan , Jinwang Liu , Dongmei Li , Tao Wu

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

Combinatorics · Mathematics 2014-04-21 Christine Bessenrodt , Richard P. Stanley

It is known that any symmetric matrix $M$ with entries in $\R[x]$ and which is positive semi-definite for any substitution of $x\in\R$, has a Smith normal form whose diagonal coefficients are constant sign polynomials in $\R[x]$. We…

Rings and Algebras · Mathematics 2009-09-09 Ronan Quarez

This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…

Symbolic Computation · Computer Science 2020-10-15 Dong Lu , Dingkang Wang , Fanghui Xiao

We consider the problem of computing the nearest matrix polynomial with a non-trivial Smith Normal Form. We show that computing the Smith form of a matrix polynomial is amenable to numeric computation as an optimization problem.…

Symbolic Computation · Computer Science 2019-09-10 Mark Giesbrecht , Joseph Haraldson , George Labahn

Rosenbrock's theorem on polynomial system matrices is a classical result in linear systems theory that relates the Smith-McMillan form of a rational matrix $G$ with the Smith forms of an irreducible polynomial system matrix $P$ giving rise…

Rings and Algebras · Mathematics 2024-06-27 Froilán Dopico , Vanni Noferini , Ion Zaballa

Schemes for exact multiplication of small matrices have a large symmetry group. This group defines an equivalence relation on the set of multiplication schemes. There are algorithms to decide whether two schemes are equivalent. However, for…

Computational Complexity · Computer Science 2022-06-02 Manuel Kauers , Jakob Moosbauer

Let A and B be normal matrices with coefficients that are continuous complex-valued functions on a topological space X that has the homotopy type of a CW complex, and suppose these matrices have the same distinct eigenvalues at each point…

Operator Algebras · Mathematics 2018-12-31 Greg Friedman , Efton Park

Following the works by Lin et al. (Circuits Syst. Signal Process. 20(6): 601-618, 2001) and Liu et al. (Circuits Syst. Signal Process. 30(3): 553-566, 2011), we investigate how to factorize a class of multivariate polynomial matrices. The…

Symbolic Computation · Computer Science 2019-05-29 Dong Lu , Dingkang Wang , Fanghui Xiao

We prove that if R is a principal ideal ring and A\in\M_n(R) is a matrix with trace zero, then A is a commutator, that is, A=XY-YX for some X,Y\in\M_n(R). This generalises the corresponding result over fields due to Albert and Muckenhoupt,…

Rings and Algebras · Mathematics 2013-02-26 Alexander Stasinski

Newton's inequalities $c_n^2 \ge c_{n-1}c_{n+1}$ are shown to hold for the normalized coefficients $c_n$ of the characteristic polynomial of any $M$- or inverse $M$-matrix. They are derived by establishing first an auxiliary set of…

Rings and Algebras · Mathematics 2007-05-23 Olga Holtz

We prove some "power" generalizations of Marcus-Lopes-style (including McLeod and Bullen) concavity inequalities for elementary symmetric polynomials, and convexity inequalities (of McLeod and Baston) for complete homogeneous symmetric…

Optimization and Control · Mathematics 2018-03-28 Suvrit Sra

V.I. Arnold [Russian Math. Surveys 26 (2) (1971) 29-43] constructed a miniversal deformation of matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced…

Representation Theory · Mathematics 2012-12-14 Andrii R. Dmytryshyn , Vyacheslav Futorny , Vladimir V. Sergeichuk

An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T) is related to the maximum…

Combinatorics · Mathematics 2007-05-23 Bryan L. Shader , In-Jae Kim

We prove a conjecture of Miller and Reiner on the existence of Smith normal form for the $DU$-operators for a certain class of $r$-differential posets.

Combinatorics · Mathematics 2024-07-24 Syed Waqar Ali Shah

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

Symbolic Computation · Computer Science 2015-03-13 Jon Wilkening , Jia Yu
‹ Prev 1 2 3 10 Next ›