The following pages link to Janet Simpson Beissinger (Q1072553):
Displaying 4 items.
- The enumeration of irreducible combinatorial objects (Q1072554) (← links)
- Enumeration of labelled threshold graphs and a theorem of Frobenius involving Eulerian polynomials (Q1089352) (← links)
- Similar constructions for Young tableaux and involutions, and their application to shiftable tableaux (Q1105601) (← links)
- On external activity and inversions in trees (Q1172066) (← links)
