Search arXivSearch

arXiv · 2502.09149

Enumeration and constructions of vertices of the polytope of polystochastic matrices

Abstract

A multidimensional nonnegative matrix is called polystochastic if the sum of entries in each of its lines equals $1$. The set of all polystochastic matrices of order $n$ and dimension $d$ is a convex polytope $Ω_n^d$ known as the Birkhoff polytope. In this paper, we identify all vertices of the polytopes $Ω_4^3$ and $Ω_3^4$ correcting the results of Ke, Li, and Xiao (2016). Additionally, we describe constructions vertices of $Ω_n^d$ using multidimensional matrix products and find symmetric vertices of $Ω_3^d$ for all $d \geq 4$ with large support sizes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna A. Taranenko. 2025-02-13. Enumeration and constructions of vertices of the polytope of polystochastic matrices. https://arxiv.org/abs/2502.09149

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO