English

Centrosymmetric Stochastic Matrices

Combinatorics 2019-10-31 v1

Abstract

We consider the convex set Γm,n\Gamma_{m,n} of m×nm\times n stochastic matrices and the convex set Γm,nπΓm,n\Gamma_{m,n}^\pi\subset \Gamma_{m,n} of m×nm\times n centrosymmetric stochastic matrices (stochastic matrices that are symmetric under rotation by 180 degrees). For Γm,n\Gamma_{m,n}, we demonstrate a Birkhoff theorem for its extreme points and create a basis from certain (0,1)(0,1)-matrices. For Γm,nπ\Gamma_{m,n}^\pi, we characterize its extreme points and create bases, whose construction depends on the parity of mm, using our basis construction for stochastic matrices. For each of Γm,n\Gamma_{m,n} and Γm,nπ\Gamma_{m,n}^\pi, we further characterize their extreme points in terms of their associated bipartite graphs, we discuss a graph parameter called the fill and compute it for the various basis elements, and we examine the number of vertices of the faces of these sets. We provide examples illustrating the results throughout.

Keywords

Cite

@article{arxiv.1910.13490,
  title  = {Centrosymmetric Stochastic Matrices},
  author = {Lei Cao and Darian McLaren and Sarah Plosker},
  journal= {arXiv preprint arXiv:1910.13490},
  year   = {2019}
}

Comments

12 pages, 1 table, 1 figure

R2 v1 2026-06-23T11:58:48.484Z