Enumerating split-pair arrangements

Journal of Combinatorial Theory. Series A

Volumn 115, Issue 2, 2008, Pages 293-303

  Graham, Ron ^a   Zang, Nan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Bernoulli numbers; Enumeration; Permutations; Robotic scheduling

Indexed keywords

EID: 41749110013     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2007.06.003     Document Type: Article

References (7)

1. Dawande M., Geisman H.N., Sethi S., and Sriskandarajah C. Sequencing and scheduling in robotic cells: Recent developments. J. Sched. 8 (2005) 387-426
2. Develin M.P., and Sullivant S.P. Markov bases of binary graph models. Ann. Comb. 7 (2003) 441-466
3. Entringer R.C. A combinatorial interpretation of the Euler and Bernoulli numbers. Nieuw Arch. Wiskd. (3) 14 (1966) 241-246
4. Graham R.L., Knuth D.E., and Patashnik O. Concrete Mathematics. second ed. (1994), Addison-Wesley, Reading, MA xiii+657 pp
5. Kuznetsov A., Pak I., and Postnikov A. Increasing trees and alternating permutations. Uspekhi Mat. Nauk 49 (1994) 79-110
6. Poupard C. Deux proprietes des arbres binaires ordonnes stricts. European J. Combin. 10 (1989) 369-374
7. Sloane N.J.A. On-line encyclopedia of integer sequences. http://www.research.att.com/~njas/sequences/