Related papers: Bounded affine permutations I. Pattern avoidance a…

The number of even 321-avoiding permutations of length n is equal to the number of odd ones if n is even, and exceeds it by the (n-1)/2th Catalan number otherwise. We present an involution that proves a refinement of this sign-balance…

In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…

We study the asymptotic diffusion processes with (generally nonlocal) open boundaries in one dimension which are exactly solvable by means of the recently developed recursion formula. We investigate the stationary states, which cannot be…

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…

This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…

Let $\mu$ be a probability measure on $\mathbb{R}^n$ with a bounded density $f$. We prove that the marginals of $f$ on most subspaces are well-bounded. For product measures, studied recently by Rudelson and Vershynin, our results show there…

We study the iteration of the process "a particle jumps to the right" in permutations. We prove that the set of permutations obtained in this model after a given number of iterations from the identity is a class of pattern avoiding…

We consider asymptotics of set partition pattern avoidance in the sense of Klazar. Our main result derives the asymptotics of the number of set partitions avoiding a given set partition within an exponential factor, which leads to a…

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding…

The question of the integrability of real-coupling affine toda field theory on a half-line is addressed. It is found, by examining low-spin conserved charges, that the boundary conditions preserving integrability are strongly constrained.…

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…

We modify the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a regular insertion encoding.

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…

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…

In this paper we develop a new statistical model for the irradiance fluctuations of an unbounded optical wavefront (plane and spherical waves) propagating through a turbulent medium under all irradiance fluctuation conditions in…

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

We analyze here different forms of fractional relaxation equations of order {\nu}\in(0,1) and we derive their solutions both in analytical and in probabilistic forms. In particular we show that these solutions can be expressed as crossing…

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

A crucial permutation is a permutation that avoids a given set of prohibitions, but any of its extensions, in an allowable way, results in a prohibition being introduced. In this paper, we introduce five natural types of crucial…

In a previous work, B\'ona and Pantone studied permutations that avoided all but one pattern of length $k$ that began with a length $k-1$ increasing subsequence. We draw the connection between that idea and distant patterns, first discussed…