Related papers: Polynomially Isometric Matrices in Low Dimensions

A symmetric doubly stochastic matrix A is said to be determined by its spectra if the only symmetric doubly stochastic matrices that are similar to A are of the form $P^TAP$ for some permutation matrix P. The problem of characterizing such…

The space of polynomials in two real variables with values in a 2-dimensional irreducible module of a dihedral group is studied as a standard module for Dunkl operators. The one-parameter case is considered (omitting the two-parameter case…

The lattice size of a lattice polytope is a geometric invariant which was formally introduced in the context of simplification of the defining equation of an algebraic curve, but appeared implicitly earlier in geometric combinatorics.…

A linear principal minor polynomial or lpm polynomial is a linear combination of principal minors of a symmetric matrix. By restricting to the diagonal, lpm polynomials are in bijection to multiaffine polynomials. We show that this…

Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…

We lay the geometric foundations for the study of the characteristic polynomial of tensors. For symmetric tensors of order $d \geq 3$ and dimension $2$ and symmetric tensors of order $3$ and dimension $3$, we prove that only finitely many…

The study of proper rational mappings between balls in complex Euclidean spaces naturally leads to the relationship between the degree and imbedding dimension of such a mapping. The special case for monomial mappings is equivalent to the…

We construct isospectral pairs of Riemannian metrics on S^5 and on B^6, thus lowering by three the dimension of spheres and balls on which such metrics have been constructed previously (S^{n\ge 8} and B^{n\ge 9}). We also construct…

For the $n$th cyclotomic polynomial $\Phi_n$, let $A(n)$ denote the greatest absolute value of its coefficients, its height, and let $D(n)$ denote the difference between its largest and smallest coefficients, its diameter. We show that for…

Here, we find the characteristics polynomial of normalized Laplacian of a tree. The coefficients of this polynomial are expressed by the higher order general Randi\'c indices for matching, whose values depend on the structure of the tree.…

The positive interpoint distances of n=p+1>1 points in dimension p are equal if and only if their sample covariance matrix is a scalar multiple of the identity.

Two statements concerning $n$-by-$n$ partial isometries are being considered: (i) these matrices are generic, if unitarily irreducible, and (ii) if nilpotent, their numerical ranges are circular disks. Both statements hold for $n\leq 4$ but…

For $1< p <2$ we obtain sharp inequalities for the supremum of products of homogeneous polynomials on $L_p(\mu)$, whenever the number of factors is no greater than the dimension of these Banach spaces (a condition readily satisfied in the…

In this paper, we will show that the width of simplices defined by systems of linear inequalities can be computed in polynomial time if some minors of their constraint matrices are bounded. Additionally, we present some…

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…

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…

Let $A$ be a square complex matrix and $z$ a complex number. The distance, with respect to the spectral norm, from $A$ to the set of matrices which have $z$ as an eigenvalue is less than or equal to the distance from $z$ to the spectrum of…

We analyze the precision of the characteristic polynomial of an $n\times n$ p-adic matrix A using differential precision methods developed previously. When A is integral with precision O(p^N), we give a criterion (checkable in time…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…