Related papers: Matrices whose field of values is inscribed in a p…
We consider path-connected sets of matrices and the induced paths between eigenvalues. We discuss the equivalence relation generated by these paths, and how it relates to the presence of higher multiplicity eigenvalues realized by the set.…
We prove the conjecture of Baik, Deift, and Johansson which says that with respect to the Plancherel measure on the set of partitions of $n$, the 1st, 2nd, and so on, rows behave, suitably scaled, like the 1st, 2nd, and so on, eigenvalues…
Which convex subsets of the complex plane are the numerical range W(A of some matrix A? This paper gives a precise characterization of these sets. In addition to this we show that for any A there exists a symmetric matrix B of the same size…
The first author with B. Sturmfels studied the variety of matrices with eigenvectors in a given linear subspace, called Kalman variety. We extend that study from matrices to symmetric tensors, proving in the tensor setting the…
By defining multiplicities for zeros of polynomials over hyperfields, Baker and Lorscheid were able to provide a unifying perspective on Descartes's rule and the Newton polygon rule for polynomials over a formally-real and valued field…
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…
We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we…
We introduce the notion of one-sided mapping cones of positive linear maps between matrix algebras. These are convex cones of maps that are invariant under compositions by completely positive maps from either the left or right side. The…
We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…
We study pairs of matrices $A,B\in GL_n({\mathbb C})$ such that the eigenvalues of $A$, of $B$ and of the product $AB$ are specified in advance. We show that the space of such pairs $(A,B)$ under simultaneous conjugation has dimension…
In this paper we prove that it is possible to inscribe a regular crosspolytope (multidimensional octahedron) into a smooth convex body in $\mathbb R^d$, where $d$ is an odd prime power. Some generalizations of this statement are also…
A square matrix $M$ represents a graph $\Gamma$ if its nonzero off-diagonal entries encode the adjacencies of $\Gamma$, subject to a fixed ordering of the vertices. Over the field of two elements, we investigate the distribution of ranks in…
Let $ES_{\ell}(n)$ be the minimum $N$ such that every $N$-element point set in the plane contains either $\ell$ collinear members or $n$ points in convex position. We prove that there is a constant $C>0$ such that, for each $\ell, n \ge 3$,…
The still-unsolved problem of determining the set of eigenvalues realized by $n$-by-$n$ doubly stochastic matrices, those matrices with row sums and column sums equal to $1$, has attracted much attention in the last century. This problem is…
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
Let us say that an $n$-sided polygon is semi-regular if it is circumscriptible and its angles are all equal but possibly one, which is then larger than the rest. Regular polygons, in particular, are semi-regular. We prove that semi-regular…
The aim of this note is to describe the Poisson boundary of the group of invertible triangular matrices with coefficients in a number field. It generalizes to any dimension and to any number field a result of Brofferio concerning the…
Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…
In 2006 J.G. Thompson conjectured: "If F is a field and A is in GL(n,F), then there is a permutation matrix P such that AP is cyclic, that is, the minimal polynomial of AP is also its characteristic polynomial" (open problem 16.95 in the…
In this paper is studied the problem concerning the angle between two subspaces of arbitrary dimensions in Euclidean space $E_{n}$. It is proven that the angle between two subspaces is equal to the angle between their orthogonal subspaces.…