A combinatorial model for lane merging

arXiv2203.02501MaRDI QIDQ6136001FDOQ6136001

Authors: Erik Insko, Katie Johnson, Haun Sullivan 

Publication date: 28 August 2023

Full work available at URL: https://arxiv.org/abs/2203.02501

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

zbMATH Keywords

lattice pathbijectiontrafficballot numberdomino snakelongest trail

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Lane formation by side-stepping

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)