Pattern Avoidance Classes and Subpermutations
Copyright policy )Pattern Avoidance Classes and Subpermutations
Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
Permutations, words, matrices, 05A05, restricted permutations, permutation patterns, Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Asymptotic enumeration
Permutations, words, matrices, 05A05, restricted permutations, permutation patterns, Exact enumeration problems, generating functions, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Asymptotic enumeration
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!