13 citations · 52 across the 13 of their papers we have counts for
4 papers · 1 filter
Scaling limits of permutations avoiding long decreasing sequences
Christopher Hoffman, Douglas Rizzolo, Erik Slivken
We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most . These permutations are also said to avoid the pattern $(d+…
Almost square permutations are typically square
Jacopo Borga, Enrica Duchi, Erik Slivken
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are…
Time Scales of the Fredrickson-Andersen Model on Polluted and
Assaf Shapira, Erik Slivken
We study the Kinetically Constrained Model on the polluted square lattice, with two-neighbor constraints. For a quenched polluted environment with low pollution density we give bou…
Square permutations are typically rectangular
Jacopo Borga, Erik Slivken
We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is…