Conceptio › Archive › arXiv (OAI Expanded)
arXiv (OAI Expanded) open access

A formal framework for higher-order spin models via hypergraphs, polymatroids, and the Tutte polynomial

Berrekkal, Khallil et al. · arxiv_oai_expanded
arXiv (OAI Expanded) · Papers
Open Source ↗Direct PDF ↓
05b3505c3105c6582b20combinatoricsmathematical-physicsstatistical-mechanics
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.

[2608.14628] A formal framework for higher-order spin models via hypergraphs, polymatroids, and the Tutte polynomial Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Combinatorics arXiv:2608.14628 (math) [Submitted on 23 Jul 2026] Title: A formal framework for higher-order spin models via hypergraphs, polymatroids, and the Tutte polynomial Authors: Khallil Berrekkal , Joanna A. Ellis-Monaghan , Merijn Moody , Clélia de Mulatier View a PDF of the paper titled A formal framework for higher-order spin models via hypergraphs, polymatroids, and the Tutte polynomial, by Khallil Berrekkal and 3 other authors View PDF HTML (experimental) Abstract: We develop a rigorous mathematical framework for statistical mechanics models on hypergraphs, and give conditions for lifting the classical connection between Potts model partition functions and the Tutte polynomial from graphs to hypergraphs. We define hypergraphical models and their associated partition functions, and extend these to special classes of models induced by families of interaction functions. For boolean interaction families, whose interaction functions map to $\{0,1\}$, we show that the partition function is determined by a combinatorial rank function, and we establish sufficient conditions for a hypergraph deletion-contraction recurrence and for when the rank function defines a polymatroid. We illustrate the theory by applying it to three hypergraph interaction families: Parity Ising, Delta Potts, and And Ising. The induced hypergraphical models are not isomorphic to each other, but the first two reduce to the same graphical Ising models. We identify three polymatroids naturally associated with hypergraphs for these models: respectively, the binary matroid of the incidence matrix over $\mathbb{F}_2$, the hypergraphical polymatroid, and the boolean polymatroid. For graphs, the first two reduce to the classical graphical matroid, and their partition functions recover the multivariate Tutte polynomial. The Tutte polynomial thus admits at least two distinct generalizations for hypergraphs, both satisfying a deletion-contraction recurrence: the Tutte polynomial of the binary matroid of the hypergraph incidence matrix, and a multivariate version of the Poincaré polynomial of the hypergraphical polymatroid. The partition functions of And Ising models are likewise multivariate versions of the Poincaré polynomial, here of the boolean polymatroid. These examples illustrate the much greater range of hypergraphical models and underscore the need for the unifying theory. Subjects: Combinatorics (math.CO) ; Statistical Mechanics (cond-mat.stat-mech); Mathematical Physics (math-ph) MSC classes: 82B20, 05C31, 05C65, 05B35 Cite as: arXiv:2608.14628 [math.CO] (or arXiv:2608.14628v1 [math.CO] for this version) https://doi.org/10.48550/arXiv.2608.14628 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Merijn Moody [ view email ] [v1] Thu, 23 Jul 2026 18:29:52 UTC (58 KB) Full-text links: Access Paper: View a PDF of the paper titled A formal framework for higher-order spin models via hypergraphs, polymatroids, and the Tutte polynomial, by Khallil Berrekkal and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.CO < prev | next > new | recent | 2026-08 Change to browse by: cond-mat cond-mat.stat-mech math math-ph math.MP References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

Record · ID 609066 · SHA-256 efff54b7d4a7a7e9
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