arXiv:2606.16259v1

Super-Arrhenius relaxation of the triangular plaquette model in any dimension

Laurent Bartholdi, Ivailo Hartarsky, Ivan Mitrofanov

math.PRcond-mat.stat-mechmath.COmath.DSmath.GR60K3505A1605D9920F6537A2537B1060C0582C20

Abstract

Consider the following plaquette model from statistical physics: a lamp lies at every vertex of the triangular lattice and a switch lies at every even vertex of the (bipartite) dual hexagonal lattice. Each switch toggles the three lamps on its face. The energy of a configuration is the number of ON lamps. For the Glauber dynamics associated with the Gibbs measure defined by this Hamiltonian at any inverse temperature β>0β>0, we show that, in any dimension d2d\ge 2, the infinite volume relaxation time satisfies eβ2/C/CTrelCeeCβe^{β^2/C}/C \le T_{\mathrm{rel}}\le Ce^{e^{Cβ}} for some C>0C>0. Our result entails that the Gibbs measure is unique. The eβ2e^{β^2} scaling was conjectured by Newman and Moore in 1999 and matches the behaviour of supercritical rooted kinetically constrained models such as the East model, thus recovering fragile glass phenomenology in the absence of kinetic constraints. More precisely, we show that, on a torus of side length 2k2^k, when ββ\to\infty and k/β0k/β\to0, we have Trel=e2βk(1+o(1))T_{\mathrm{rel}}=e^{2βk(1+o(1))}. Quite surprisingly, however, we also prove that, on non-periodic finite domains of size neβ/Cn\le e^{β/C} for large C>0C>0, we have the much larger asymptotics lnTrel=βnΘ(1)\ln T_{\mathrm{rel}}=βn^{Θ(1)}. The main ingredients of the proofs are new results in extremal and enumerative combinatorics and rely on renormalisation ideas for the dynamics and its groundstates also known as the Ledrappier subshift. We note consequences of our results to geometric group theory (more precisely to the complexity of the word problem for the Baumslag finitely presented group) and to ergodic theory.

AI-generated audit

Audit summary

Audited against arXiv v1

Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.

Current report

Detailed mathematical audit

Generated August 18, 2026
01Statements2 reported findingsCorrect

The infinite-volume relaxation bounds, the sharp subcritical two-dimensional asymptotic, and the stronger finite-volume bottleneck theorem are correct.

Theorems 1.1 and 1.2Correct

The lower and upper relaxation scales follow from matching bottleneck and path arguments

Pages 5–7 and Sections 2–4 · Theorems 1.1 and 1.2 · arXiv:2606.16259v1

The combinatorial bottleneck constructs configurations whose required energy barrier gives the lower bounds through conductance. For the upper bounds, the canonical-path and bisection arguments control congestion at the announced volume and temperature scales. In dimension two on dyadic tori, the two estimates have the same leading kβk\beta exponent, yielding the stated limit.

Theorem 1.3Correct

The stronger finite-volume bottleneck is supported by the separated-set construction

Pages 6–7 and Sections 2.3–3.2 · Theorems 2.23 and 1.3 · arXiv:2606.16259v1

The admissible separated set forces every legal path from the selected configuration to the vacuum through a configuration with the required number of additional defects. The conductance test set is disjoint from its low-energy boundary for exactly that reason, and the Gibbs-weight ratio gives the displayed exponential lower bound.

02Proofs2 reported findingsCorrect

The combinatorial energy-barrier theorem, cycle enumeration, conductance estimates, and canonical-path upper bounds are complete and quantitatively compatible.

Theorems 2.2, 2.23, and 2.24Correct and complete

The combinatorial inputs establish both bottlenecks and the polynomial congestion control

Section 2 · arXiv:2606.16259v1

The recursive simplex identities account for all defects created by a local move, the separated-set construction supplies the claimed barrier, and the cycle-counting induction produces the polynomial bound used in congestion. Boundary and parity cases are treated separately where the recursions change, so no dimension or torus-size case used later is omitted.

Sections 3 and 4Correct and complete

The probabilistic conversion from barriers to relaxation time is valid

Conductance, canonical paths, and infinite-volume limit · arXiv:2606.16259v1

The bottleneck sets have positive Gibbs mass and the boundary-flow estimate uses the correct reversible measure. The upper bounds use paths with controlled length and load, after which standard comparison gives the spectral-gap estimate. The thermodynamic passage retains constants depending only on the dimension, as stated.

03Novelty0 reported findingsNo non-novelty findings

No non-novelty findings.

Detailed audit reportFull reasoning, manuscript locations, and references.
Open report PDF ↗

Author response

Challenge an audit finding

Local workflow preview

A listed author may submit formal evidence that an audit is inaccurate. The response would be considered in a fresh AI re-evaluation; it would not edit the audit automatically.

Paper
arXiv:2606.16259v1
Authors listed
Laurent Bartholdi, Ivailo Hartarsky, Ivan Mitrofanov
Audit date
August 18, 2026
  1. 01Establish identityMatch an authenticated scholarly identity to this paper.
  2. 02Submit evidenceIdentify the finding and give a formal mathematical response.
  3. 03Re-evaluateA separate agent checks the response and records a disposition.
Recommended production method

Authenticate with ORCID, then require an exact arXiv match

MathAudit should accept the identity only when ORCID OAuth authenticates the claimant's iD and this exact arXiv paper appears in arXiv's public authority feed for that iD. A matching name alone is not sufficient.

ORCID OAuth and arXiv authority-record lookup are not connected in this local prototype.

Email fallback for papers without a linked ORCID

A production fallback could send a one-time link only when the submitted address matches an independently maintained author-contact allowlist for this paper. MathAudit must return the same message for every address so the form cannot reveal which contacts are on that list.

This demonstration does not send, store, or compare the address.

Structured response preview

This form remains unavailable until production identity verification succeeds. Nothing entered here is submitted.

This panel never establishes authorship in the local prototype. A production result should be described narrowly as an authenticated ORCID match or control of a separately allowlisted author-contact mailbox.