Related papers: On the distance from a weakly normal matrix polyno…

In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an $n$-dimensional Euclidean space and obtain a lower bound for eigenvalues, which gives an important improvement of results due to Levine…

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

In this note we apply a spectral method to the graph of alternating bilinear forms. In this way, we obtain upper bounds on the size of an alternating rank-metric code for given values of the minimum rank distance. We computationally compare…

Let $\Gamma$ be a distance-regular graph with diameter $d$ and Kneser graph $K=\Gamma_d$, the distance-$d$ graph of $\Gamma$. We say that $\Gamma$ is partially antipodal when $K$ has fewer distinct eigenvalues than $\Gamma$. In particular,…

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…

Assume that $X$ is a connected $(q+1)$-regular undirected graph of finite order $n$. Let $A$ denote the adjacency matrix of $X$. Let $\lambda_1=q+1>\lambda_2\geq \lambda_3\geq \ldots \geq \lambda_n$ denote the eigenvalues of $A$. The…

Low-degree polynomials have emerged as a powerful paradigm for providing evidence of statistical-computational gaps across a variety of high-dimensional statistical models [Wein25]. For detection problems -- where the goal is to test a…

This paper adapts the recently developed rigorous application of the supersymmetric transfer matrix approach for the 1d band matrices to the case of the orthogonal symmetry. We consider $N\times N$ block band matrices consisting of $W\times…

The Frobenius companion matrix, and more recently the Fiedler companion matrices, have been used to provide lower and upper bounds on the modulus of any root of a polynomial $p(x)$. In this paper we explore new bounds obtained from taking…

In this paper, we establish bounds for the eigenvalues of matrix polynomials. Specifically, we find different generalizations of the Enestrom-Kakeya Theorem for matrix polynomials.

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

For a fixed symmetric matrix A and symmetric perturbation E we develop purely deterministic bounds on how invariant subspaces of A and A+E can differ when measured by a suitable "row-wise" metric rather than via traditional measures of…

This paper studies the fundamental limits of reinforcement learning (RL) in the challenging \emph{partially observable} setting. While it is well-established that learning in Partially Observable Markov Decision Processes (POMDPs) requires…

We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…

Let $S$ be a compact infinite set in the complex plane with $0\notin{S}$, and let $R_n$ be the minimal residual polynomial on $S$, i.e., the minimal polynomial of degree at most $n$ on $S$ with respect to the supremum norm provided that…

Let $K_n$ denote the set of all nonsingular $n\times n$ lower triangular $(0,1)$-matrices. Hong and Loewy (2004) introduced the number sequence $$ c_n=\min\{\lambda\mid\lambda~\text{is an eigenvalue of}~XX^{\rm T},~X\in K_n\},\quad…

Stable multivariate Eulerian polynomials were introduced by Br\"and\'en. Particularizing some variables, it is possible to extract real zero multivariate Eulerian polynomials from them. These real zero multivariate Eulerian polynomials can…

We address overcrowding estimates for the singular values of random iid matrices, as well as for the eigenvalues of random Wigner matrices. We show evidence of long range separation under arbitrary perturbation even in matrices of discrete…