加载中…
We prove that the Füredi-Hajnal limit and the Stanley-Wilf limit of a uniformly random permutation matrix of order are at most with probability tending to one as . This improves the bound of Cibulka and Kynčl. Together with the lower bound due to Fox, these bounds show that the logarithms of both limits are for almost all permutations.

生成讲解博客的中文版本

生成AI智能校验的中文版本