Maximal Exponents of K-Primitive Matrices: The Polyhedral Cone Case
Raphael Loewy, Bit-Shun Tam

TL;DR
This paper determines the maximum exponents of K-primitive matrices for polyhedral cones in real space, revealing exact values and classifications for various dimensions and cone structures.
Contribution
It establishes explicit formulas for the maximum exponents of K-primitive matrices in polyhedral cones and classifies the extremal cases for specific dimensions and configurations.
Findings
Maximum exponent formula for even m or both m and n odd: (n-1)(m-1)+1
Lower and upper bounds for odd m and even n: at least (n-1)(m-1), at most (n-1)(m-1)+1
Classification of cones and matrices attaining maximum exponent for certain cases
Abstract
Let be a proper (i.e., closed, pointed, full convex) cone in . An matrix is said to be -primitive if there exists a positive integer such that int ; the least such is referred to as the exponent of and is denoted by . For a polyhedral cone , the maximum value of , taken over all -primitive matrices , is denoted by . It is proved that for any positive integers , the maximum value of , as runs through all -dimensional polyhedral cones with extreme rays, equals when is even or and are both odd, and is at least and at most when is odd and is even. For the cases when or , the cones and the corresponding -primitive matrices …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Mathematical Theories and Applications
