Enumerating split-pair arrangements

DOI10.1016/J.JCTA.2007.06.003MaRDI QIDQ2474497zbMATHOpenAlexFDO

Authors Ron 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

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

Recommendations

• Left-right arrangements, set partitions and pattern avoidance
• S-arrangements with repetitions
• Counting the 2-disarrangements of \(2n\) numbers
• A counting method for non-neighboring rearrangement
• Combinatorial enumeration of the regions of some linear arrangements

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 3233639 (Why is no real title available?)
• Deux propriétés des arbres binaires ordonnés stricts. (Two properties of strictly ordered binary trees)
• Increasing trees and alternating permutations
• Markov bases of binary graph models
• Sequencing and scheduling in robotic cells: recent developments
• The On-Line Encyclopedia of Integer Sequences

Cited in

(13)

• The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution
• Alternation graphs
• Enumerating regular mixed-cell configurations
• Word-representability of Toeplitz graphs
• Some polynomials with unimodular roots
• Bijections for Entringer families
• Word-Representable Graphs: a Survey
• Enumeration of self-dual configurations
• S-arrangements with repetitions
• The enumeration of standard puzzles
• The doubloon polynomial triangle
• On the representation number of a crown graph
• Semi-transitive orientations and word-representable graphs

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Enumerating split-pair arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2474497)