Related papers: Centrosymmetric Stochastic Matrices
The purpose of this work is to pursue classification of geproci sets. Specifically we classify $[m,n]$-geproci sets which consist of $m=4$ points on each of $n$ skew lines, assuming the skew lines have two transversals in common. We show…
We discuss a one-parameter family of transformations which changes sets and functions continuously into their (k,n)-Steiner symmetrizations. Our construction consists of two stages. First, we employ a continuous symmetrization introduced by…
The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…
In this paper we consider a distance-regular graph $\Gamma$. Fix a vertex $x$ of $\Gamma$ and consider the corresponding subconstituent algebra $T$. The algebra $T$ is the $\mathbb{C}$-algebra generated by the Bose-Mesner algebra $M$ of…
We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are…
The panstochastic analogue of Birkhoff's Theorem on doubly-stochastic matrices is proved in the case $n=5$. It is shown that this analogue fails when $n>1$, $n \ne 5$.
We perform a systematic symmetry classification of the Markov generators of classical stochastic processes. Our classification scheme is based on the action of involutive symmetry transformations of a real Markov generator, extending the…
We explore a class of centrosymmetric matrices whose entries are polynomials in two variables, referred to as DNA matrices. Our motivation stems from an unexpected connection between these matrices and invariant polynomials under the action…
A square matrix is called stochastic (or row-stochastic) if it is non-negative and has each row sum equal to unity. Here, we constitute an eigenvalue localization theorem for a stochastic matrix, by using its principal submatrices. As an…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
In this paper, we study split graphs and related classes of graphs from the perspective of their sequence of vertex degrees and an associated lattice under majorization. Following the work of Merris in 2003, we define blocks…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
Consider a fixed connected, finite graph $\Gamma$ and equip its vertices with weights $p_i$ which are non-negative integers. We show that there is a finite number of possibilities for the coefficients of the canonical cycle of a numerically…
We study the geodesic X-ray transform $I_\Gamma$ of tensor fields on a compact Riemannian manifold $M$ with non-necessarily convex boundary and with possible conjugate points. We assume that $I_\Gamma$ is known for geodesics belonging to an…
We study the problem of classifying the holomorphic $(m,n)$-subharmonic morphisms in complex space. This determines which holomorphic mappings preserves $m$-subharmonicity in the sense that the composition of the holomorphic mapping with a…
Let \Gamma be a structure with a finite relational signature and a first-order definition in (R;*,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article,…
We develop several efficient algorithms for the classical \emph{Matrix Scaling} problem, which is used in many diverse areas, from preconditioning linear systems to approximation of the permanent. On an input $n\times n$ matrix $A$, this…
We study truncation compatible families F = (F_m)_{m>=1} over Q[z] through an inverse limit formalism, and we evaluate them at the punctured cyclotomic cosine points alpha_{k,n} = cos(2 pi k/n) with the specialization z equals n-1. For…
We consider the singular vectors of any $m \times n$ submatrix of a rectangular $M \times N$ Gaussian matrix and study their asymptotic overlaps with those of the full matrix, in the macroscopic regime where $N \,/\, M\,$, $m \,/\, M$ as…