Determining lower bounds for packing densities of non-layered patterns using weighted templates.
Deux propriétés combinatoires du langage de Lukasiewicz
Die Kombinationen gegebenen Profils. I
Die Kombinationen gegebenen Profils. II
Die Kombinationen gegebenen Profils. III
Distribution of segment lengths in genome rearrangements.
Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN.
Domination in functigraphs
Let G₁ and G₂ be disjoint copies of a graph G, and let f:V(G₁) → V(G₂) be a function. Then a functigraph C(G,f) = (V,E) has the vertex set V = V(G₁) ∪ V(G₂) and the edge set E = E(G₁) ∪ E(G₂) ∪ {uv | u ∈ V(G₁), v ∈ V(G₂),v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let γ(G) denote the domination number of G. It is readily seen that γ(G) ≤ γ(C(G,f))...
Duality of antidiagonals and pipe dreams.
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