Related papers: Index Theorems for Polynomial Pencils

We show how the multivariable signature and Alexander polynomial of a colored link can be computed from a single symmetric matrix naturally defined from a colored link diagram. In the case of a single variable, it coincides with the matrix…

We use symbolic expressions for traces of positive integer powers of a Hermitian operator (or, equivalently, coefficients of corresponding characteristic polynomial) to find solutions for the problems as follows: Factorization of…

In the present work we show that the joint probability distribution of the eigenvalues can be expressed in terms of a differential operator acting on the distribution of some other matrix quantities. Those quantities might be the diagonal…

In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…

The aim of this paper is twofold. First, we introduce a new class of linearizations, based on the generalization of a construction used in polynomial algebra to find the zeros of a system of (scalar) polynomial equations. We show that one…

We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any $n \times n$ matrix pencil $(A,B)$. The bulk of the algorithm rests on a randomized divide-and-conquer eigensolver for the generalized…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

We study the eigenvectors and eigenvalues of random matrices with iid entries. Let $N$ be a random matrix with iid entries which have symmetric distribution. For each unit eigenvector $\mathbf{v}$ of $N$ our main results provide a small…

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Using the concept of a twisted trace density on a cyclic groupoid, a trace is constructed on a formal deformation quantization of a symplectic orbifold. An algebraic index theorem for orbifolds follows as a consequence of a local…

In this article we compute and analyze the spectrum of operators defined by the metaplectic representation $\mu$ on the unitary group $\mathbb{U}(d)$ or operators defined by the corresponding induced representation $d\mu$ of the Lie algebra…

Several recent methods used to analyze asymptotic stability of delay-differential equations (DDEs) involve determining the eigenvalues of a matrix, a matrix pencil or a matrix polynomial constructed by Kronecker products. Despite some…

Using a coupling for the weighted sum of independent random variables and the explicit expression of the transition semigroup of Ornstein-Uhlenbeck processes driven by compound Poisson processes, we establish the existence of a successful…

We prove a central limit theorem for the components of the eigenvectors corresponding to the $d$ largest eigenvalues of the normalized Laplacian matrix of a finite dimensional random dot product graph. As a corollary, we show that for…

We present an algebraic study of a kind of quantum systems belonging to a family of superintegrable Hamiltonian systems in terms of shape-invariant intertwinig operators, that span pairs of Lie algebras like $(su(n),so(2n))$ or…

We extend the Granger-Johansen representation theorems for I(1) and I(2) vector autoregressive processes to accommodate processes that take values in an arbitrary complex separable Hilbert space. This more general setting is of central…

We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

The standard way of solving the polynomial eigenvalue problem associated with a matrix polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem into an equivalent generalized eigenvalue problem. Such…

In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…