English
Related papers

Related papers: Characteristic polynomials of supertropical matric…

200 papers

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

Combinatorics · Mathematics 2007-07-18 Nathan Grigg , Nathan Manwaring

In this paper, the correspondence between the finite dimensional representations of a simple Lie algebra and their characteristic polynomials is established, and a monoid structure on these characteristic polynomials is constructed.…

Representation Theory · Mathematics 2022-11-03 Amin Geng , Shoumin Liu , Xumin Wang

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

Number Theory · Mathematics 2026-03-04 Muhammad Afifurrahman , Vivian Kuperberg , Alina Ostafe , Igor E. Shparlinski

We propose a new definition of characteristic polynomials of tensors based on a partition function of Grassmann variables. This new notion of characteristic polynomial addresses general tensors including totally antisymmetric ones, but not…

Mathematical Physics · Physics 2025-10-07 Nicolas Delporte , Giacomo La Scala , Naoki Sasakura , Reiko Toriumi

A number of theoretical and computational problems for matrix polynomials are solved by passing to linearizations. Therefore a perturbation theory results for linearizations need to be related back to matrix polynomials. In this paper we…

Numerical Analysis · Mathematics 2020-08-06 Andrii Dmytryshyn

Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…

Commutative Algebra · Mathematics 2007-10-11 Takuro Abe , Hiroaki Terao , Max Wakefield

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…

Numerical Analysis · Mathematics 2022-11-17 Froilán M. Dopico , Silvia Marcaida , María C. Quintana , Paul Van Dooren

In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…

Combinatorics · Mathematics 2025-08-08 Gary Lazzaro , Max Wakefield , Jason Weiss

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…

Mathematical Physics · Physics 2007-05-23 Victor Tapia

We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.

Mathematical Physics · Physics 2007-05-23 Victor Tapia

We define a formal framework for the study of algebras of type Max-plus, Min-Plus, tropical algebras, and more generally algebras over a commutative idempotent semi-field. This work is motivated by the increasingly diversified use of these…

Commutative Algebra · Mathematics 2008-07-22 Dominique Castella

We give a criterion which characterizes a real multi-variate Laurent polynomial with full-dimensional smooth Newton polytope to have the property that all sufficiently large powers of the polynomial have fully positive coefficients. Here a…

Algebraic Geometry · Mathematics 2019-02-12 Colin Tan , Wing-Keung To

We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…

Commutative Algebra · Mathematics 2012-10-09 Joost Berson

We give a short tour through major parts of a recent long paper [IKR1] on supertropical valuation theory, leaving aside nearly all proofs (to be found in [IKR1]). In this way we hope to give easy access to ideas of a new branch of so called…

Commutative Algebra · Mathematics 2010-09-28 Zur Izhakian , Manfred Knebusch , Louis Rowen

We study permutability properties of matrix semigroups over commutative bipotent semirings (of which the best-known example is the tropical semiring). We prove that every such semigroup is weakly permutable (a result previous stated in the…

Rings and Algebras · Mathematics 2021-01-12 Thomas Aird , Mark Kambites

In this paper, we consider the condition when the characteristic polynomials of the Seidel matrix of the graphs are decomposed into products of linear polynomials over $\mathbb{F}_3$. We also show the equality over $\mathbb{F}_3$ between…

Combinatorics · Mathematics 2022-08-11 Yuya Sugishita

We present a systematic study on the linear convergence rates of the powers of (real or complex) matrices. We derive a characterization when the optimal convergence rate is attained. This characterization is given in terms of…

Optimization and Control · Mathematics 2014-07-03 Heinz H. Bauschke , J. Y. Bello Cruz , Tran T. A. Nghia , Hung M. Phan , Xianfu Wang

Let $M$ be a random matrix chosen according to Haar measure from the unitary group $\mathrm{U}(n,\mathbb{C})$. Diaconis and Shahshahani proved that the traces of $M,M^2,\ldots,M^k$ converge in distribution to independent normal variables as…

Group Theory · Mathematics 2024-10-15 Ofir Gorodetsky , Brad Rodgers

We study the average condition number for polynomial eigenvalues of collections of matrices drawn from various random matrix ensembles. In particular, we prove that polynomial eigenvalue problems defined by matrices with Gaussian entries…

Numerical Analysis · Mathematics 2018-02-22 Carlos Beltran , Khazhgali Kozhasov

The polynomial-time computability of the permanent over fields of characteristic 3 for k-semi-unitary matrices (i.e. square matrices such that the differences of their Gram matrices and the corresponding identity matrices are of rank k) in…

Computational Complexity · Computer Science 2020-11-04 Anna Knezevic , Greg Cohen , Marina Domanskaya