Edge Bases of Complete Uniform Hypergraphs
Edge theorem for finite partially ordered sets
Edges and tableaux. (Arêtes et tableaux.)
Edit distance between unlabeled ordered trees
There exists a bijection between one-stack sortable permutations (permutations which avoid the pattern (231)) and rooted plane trees. We define an edit distance between permutations which is consistent with the standard edit distance between trees. This one-to-one correspondence yields a polynomial algorithm for the subpermutation problem for (231) pattern-avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered unlabeled trees and some special ones. For...
Eine gruppentheoretische Methode in der Musiktheorie
Endliche 0-1-Folgen mit gleichen Teilblöcken.
Enumerating pattern avoidance for affine permutations.
Enumerating permutations avoiding more than three Babson-Steingrímsson patterns.
Enumerating permutations that avoid three term arithmetic progressions.
Enumerating segmented patterns in compositions and encoding by restricted permutations.
Énumération de classes de permutations
Enumeration in musical theory.
Enumeration of derangements with descents in prescribed positions.
Enumeration of factorizable multi-dimensional permutations.
Enumeration of permutations with restricted subsequences. (Enumération de permutations à motifs exclus.)
Enumeration of pin-permutations.
Enumeration schemes for permutations avoiding barred patterns.
Enumeration schemes for words avoiding patterns with repeated letters.
Equidistribution and sign-balance on 132-avoiding permutations.
Equidistribution and sign-balance on 321-avoiding permutations.