Related papers: Pattern Avoidance in Parking Functions

For any integers $1\leq k\leq n$, we introduce a new family of parking functions called $k$-vacillating parking functions of length $n$. The parking rule for $k$-vacillating parking functions allows a car with preference $p$ to park in the…

We introduce a new parking procedure called MVP parking in which $n$ cars sequentially enter a one-way street with a preferred parking spot from the $n$ parking spots on the street. If their preferred spot is empty, they park there.…

This paper continues the analysis of the pattern-avoiding sorting machines recently introduced by Cerbai, Claesson and Ferrari [CCF]. These devices consist of two stacks, through which a permutation is passed in order to sort it, where the…

We consider the distribution of ascents, descents, peaks, valleys, double ascents, and double descents over permutations avoiding a set of patterns. Many of these statistics have already been studied over sets of permutations avoiding a…

We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to…

In this work of thesis we introduce and study a new family of sorting devices, which we call pattern-avoiding machines. They consist of two stacks in series, equipped with a greedy procedure. On both stacks we impose a static constraint in…

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…

Let $1\leq r\leq n$ and suppose that, when the Depth-first Search Algorithm is applied to a given rooted labelled tree on $n+1$ vertices, exactly $r$ vertices are visited before backtracking. Let $R$ be the set of trees with this property.…

The pattern avoidance problem seeks to construct a set with large fractal dimension that avoids a prescribed pattern, such as three term arithmetic progressions, or more general patterns, such as finding a set whose Cartesian product avoids…

In parking problems, a given number of cars enter a one-way street sequentially, and try to park according to a specified preferred spot in the street. Various models are possible depending on the chosen rule for collisions, when two cars…

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of…

Parking functions are tuples that describe the parking of $M$ cars on a street with $M$ parking spots. In this paper, we define exact $k$-typed parking functions ($k$-TPFs) to be a variant of classical parking functions. We then establish…

Models of parking in which cars are placed randomly and then move according to a deterministic rule have been studied since the work of Konheim and Weiss in the 1960s. Recently, Damron, Gravner, Junge, Lyu, and Sivakoff introduced a model…

We extend the notion of parking functions to parking sequences, which include cars of different sizes, and prove a product formula for the number of such sequences.

For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are…

There are several combinatorial objects that are known to be in bijection to the spanning trees of a graph G. These objects include G-parking functions, critical configurations of G, and descending traversals of G. In this paper, we extend…

In [BabStein] Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In [Kit1] Kitaev considered simultaneous…

We introduce a new technique to study pattern avoidance in dynamical systems, namely the use of a commuter function between non-conjugate dynamical systems. We investigate the properties of such a commuter function, specifically $h : [0,1]…

We test the umbral methods introduced by Rota and Taylor within the theory of representation of symmetric group. We define a simple bijection between the set of all parking functions of length $n$ and the set of all noncrossing partitions…

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…