arXiv (OAI Expanded)
open access
Discrete Gaussian free fields on Hamming graphs
We discuss a class of discrete Gaussian free fields on Hamming graphs of dimension $d$ with vertex set $\mathcal{X}=\{0,1,\ldots,n-1\}^d$, where interactions depend solely on the Hamming distance between vertices. This class provides a setting distinct from the commonly studied fields on the integer
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
- Exponential Correlation Bounds for Polynomials#1076495
- Reed-Muller codes have vanishing bit-error probability below capacity: a simple tighter proof via camellia boosting#388253
- Non-Euclidean Erdős-Anning Theorems#131206
- The Erdős-Pósa Property for Colorful Minors#971921
- On the algorithmic complexity of twelve covering and independence parameters of graphs#652635
Record · ID 1122997
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