Related papers: The possible shapes of numerical ranges
Convex geometry has recently attracted great attention as a framework to formulate general probabilistic theories. In this framework, convex sets and affine maps represent the state spaces of physical systems and the possible dynamics,…
Developed in 1999 by Akemann, Anderson, and Weaver, the spectral scale of an $n\times n$ matrix $A$, is a convex, compact subset of $\mathbb{R}^3$ that reveals important spectral information about $A$ \cite{AAW}. In this paper we present…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
Every convex polygon with $n$ vertices is a linear projection of a higher-dimensional polytope with at most $147\,n^{2/3}$ facets.
A new concept of a deformed numerical range $W^\rho(T)$ is introduced. Here $T$ is a bounded linear operator or a matrix and $ \rho \in[1,+\infty)$ is a parameter. Each $W^\rho(T)$ is a closed convex set that contains the spectrum of $T$.…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…
We formulate and prove examples of a conjecture which describes the W-algebras in type A as successive quantum Hamiltonian reductions of affine vertex algebras associated with several hook-type nilpotent orbits. This implies that the affine…
We present a list of all polynomial dominanting maps of the complex plane with branched value curve isomorphic to the complex line, up to polynomial automorphisms.
We obtain sequences of inclusion sets for the spectrum, essential spectrum, and pseudospectrum of banded, in general non-normal, matrices of finite or infinite size. Each inclusion set is the union of the pseudospectra of certain…
Given a real, symmetric matrix S, we define the slice through S as being the connected component containing S of two orbits under conjugation: the first by the orthogonal group, and the second by the upper triangular group. We describe some…
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…
We establish a lower bound for the representation dimension of all the classical Hecke algebras of types A, B and D. For all the type A algebras, and most of the algebras of types B and D, we also establish upper bounds. Moreover, we…
We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled…
Solutions to optimization problems involving the numerical radius often belong to a special class: the set of matrices having field of values a disk centered at the origin. After illustrating this phenomenon with some examples, we…
For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…
We study the topology of the set X of the solutions of a system of two quadratic inequalities in the real projective space RP^n (e.g. X is the intersection of two real quadrics). We give explicit formulae for its Betti numbers and for those…
The field of numerical algebraic geometry consists of algorithms for numerically solving systems of polynomial equations. When the system is exact, such as having rational coefficients, the solution set is well-defined. However, for a…
We consider $N\times N$ random matrices of the form $H=W+V$ where $W$ is a real symmetric or complex Hermitian Wigner matrix and $V$ is a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume…