A combinatorial model for lane merging

MaRDI QIDQ6136001zbMATH OpenFDO

Authors Erik Insko, Katie Johnson, Haun Sullivan

Publication date 28 August 2023

Full work available at URL https://arxiv.org/abs/2203.02501, https://cs.uwaterloo.ca/journals/JIS/VOL26/Insko/insko5.html

zbMATH Keywords

ballot numberbijectiondomino snakelattice pathlongest trailtraffic

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Umbral calculus (05A40) Enumeration in graph theory (05C30) Paths and cycles (05C38) Traffic problems in operations research (90B20)

Recommendations

• scientific article; zbMATH DE number 1487765
• On the Traffic-light Queue
• Lattice path counting and the theory of queues
• Inversion of flux between zipper and non-zipper merging in highway traffic
• Computing the number of mergings with constraints

Cites work

• A history and a survey of lattice path enumeration
• Ballot theorems, old and new
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3681764 (Why is no real title available?)
• scientific article; zbMATH DE number 3712896 (Why is no real title available?)
• Lost (and Found) in Translation: André's Actual Method and Its Application to the Generalized Ballot Problem
• On tours that contain all edges of a hypergraph
• Pattern avoiding ballot paths and finite operator calculus
• Quasi-Eulerian hypergraphs

Cited in

(2)

• Lane formation by side-stepping
• A combinatorial model for lane merging: limited capacity lanes

This page was built for publication: A combinatorial model for lane merging

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