Asymptotics of the Jordan Normal Form of a Random Nilpotent Matrix


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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.

About the authors

F. V. Petrov

St. Petersburg Department of Steklov Institute of Mathematics

Author for correspondence.
Email: fedyapetrov@gmail.com
Russian Federation, St. Petersburg

V. V. Sokolov

St. Petersburg State Univeristy

Email: fedyapetrov@gmail.com
Russian Federation, St. Petersburg

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Springer Science+Business Media New York