Periodic forests whose largest clearings are of size n ≥ 4

DOI10.1098/rspa.1970.0185zbMath0221.05023OpenAlexW1832608494WikidataQ56863601 ScholiaQ56863601MaRDI QIDQ5625180

Hugh G. Apsimon

Publication date: 1970

Published in: Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rspa.1970.0185

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

Statistical mechanics of cellular automata ⋮ Algebraic properties of cellular automata