Asymptotic Behavior of Acyclic and Cyclic Orientations of Directed Lattice Graphs
Shu-Chiuan Chang, Robert Shrock

TL;DR
This paper calculates and bounds exponential growth constants for orientations of directed lattice graphs, providing new precise estimates and exact values, and explores their asymptotic behavior and relation to spanning trees.
Contribution
It introduces the best current bounds and exact values for exponential growth constants of acyclic and cyclic orientations on various lattice graphs, advancing understanding of their asymptotic properties.
Findings
Bounds on exponential growth constants are very close to exact values.
Exponential growth constants increase monotonically with vertex degree.
Ratios of orientation quantities to total edge orientations approach asymptotic limits.
Abstract
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs of finite width and arbitrarily great length, in the infinite-length limit, denoted {G}. Specifically, we calculate the exponential growth constants for (i) acyclic orientations, , (ii) acyclic orientations with a single source vertex, , and (iii) totally cyclic orientations, . We consider several lattices, including square (sq), triangular (tri), and honeycomb (hc). From our calculations, we infer lower and upper bounds on these exponential growth constants for the respective infinite lattices. To our knowledge, these are the best current bounds on these quantities. Since our lower and upper bounds are quite close to each…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
