2000 character limit reached
Permutation-Like Matrices
Published 4 Mar 2024 in math.RA | (2403.02478v1)
Abstract: Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of Permutation Matrices. We give explicit formulas for the multiplication of these matrices. Lastly, we discuss the spectral radius, eigenvalues, and periodicity before giving a form of Birkhoff-Von Neumann's Theorem for Left Stochastic Matrices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.