English
Related papers

Related papers: Relations between ranks of matrix polynomials

200 papers

We show that for several notions of rank including tensor rank, Waring rank, and generalized rank with respect to a projective variety, the maximum value of rank is at most twice the generic rank. We show that over the real numbers, the…

Algebraic Geometry · Mathematics 2014-07-28 Grigoriy Blekherman , Zach Teitler

Let $\mathscr{L}$ denote the $\mathbf{Q}$-vector space of logarithms of algebraic numbers. In this expository work, we provide an introduction to the study of ranks of matrices with coefficients in $\mathscr{L}$. We begin by considering a…

Number Theory · Mathematics 2024-01-03 Samit Dasgupta

The divisor theory for graphs is compared to the theory of linear series on curves through the correspondence associating a curve to its dual graph. An algebro-geometric interpretation of the combinatorial rank is proposed, and proved in…

Algebraic Geometry · Mathematics 2012-09-25 Lucia Caporaso

A tropical matrix is a matrix defined over the max-plus semiring. For such matrices, there exist several non-coinciding notions of rank: the row rank, the column rank, the Schein/Barvinok rank, the Kapranov rank, or the tropical rank, among…

Rings and Algebras · Mathematics 2013-05-21 Pierre Guillon , Zur Izhakian , Jean Mairesse , Glenn Merlet

In this article, we verify the additivity for rank of a sum of coprime monomials and bivariate polynomials generalizing the result in (\cite{CCG}). We also show similar results hold for cactus rank.

Algebraic Geometry · Mathematics 2014-06-24 Youngho Woo

We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.

Algebraic Geometry · Mathematics 2015-08-24 Hwangrae Lee

A matrix is apportionable if it is similar to a matrix whose entries have equal moduli. This paper shows that all nilpotent matrices and all matrices with rank at most half their order are apportionable. General results are established and…

Combinatorics · Mathematics 2025-09-01 Dustin R. Baker , Bryan A. Curtis , Joe Miller , Hope Pungello

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Numerical Analysis · Mathematics 2023-09-18 Bor Plestenjak , Michiel E. Hochstenbach

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Symbolic Computation · Computer Science 2017-04-14 Victor Y. Pan , Liang Zhao

In this paper we give an explicit solution to the rank constrained matrix approximation in Frobenius norm, which is a generalization of the classical approximation of an m by n matrix A by a matrix of rank k at most.

Optimization and Control · Mathematics 2007-05-23 Shmuel Friedland , Anatoli Torokhti

It is well known that for two univariate polynomials over complex number field the number of their common roots is equal to the order of their resultant. In this paper, we show that this fundamental relationship still holds for the tropical…

Algebraic Geometry · Mathematics 2017-10-11 Hoon Hong , J. Rafael Sendra

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

In problems involving approximation, completion, denoising, dimension reduction, estimation, interpolation, modeling, order reduction, regression, etc, we argue that the near-universal practice of assuming that a function, matrix, or tensor…

Numerical Analysis · Mathematics 2019-02-12 Ke Ye , Lek-Heng Lim

This paper solves the two-sided version and provides a counterexample to the general version of the 2003 conjecture by Hadwin and Larson. Consider evaluations of linear matrix pencils $L=T_0+x_1T_1+\cdots+x_mT_m$ on matrix tuples as…

Rings and Algebras · Mathematics 2023-05-29 Harm Derksen , Igor Klep , Visu Makam , Jurij Volčič

Using the $det^{S^2}$ map from [5], we introduce the notion of $S^2$-rank of a matrix of type $d\times \frac{s(s-1)}{2}$. As an application, we show that the conditional probability matrix associated to two random variables has the…

Probability · Mathematics 2022-05-05 Mihai D. Staic

In this paper the sum of an orthogonal matrix and an outer product is studied, and a relation between the norms of the vectors forming the outer product and the singular values of the resulting matrix is presented. The main result may be…

General Mathematics · Mathematics 2015-12-14 Mårten Wadenbäck

Padberg introduced a geometric notion of ranks for (mixed) integer rational polyhedrons and conjectured that the geometric rank of the matching polytope is one. In this work, we prove that this conjecture is true.

Combinatorics · Mathematics 2013-09-06 Ashwin Arulselvan , Daniel Karch

We develop a notion of {\em inner rank} as a tool for obtaining lower bounds on the rank of matrix multiplication tensors. We use it to give a short proof that the border rank (and therefore rank) of the tensor associated with $n\times n$…

Computational Complexity · Computer Science 2019-05-15 Joel Friedman

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

Number Theory · Mathematics 2007-05-23 A. O. L. Atkin , F. G. Garvan

We investigate rank revealing factorizations of $m \times n$ polynomial matrices $P(\lambda)$ into products of three, $P(\lambda) = L(\lambda) E(\lambda) R(\lambda)$, or two, $P(\lambda) = L(\lambda) R(\lambda)$, polynomial matrices. Among…

Numerical Analysis · Mathematics 2024-10-04 Andrii Dmytryshyn , Froilán Dopico , Paul Van Dooren