Related papers: On equal-input and monotone Markov matrices
Higher order Bernstein- and Markov-type inequalities are established for trigonometric polynomials on compact subsets of the real line and algebraic polynomials on compact subsets of the unit circle. In the case of Markov-type inequalities…
We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…
Some natural inequalities related to rearrangement in matrix products can also be regarded as extensions of classical inequalities for sequences or integrals. In particular, we show matrix versions of Chebyshev and Kantorovich type…
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of…
A Robinson similarity matrix is a symmetric matrix where the entry values on all rows and columns increase toward the diagonal. Decompose the Robinson matrix into the sum of k {0, 1}-matrices, then these k {0, 1}-matrices are the adjacency…
A result on the structure of expansive matrices in an indefinite inner product space is derived, which exhibits the largest unitary compression of the matrix.
The main content of this paper is Lectures 5 and 6 that continue lecture notes [20]. Content of Lectures 1-4 of [20] is reviewed for the reader's convenience in sections 1-4, respectively. It is shown in Lecture 5 how residual parts of the…
The invariant measure is a fundamental object in the theory of Markov processes. In finite dimensions a Markov process is defined by transition rates of the corresponding stochastic matrix. The Markov tree theorem provides an explicit…
We derive exact matrix integral representations for different sums over partitions. The characteristic feature of all obtained matrix models is the presence of logarithmic (or, vice versa, exponential) terms in the potential. Our derivation…
This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…
Learning the embedding space, where semantically similar objects are located close together and dissimilar objects far apart, is a cornerstone of many computer vision applications. Existing approaches usually learn a single metric in the…
We study integration and $L_2$-approximation on countable tensor products of function spaces of increasing smoothness. We obtain upper and lower bounds for the minimal errors, which are sharp in many cases including, e.g., Korobov, Walsh,…
We present the explicit inverse of a class of symmetric tridiagonal matrices which is almost Toeplitz, except that the first and last diagonal elements are different from the rest. This class of tridiagonal matrices are of special interest…
We classify all functions which, when applied term by term, leave invariant the sequences of moments of positive measures on the real line. Rather unexpectedly, these functions are built of absolutely monotonic components, or reflections of…
We describe the variety of fixed points of a unipotent operator acting on the space of matrices. We compute the determinant and the rank of a generic (symmetric, or anti-symmetric) matrix in the fixed variety, yielding information about the…
We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…
We study special class of matrices with noncommutative entries and demonstrate their various applications in integrable systems theory. They appeared in Yu. Manin's works in 87-92 as linear homomorphisms between polynomial rings; more…
This work demonstrates a methodology for using deep learning to discover simple, practical criteria for classifying matrices based on abstract algebraic properties. By combining a high-performance neural network with explainable AI (XAI)…
This paper is concerned with ergodic properties of inhomogeneous Markov processes. Since the transition probabilities depend on initial times, the existing methods to obtain invariant measures for homogeneous Markov processes are not…
Having developed a description of indefinite extrinsic symmetric spaces by corresponding infinitesimal objects in the preceding paper we now study the classification problem for these algebraic objects. In most cases the transvection group…