Related papers: Transport of patterns by Burge transpose
Inspired by the definition of modified ascent sequences, we introduce a new class of integer sequences called revised ascent sequences. These sequences are defined as Cayley permutations where each entry is a leftmost occurrence if and only…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
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 primitive modified ascent sequences and 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 sequences are positive integer sequences defined by imposing a…
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 labeling we arrive at a class of trees that we call…
Ascent sequences play a key role in the combinatorics of Fishburn structures. Difference ascent sequences are a natural generalization obtained by replacing ascents with $d$-ascents. We have recently extended the so-called hat map to…
Pattern avoiding machines were recently introduced by Claesson, Ferrari and the current author to gain a better understanding of the classical $2$-stacksort problem. In this paper we generalize these devices by allowing permutations with…
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 of pattern avoidance on Cayley permutations…
The synthesis of string transformation programs from input-output examples utilizes various techniques, all based on an inductive bias that comprises a restricted set of basic operators to be combined. A new algorithm, Transduce, is…
A permutation is called Grassmannian if it has at most one descent. The study of pattern avoidance in such permutations was initiated by Gil and Tomasko in 2021. We continue this work by studying Grassmannian permutations that avoid an…
Word order evolution has been hypothesized to be constrained by a word order permutation ring: transitions involving orders that are closer in the permutation ring are more likely. The hypothesis can be seen as a particular case of…
We introduce and study a new notion of patterns in Stirling and $k$-Stirling permutations, which we call block patterns. We prove a general result which allows us to compute generating functions for the occurrences of various block patterns…
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…
We discuss several seemingly assorted objects: the umbral calculus, generalised translations and associated transmutations, symbolic calculus of operators. The common framework for them is representations of the Weyl algebra of the…
In this paper, we prove two conjectures of Egge on the enumeration of several classes of pattern-avoiding Fishburn permutations. Our results include enumerating Fishburn permutations avoiding pattern 321 and one of the following three types…
A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…
The class of permutations that avoid the bivincular pattern (231, {1},{1}) is known to be enumerated by the Fishburn numbers. In this paper, we call them Fishburn permutations and study their pattern avoidance. For classical patterns of…
Just as gauge theory describes the parallel transport of point particles using connections on bundles, higher gauge theory describes the parallel transport of 1-dimensional objects (e.g. strings) using 2-connections on 2-bundles. A 2-bundle…
In this paper, we study the pattern occurrence in $k$-ary words. We prove an explicit upper bound on the number of $k$-ary words avoiding any given pattern using a random walk argument. Additionally, we reproduce several already known…
This paper develops a version of dependent type theory in which isomorphism is handled through a direct generalization of the 1939 definitions of Bourbaki. More specifically we generalize the Bourbaki definition of structure from simple…