arXiv (All)
open access
Intractable enumeration problems are like Russian nesting dolls: structural properties of monomer-dimer coverings on two-dimensional quadratic lattices
Counting the number of coverings of $s$ dimers on two-dimensional quadratic lattices is considered as intractable and belongs to \#P-complete class. We reveal the structure of the exact solution to the problem and provide an explicit formula for it, which includes $s-1$ nesting sums. This results in
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 Remaining $K_4$-Free Case in the Multipartite Clique Problem#1013778
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#667908
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Fixed-Perimeter Franklin Statistics and an Eventual Inequality#999985
- Sets of cardinality seven are not sum-dominant#1131257
Record · ID 1035636
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