[Paper Review] On a variant of Flory model

Tomislav Došlić, Mate Puljiz+2 more|arXiv (Cornell University)|Oct 22, 2022

Point processes and geometric inequalities4 citations

TL;DR

This paper introduces a one-dimensional variant of the Flory settlement model, modeling maximal configurations of houses on a 1×n strip where each house must receive sunlight from at least one side. Using the transfer matrix method on a six-vertex directed graph, the authors derive bivariate generating functions to enumerate such configurations, revealing asymptotic growth rates and establishing bijections with restricted permutations and specific walks, with key results including exact asymptotic densities and efficiency values for wider strips.

ABSTRACT

We consider a one-dimensional variant of a recently introduced settlement planning problem in which houses can be built on finite portions of the rectangular integer lattice subject to certain requirements on the amount of insolation they receive. In our model, each house occupies a unit square on a $1 imes n$ strip, with the restriction that at least one of the neighboring squares must be free. We are interested mostly in situations in which no further building is possible, i.e. in maximal configurations of houses in the strip. We reinterpret the problem as a problem of restricted packing of vertices in a path graph and then apply the transfer matrix method in order to compute the bivariate generating functions for the sequences enumerating all maximal configurations of a given length with respect to the number of houses. This allows us to determine the asymptotic behavior of the enumerating sequences and to compute some interesting statistics. Along the way, we establish close connections between our maximal configurations and several other types of combinatorial objects, including restricted permutations and walks on certain small oriented graphs. In all cases we provide combinatorial proofs. We then generalize our results in several directions by considering multi-story houses, by varying the insolation restrictions, and, finally, by considering strips of width 2 and 3. At the end we comment on several possible directions of future research.

Motivation & Objective

• To model and enumerate maximal configurations of houses on a 1×n strip under sunlight constraints, where each house must have at least one adjacent free square for insolation.
• To reformulate the problem as restricted vertex packing on a path graph and apply the transfer matrix method to derive bivariate generating functions.
• To establish combinatorial equivalences between maximal configurations and restricted permutations, providing explicit bijections.
• To generalize the model to multi-story houses, varied insolation rules, and strips of width 2 and 3, extending the generating function framework.

Proposed method

• Model the house placement problem as a binary word problem with forbidden patterns corresponding to houses without sunlight.
• Represent valid configurations as walks on a directed graph with six states encoding local neighborhood configurations.
• Apply the transfer matrix method to derive bivariate generating functions counting configurations by length and number of houses.
• Use spectral analysis of the transfer matrix to extract asymptotic growth rates of the enumerating sequences.
• Construct explicit bijections between maximal configurations and specific classes of restricted permutations to prove equinumerosity.
• Generalize the framework to multi-story houses and wider strips (2×n and 3×n) by adapting the state space and transfer matrix structure.

Experimental results

Research questions

• RQ1 What is the asymptotic growth rate of the number of maximal house configurations on a 1×n strip under the sunlight constraint?
• RQ2 How do the generating functions for maximal configurations on 1×n, 2×n, and 3×n strips behave, and what are their dominant singularities?
• RQ3 Are there combinatorial bijections between maximal configurations and other known combinatorial objects, such as restricted permutations or walks on small graphs?
• RQ4 How does the efficiency of maximal configurations (ratio of occupied to maximum possible houses) vary with strip width and insolation rules?
• RQ5 What are the effects of generalizing the model to multi-story houses or different sunlight requirements?

Key findings

• The number of maximal configurations on a 1×n strip grows asymptotically as C·ρ⁻ⁿ, where ρ⁻¹ ≈ 1.98456, yielding an exponential growth rate of approximately 1.98456.
• The average number of houses in a maximal configuration on a 1×n strip is asymptotically 0.503345·n, with a standard deviation of approximately 0.21355·n.
• The efficiency of the 1×n model is approximately 0.862498, meaning maximal configurations occupy about 86.25% of the theoretical maximum.
• For the 2×n strip, the efficiency is 0.862498, and for the 3×n strip, it is 0.887951, indicating improved packing efficiency with increasing width.
• The authors establish a bijection between maximal configurations and a specific class of restricted permutations, proving equinumerosity via explicit construction.
• The model generalizes successfully to multi-story houses and wider strips, yielding new sequences not yet in the OEIS, with multivariate generating functions derived for all cases.