Pages that link to "Item:Q3142268"

The following pages link to An algorithm to compute the möbius function of the rotation lattice of binary trees (Q3142268):

Displaying 7 items.

• The phagocyte lattice of Dyck words (Q862973) (← links)
• Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
• The pruning-grafting lattice of binary trees (Q2378517) (← links)
• \(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ball (Q2401978) (← links)
• Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions (Q4264492) (← links)
• Shellable nonpure complexes and posets. II (Q4372583) (← links)
• Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology (Q6642295) (← links)