-matrices, discrepancy and preservers
Let and be positive integers, and let and be nonnegative integral vectors. Let be the set of all -matrices with row sum vector and column vector...
Let and be positive integers, and let and be nonnegative integral vectors. Let be the set of all -matrices with row sum vector and column vector...
For integers , Brietzke (2008) defined the -central coefficients of an infinite lower triangular matrix as , with , and the -central coefficient triangle of as It is known that the -central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array with and , we obtain the generating function of its -central coefficients and give an explicit representation for the -central Riordan array in terms of the Riordan array . Meanwhile, the...
An sign pattern is said to be potentially nilpotent if there exists a nilpotent real matrix with the same sign pattern as . Let be an sign pattern with such that the superdiagonal and the entries are positive, the
A sign pattern is a sign pattern if has no zero entries. allows orthogonality if there exists a real orthogonal matrix whose sign pattern equals . Some sufficient conditions are given for a sign pattern matrix to allow orthogonality, and a complete characterization is given for sign patterns with to allow orthogonality.
(Homogeneous) Markov bridges are (time homogeneous) Markov chains which begin at a given point and end at a given point. The price to pay for preserving the homogeneity is to work with processes with a random life-span. Bridges are studied both for themselves and for their use in describing the transformations of Markov chains: restriction on a random interval, time reversal, time change, various conditionings comprising the confinement in some part of the state space. These bridges lead us to look...