We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main
technique consists in using Stanley's standardization to obtain a transport theorem between …

A Cayley permutation is a word of positive integers such that if a letter appears in this word,
then all positive integers smaller than that letter also appear. We initiate a systematic study …

The in-order traversal provides a natural correspondence between binary trees with a
decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex …

Abstract Let α= a 1 a 2… an be a sequence of nonnegative integers. The ascent set of α, Asc
α, consists of all indices k where a k+ 1> a k. An ascent sequence is α where the growth of …

A Cayley permutation is a word of positive integers such that if a letter appears in this word,
then all positive integers smaller than that letter also appear. We initiate a systematic study …

In this paper, we prove two conjectures of Egge on enumeration of several classes of pattern-
avoiding Fishburn permutations. Our results include enumerating Fishburn permutations …

Ascent sequences and their modified version play a central role in the bijective framework
relating several combinatorial structures counted by the Fishburn numbers. Ascent …