We characterize the permutative automorphisms of the Cuntz algebra O n O_n (namely, stable permutations) in terms of two sequences of graphs that we associate to any permutation of a discrete hypercube [ n ] t [n]^t . As applications we show that in the limit of large t t (resp. n n ) almost all permutations are not stable, thus proving Conj. 12.5 of Brenti and Conti [Adv. Math. 381 (2021), p. 60], characterize (and enumerate) stable quadratic 4 4 and 5 5 -cycles, as well as a notable class of stable quadratic r r -cycles, i.e. those admitting a compatible cyclic factorization by stable transpositions. Some of our results use new combinatorial concepts that may be of independent interest.
No takes yet. Share an insight, caveat, or question.
Brenti et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: