… , denoted pin-permutations. These … pin-permutations has a rational generating function.
We prove this conjecture, focusing on the substitution decomposition trees of pin-permutations…

… pin permutations to construct uncountably many well-quasi-ordered permutation classes with
distinct enumerations, … it suffices to consider pin permutations initiated in the following way. …

… Most of the research done in this domain concerns enumeration … Examples of such general
results may regard enumeration of … of the class of pin-permutations, which contains the proper …

… by making use of optimal pin permutations. … enumerate all pin permutation instead of using
the above matching based approach. Being exponential in runtime, though, enumeration is …

… Put things together to compute the generating function of pin-permutations … Thm[Albert
Atkinson]: C contains finitely many simple permutations ⇒ C has an algebraic generating …

… qn be some enumeration of these new nets induced by IV. Table 1 shows the nets for the …
One such total order is obtained by numbering the vertices from 1 to N so that each vertex has …

… mostly interested in enumeration questions as testified by … the number of proper pin-permutations
is changed into testing … of simple patterns and proper pin-permutations, some links …

… Our goal is to provide automatic methods to enumerate permutation classes. More precisely…
of permutations called pin-permutations. In [3], we characterize the pin-permutations in terms …

… Our goal is to provide automatic methods to enumerate permutation classes. More precisely…
of permutations called pin-permutations. In [3], we characterize the pin-permutations in terms …

… terms in the enumeration sequence of a ‘-closed subclass of P. To find such a bound we notice
… all pin permutations of length n + 1 can be obtained as ‘extensions’ of pin permutations of …