• Corpus ID: 239009979

Subregularity in infinitely labeled generating trees of restricted permutations

@inproceedings{Mansour2021SubregularityII,
  title={Subregularity in infinitely labeled generating trees of restricted permutations},
  author={Toufik Mansour and Reza Rastegar and Mark Shattuck},
  year={2021}
}
In this paper, we revisit the application of generating trees to the pattern avoidance problem for permutations. In particular, we study this problem for certain general sets of patterns and propose a new procedure leveraging the FinLabel algorithm and exploiting the subregularities in the associated generating trees. We consider some general kinds of generating trees for which the FinLabel algorithm fails to determine in a finite number of iterations the generating function that enumerates the… 

Figures from this paper

References

SHOWING 1-10 OF 26 REFERENCES
Finitely labeled generating trees and restricted permutations
TLDR
Sometimes the generating tree for the set of permutations avoiding a set of patterns requires infinitely many labels, but sometimes this generating tree needs only finitely many labels.
Generating trees and forbidden subsequences
  • J. West
  • Computer Science, Mathematics
    Discret. Math.
  • 1996
TLDR
An enumerative technique called generating trees which was introduced in the study of Baxter permutations with forbidden subsequences is discussed and the broader use of generating trees in combinatorial enumeration is argued for.
Refining Enumeration Schemes to Count According to Permutation Statistics
TLDR
It is proved that when a finite enumeration scheme exists to compute the number of permutations avoiding a given set of vincular patterns, the scheme can also compute the distribution of certain permutation statistics with very little extra computation.
Restricted permutations
  • M. Atkinson
  • Computer Science, Mathematics
    Discret. Math.
  • 1999
TLDR
The partial order on permutations that underlies the idea of restriction and which gives rise to sets of sequences closed under taking subsequences is studied.
A methodology for plane tree enumeration
TLDR
A method for enumerating some classes of combinatorial objects by means of an operator, able to satisfy two particular conditions, is illustrated, and some recursive descriptions of these subclasses are used to deduce the functional equations satisfied by the classes' generating functions.
Generating functions for generating trees
TLDR
The relationship between structural properties of the rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating functions are investigated.
Generating trees and the Catalan and Schröder numbers
  • J. West
  • Computer Science, Mathematics
    Discret. Math.
  • 1995
TLDR
A new bijective proof of the well-known result that /vbSn(123)/vb = /v bSn(132)/ vb = cn, the nth Catalan number is presented and an asymptotic formula for the vexillary permutations is given.
From Motzkin to Catalan permutations
TLDR
For every integer j>1, a class of permutations in terms of certain forbidden subsequences is computed according to several parameters, and it is shown that only this generating function is algebraic according to the length of the permutations.
Enumeration schemes for words avoiding permutations
The enumeration of permutation classes has been accomplished with a variety of techniques. One wide-reaching method is that of enumeration schemes, introduced by Zeilberger and extended by Vatter. In
Enumeration Schemes for Restricted Permutations
  • Vincent Vatter
  • Mathematics, Computer Science
    Combinatorics, Probability and Computing
  • 2008
TLDR
The Maple package WilfPlus is described, which implements the enumeration of many more permutation classes and compares enumeration schemes to three other systematic enumeration techniques: generating trees, substitution decompositions, and the insertion encoding.
...
1
2
3
...