arXiv (All)
open access
The Algebraicity Problem for Hard-Core Entropy Constants on the Discrete Hypertori
We use tools and techniques from $p$-adic analysis and algebraic number theory to study the algebraicity of the hard square entropy constant and its high dimensional analogues. Specifically, we study arithmetic properties of $a_d(n)$, the number of independent sets in the $d$-dimensional discrete to
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
- A statistical test suite for random and pseudorandom number generators for cryptographic applications#6602
- Spaces with the maximal projection constant revisited#1108928
- Lower and Upper Estimates of the Quantity of Algebraic Numbers#696316
- On a problem on Ramanujan-Sato series of level 11#1155486
- Non Uniform Kazhdan Constant for Linear Groups#819440
Record · ID 926212
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