arXiv (All)
open access
Trees that can be grown in "too many" ways: Bouch's construction and a bound for every size
We show that, for every positive integer $L$, there is a rooted tree on the square lattice that can be grown in at least $L!/C^L$ distinct ways, where $L$ denotes the number of bonds and $C>1$ is a constant independent of $L$. Bouch's hierarchical construction [Bouch2015] gives such trees along an u
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size#180633
- Site preparation alters soil distribution of roots and ectomycorrhizae on outplanted western white pine and Douglas-fir#623650
- Replication data for: Enhanced Structural Complexity Index: An Improved Index for Describing Forest Structural Complexity#1027700
- Beyond Distance Ordering: Resource Complexity and Universal Optimality of Exact Labeled Directed Shortest Paths#971490
- Long-Term Effects of Harvesting Disturbance and Site Preparation on Soil Properties and Tree Growth in a Loblolly Pine (Pinus taeda) Forest#823357
Record · ID 999634
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive