We study the Jordan normal form of an upper triangular matrix constructed from a random acyclic graph or a random poset. Some limit theorems and concentration results for the number and sizes of Jordan blocks are obtained. In particular, we study a linear algebraic analog of Ulam’s longest increasing subsequence problem.
Similar content being viewed by others
References
R. P. Stanley, Enumerative Combinatorics, Vol. 1, any edition.
A. M. Vershik and S. V. Kerov, “Asymptotics of the maximal and typical dimensions of irreducible representations of a symmetric group,” Func. Anal. Appl., 19, No. 1, 21–31 (1985).
A. M. Vershik and S. V. Kerov, “Asymptotics of the Plancherel measure of the symmetric group and the limiting form of Young tableaux,” Dokl. Akad. Nauk SSSR, 233, No. 6, 1024–1027 (1977).
B. F. Logan and L. A. Shepp, “A variational problem for random Young tableaux,” Adv. Math., 26, 206–222 (1977).
S. Poljak, “Maximum rank of powers of a matrix of a given pattern,” Proc. Amer. Math. Soc., 106, No. 4, 1137–1144 (1989).
A. M. Borodin, “Limit Jordan normal form of large triangular matrices over a finite field,” Funct. Anal. Appl., 29, No. 4, 279–281 (1995).
R. P. Stanley, “Increasing and decreasing subsequences and their variants,” in: Proceedings of the International Congress of Mathematicians, Madrid, Spain (2006).
C. Greene and D. J. Kleitman, “The structure of Sperner k-families,” J. Combin. Theory Ser. A, 20, 41–68 (1976).
S. V. Fomin, “Finite partially ordered sets and Young tableaux,” Soviet Math. Dokl., 19, 1510–1514 (1978).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 448, 2016, pp. 252–262.
Rights and permissions
About this article
Cite this article
Petrov, F.V., Sokolov, V.V. Asymptotics of the Jordan Normal Form of a Random Nilpotent Matrix. J Math Sci 224, 339–344 (2017). https://doi.org/10.1007/s10958-017-3419-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-017-3419-z