Related papers: The multiple Markov theorem on Angelesco sets
Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
We prove a new theorem relating the number of distinct eigenvalues of a matrix after perturbation to the prior number of distinct eigenvalues, the rank of the update, and the degree of nondiagonalizability of the matrix. In particular, a…
The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…
We investigate multiple orthogonal polynomials associated with the system of measures obtained by applying a Christoffel transform to each of the orthogonality measures. We present an algorithm for computing the transformed recurrence…
We extend some classical theorems in the theory of orthogonal polynomials on the unit circle to the matrix case. In particular, we prove a matrix analogue of Szeg\H{o}'s theorem. As a by-product, we also obtain an elementary proof of the…
In the Euclidean setting, the well-known Alexandrov theorem states that convex functions are twice differentiable almost everywhere. In this note, we extend this theorem to rank-one convex functions. Our approach is novel in that it draws…
A limiting property of the nearest-neighbor recurrence coefficients for multiple orthogonal polynomials from a Nevai class is investigated. Namely, assuming that the nearest-neighbor coefficients have a limit along rays of the lattice, we…
A set of polynomials in noncommuting variables is called locally linearly dependent if their evaluations at tuples of matrices are always linearly dependent. By a theorem of Camino, Helton, Skelton and Ye, a finite locally linearly…
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…
The Tutte polynomial for matroids is not directly applicable to polymatroids. For instance, deletion-contraction properties do not hold. We construct a polynomial for polymatroids which behaves similarly to the Tutte polynomial of a…
This paper investigates stochastic finite matrices and the corresponding finite Markov chains constructed using recurrence matrices for general families of orthogonal polynomials and multiple orthogonal polynomials. The paper explores the…
We prove that the probability substitution matrices obtained from a continuous-time Markov chain form a multiplicatively closed set if and only if the rate matrices associated to the chain form a linear space spanning a Lie algebra. The key…
An exact expression for the determinant of the splitting matrix is derived: it allows us to analyze the asympotic behaviour needed to amend the large angles theorem proposed in Ann. Inst. H. Poincar\'e, B-60, 1, 1994. The asymptotic…
Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…
This article studies separating invariants for the ring of multisymmetric polynomials in $m$ sets of $n$ variables over an arbitrary field $\mathbb{K}$. We prove that in order to obtain separating sets it is enough to consider polynomials…
We exhibit how the Rasiowa-Sikorski Lemma simplifies, in a sense, proofs of results that make use of the technique known as back-and-forth, often resulting in not very illustrative arguments. The first two sections seek to show one simple…
The theorem like Pontryagin's maximum principle for multiple integrals is proved. Unlike the usual maximum principle, the maximum should be taken not over all matrices, but only on matrices of rank one. Examples are given.
We provide a generalization of the Littlewood identity, both sides of which are related to alternating sign matrices. The classical Littlewood identity establishes a nice product formula for the sum of all Schur polynomials. Compared to the…
Differential calculus is not a unique way to observe polynomial equations such as $a+b=c$. We propose a way of applying difference calculus to estimate multiplicities of the roots of the polynomials $a$, $b$ and $c$ satisfying the equation…