For stochastic matrices of order $n$, the Karpelevi\v{c} region is the set of all possible eigenvalues. We study matrices whose first and last $m$ rows are arbitrary probability vectors, while the remaining rows have a Toeplitz pattern. As $m$ increases, their eigenvalue regions expand, first reaching the full Karpelevi\v{c} region at $m=\lceil(n-1)/4\rceil$ for $n\ge3$. Reproducing every complete stochastic spectrum, with multiplicities, requires $m=\lfloor n/2\rfloor$. For a boundary arc whose endpoints have orders $q<s$ as roots of unity, the least $m$ needed to attain the whole arc is $0$ for $q=1$ and $\left\lceil\frac12\left\lfloor n/q\right\rfloor\right\rceil$ for $q\ge2$. For a Karpelevi\v{c} boundary arc whose nonreal points between the endpoints first occur as stochastic eigenvalues at order $n\ge4$, fixing any one of these eigenvalues fixes the characteristic polynomial of every stochastic matrix of order $n$ with that eigenvalue. For these arcs and $m\ge1$, our family attains either the whole arc or only its endpoints. Further results describe the smaller eigenvalue regions and the angles at which their boundaries approach roots of unity.
We develop a deterministic algorithm for separating the eigenvalues of Hermitian tridiagonal matrices by small diagonal perturbations. For $\|T\|_2\leq1$, $0<\delta<1/2$, and $X=\mathrm{diag}(1,\ldots,n)$, our algorithm selects $t\in[0,\delta/n]$ such that $D=tX$ satisfies $\|D\|_2\leq\delta$ and $\mathrm{gap}(T+D)>c\,...
We resolve the Rademacher singularity conjecture: an $n\times n$ matrix with independent uniform $\{-1,1\}$ entries is singular with probability $(2+o(1))n^22^{-n}$. More generally, for an $n\times n$ matrix $M_n$ with independent entries uniform on a fixed set $S\subset\mathbb{R}$ of cardinality $q\ge2$, we prove $\ma...
Given an $n\times n$ symmetric matrix $M$ with largest eigenvalue $\lambda_1\geq 0$, it is easy to show that the solution of the optimisation problem $\max_{v\in [-1,1]^n}v^TMv$ is at most $\lambda_1 n$. We prove the following converse: if every $n'\times n'$ principal submatrix of $M$ has maximal eigenvalue at least $...
Oliver Janzer, István Tomon, Fredy Yip· 1 citation
We classify the simultaneous half-bandwidths $p,q$ of a symmetric oscillatory matrix $A$ and its inverse. At order $n\ge2$, the possible pairs are $(1,n-1)$, $(n-1,1)$, and all pairs with $2\le p,q\le n-1$. Let $e_k(A)$ be the least positive integer $m$ for which all minors of order $k$ of $A^m$ are positive, and let $...
Let $\Lambda_n$ be the set of all eigenvalues of standardized Laplacian matrices of order $n$, equivalently, of stochastic $n\times n$ matrices with off-diagonal entries at most $\frac1n$. In 2005, a polygon $S_n\subseteq\Lambda_n$ was constructed, and it was conjectured that $\Lambda_n=S_n$; this holds for $n\le3$. We...
Let $F(z)=zf(z)$, where $f$ is a normalized scalar holomorphic function on the unit ball $\mathbb B$ of a complex Banach space $X$ or on the unit polydisk $\mathbb U^n$ of $\mathbb{C}^n$. We establish sharp bounds for two Toeplitz determinants involving the second, third and fourth Fr\'echet derivatives of $F$ when $F$...
S. Panja, Sujoy Majumder, Abhijit Banerjee· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.