Related papers: Pattern-avoiding permutations and Brownian excursi…
Understanding the fluctuations of observables is one of the main goals in science, be it theoretical or experimental, quantum or classical. We investigate such fluctuations when only a subregion of the full system can be observed, focusing…
We consider the model of the Brownian plane, which is a pointed non-compact random metric space with the topology of the complex plane. The Brownian plane can be obtained as the scaling limit in distribution of the uniform infinite planar…
We discuss a new notion of pattern avoidance motivated by the operad theory: pattern avoidance in planar labelled trees. It is a generalisation of various types of consecutive pattern avoidance studied before: consecutive patterns in words,…
In this paper, we find explicit formulas or generating functions for the cardinalities of the sets $S_n(T,\tau)$ of all permutations in $S_n$ that avoid a pattern $\tau\in S_k$ and a set $T$, $|T|\geq 2$, of patterns from $S_3$. The main…
Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…
In this review paper, we first discuss some open problems related to two-dimensional self-avoiding paths and critical percolation. We then review some closely related results (joint work with Greg Lawler and Oded Schramm) on critical…
Let $\sigma$ and $\tau$ be patterns of length three; that is $\sigma, \tau \in \{123,132,213,231,312,321\}$. In this paper, we enumerate the set of cyclic permutations in $\mathcal{S}_n$ that avoid $\sigma$ in their one-line notation and…
We prove generalized versions of some conjectures of Joel Lewis on the number of alternating permutations avoiding certain patterns. Our main tool is the perhaps surprising observation that a classic bijection on pattern avoiding…
We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…
An infinte word w avoids a pattern p with the involution t if there is no substitution for the variables in p and no involution t such that the resulting word is a factor of w. We investigate the avoidance of patterns with respect to the…
We analyze the structure and enumerate Dumont permutations of the first and second kinds avoiding certain patterns or sets of patterns of length 3 and 4. Some cardinalities are given by Catalan numbers, powers of 2, little Schroeder…
We prove that the number of permutations avoiding an arbitrary consecutive pattern of length m is asymptotically largest when the avoided pattern is 12...m, and smallest when the avoided pattern is 12...(m-2)m(m-1). This settles a…
A frequent topic in the study of pattern avoidance is identifying when two sets of patterns $\Pi, \Pi'$ are Wilf equivalent, that is, when $|\text{Av}_n(\Pi)| = |\text{Av}_n(\Pi')|$ for all $n$. In recent work of Dokos et al. the notion of…
Recently, Yan and the first named author investigated systematically the enumeration of inversion or ascent sequences avoiding vincular patterns of length $3$, where two of the three letters are required to be adjacent. They established…
Consider a Brownian particle in three dimensions which is attracted by a plane with a strength proportional to some dimensionless parameter $\alpha$. We investigate the fractal spatial structure of the visited lattice sites in a cubic…
The Brownian separable permuton is a random probability measure on the unit square, which was introduced by Bassino, Bouvel, F\'eray, Gerin, Pierrot (2016) as the scaling limit of the diagram of the uniform separable permutation as size…
Permutation pattern-avoidance is a central concept of both enumerative and extremal combinatorics. In this paper we study the effect of permutation pattern-avoidance on the complexity of optimization problems. In the context of the dynamic…
In this paper, we propose a general framework that extends the theory of permutation patterns to higher dimensions and unifies several combinatorial objects studied in the literature. Our approach involves introducing the concept of a…
Nonlinear evolution can sometimes be modelled by a deterministic mapping from initial to final of the local smoothed overdensity. Perturbation theory methods base on this deterministic and local mapping and ignore the 'cloud-in-cloud'…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…