Enumerating split-pair arrangements

DOI10.1016/j.jcta.2007.06.003zbMath1144.05006OpenAlexW2154534416MaRDI QIDQ2474497

Ronald L. Graham, Nan Zang

Publication date: 6 March 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2007.06.003

zbMATH Keywords

permutationsenumerationBernoulli numbersrobotic scheduling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items

The enumeration of standard puzzles, Word-Representable Graphs: a Survey, Bijections for Entringer families, The doubloon polynomial triangle, Semi-transitive orientations and word-representable graphs, Unnamed Item, On the representation number of a crown graph, Alternation Graphs, Word-representability of Toeplitz graphs

Uses Software

• OEIS

Cites Work

• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
• Sequencing and scheduling in robotic cells: recent developments
• Markov bases of binary graph models
• Increasing trees and alternating permutations
• Unnamed Item
• Unnamed Item
• Unnamed Item