For a permutation $\pi $, let $ S_ {n}(\pi) $ be the number of permutations on $ n $ letters
avoiding $\pi $. Marcus and Tardos proved the celebrated Stanley-Wilf conjecture that $ L …

The standard U (N) and SU (N) integrals are calculated in the large N limit. Our main finding
is that for an important class of integrals this limit is different for two groups. We describe the …

We determine the scaling limit for permutations conditioned to have longest decreasing
subsequence of length at most $ d $. These permutations are also said to avoid the pattern …

Motivated by the longest increasing subsequence problem, we examine sundry topics at the
interface of enumerative/algebraic combinatorics and random matrix theory. We begin with …

Following Ekhad and Zeilberger (The Personal Journal of Shalosh B. Ekhad and Doron
Zeilberger, Dec 5 2014; see also arxiv: 1412.2035), we study the asymptotics for large $ n …

The workshop was organized with an intent to extend to sparse and combinatorial structures
the benefits that random matrix theory has had on continuous and dense systems. We …