相关论文: A Permutation Regularity Lemma

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…

Reviewing the semiclassical theory for the parametric level density fluctuations, we show that for large parametric changes the density correlation function, after rescaling, becomes universal and coincides with the leading asymptotic term…

Gram's Law describes a pattern that frequently occurs in the distribution of the non-trivial zeros of the Riemann zeta function along the critical line. Whenever Gram's Law holds true, it reduces the difficulty of computing the…

Generalizing the notion of a vexillary permutation, we introduce a filtration of S_infinity by the number of Schur function terms in the Stanley symmetric function, with the kth filtration level called the k-vexillary permutations. We show…

The classes of tree permutations and forest permutations were defined by Acan and Hitczenko (2016). We study random permutations of a given length from these classes, and in particular the number of occurrences of a fixed pattern in one of…

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions…

We study (asymmetric) $U$-statistics based on a stationary sequence of $m$-dependent variables; moreover, we consider constrained $U$-statistics, where the defining multiple sum only includes terms satisfying some restrictions on the gaps…

For a set of permutation patterns $\Pi$, let $F^\text{st}_n(\Pi,q)$ be the st-polynomial of permutations avoiding all patterns in $\Pi$. Suppose $312\in\Pi$. For a class of permutation statistics which includes inversion and descent…

In the set of all patterns in $S_n$, it is clear that each k-pattern occurs equally often. If we instead restrict to the class of permutations avoiding a specific pattern, the situation quickly becomes more interesting. Mikl\'os B\'ona…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

An exchangeable random matrix is a random matrix with distribution invariant under any permutation of the entries. For such random matrices, we show, as the dimension tends to infinity, that the empirical spectral distribution tends to the…

Different ways to describe a permutation, as a sequence of integers, or a product of Coxeter generators, or a tree, give different choices to define a simple permutation. We recollect few of them, define new types of simple permutations,…

By a classical principle of probability theory, sufficiently thin subsequences of general sequences of random variables behave like i.i.d.\ sequences. This observation not only explains the remarkable properties of lacunary trigonometric…

In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…

A simple permutation is one that does not map a nontrivial interval onto an interval. It was recently proved by Albert and Atkinson that a permutation class with only finitely simple permutations has an algebraic generating function. We…

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer\'edi theorem which says that any subset of a pseudorandom set of…

A permutation $\pi$ is said to avoid a chain $(\sigma:\tau)$ of patterns if $\pi$ avoids $\sigma$ and $\pi^2$ avoids $\tau.$ In this paper, we define a notion of pattern avoidance for compositions of positive integers and use that idea to…

We review how the monotone pattern compares to other patterns in terms of enumerative results on pattern avoiding permutations. We consider three natural definitions of pattern avoidance, give an overview of classic and recent formulas, and…