A physics-first tour of established links

Hyperplanes & parking functions in quantum physics

A small, self-contained HTML demo for reading the Pak–Stanley world from the physics side: where hyperplanes genuinely organize quantum systems, and where parking functions enter through trees, sandpiles, and representation theory.

Parking on Shi Streets: interactive book All explainers Start with the map → Physics dictionary References
Closest to QMCalogero–Moser, Cherednik algebras, Bethe/Gaudin systems.
Closest to QFT/CFTKZ equations, WZW conformal blocks, graph/Symanzik polynomials.
Closest to parking functionsG-parking functions, spanning trees, chip-firing, abelian sandpiles.
Main caveatParking functions are usually labels/shadows, not standard quantum observables.
Orientation

The existing landscape

Use the filter buttons to separate direct hyperplane appearances from the more indirect parking-function appearances.

Map from Pak-Stanley to quantum and statistical physics connections A node diagram splitting into hyperplane arrangements and parking functions, then to quantum integrable systems, CFT, gauge theory, Feynman graph polynomials, sandpiles, and Cherednik representations. Pak–Stanley Shi chambers ↔ parking labels your starting point Hyperplanes walls, singular loci Graphs / trees spanning-tree backbone Parking funcs chip-firing labels Calogero–Moser KZ / WZWCFT Bethe /Gaudin Feynmanpolynomials Sandpile/ LCFT Cherednikparking space
Directquantum mechanics

Hyperplanes as singular walls

In Calogero–Moser-type Hamiltonians, particle-collision hyperplanes xᵢ = xⱼ carry inverse-square singularities. The chambers are ordering sectors of particles.

DirectBethe ansatz

Arrangements as integrable models

Varchenko assigns a quantum integrable model to a weighted affine arrangement; critical points of a master function control Hamiltonians/Bethe data.

Indirectstatistical field theory

Parking functions through sandpiles

G-parking functions index algebra bases and are tied to spanning trees and recurrent sandpile configurations; 2D sandpiles connect to logarithmic CFT.

Shared skeletonnot Pak–Stanley standard

Feynman graphs through spanning trees

Symanzik polynomials are sums over spanning trees/forests. Parking functions can label tree-like data, but they do not encode full Feynman rules by themselves.

Physics dictionary

How to read the math objects

HyperplaneA linear equation like xᵢ − xⱼ = 0. In physics it often appears as a collision locus, singular divisor, branch locus, or wall in parameter space.
Arrangement chamberA connected component after removing all hyperplanes. Think “sector”: a particle ordering, vacuum chamber, integration contour region, or wall-crossing domain.
Complement/cohomologyThe space where denominators do not vanish. Differential forms on this complement organize monodromy, periods, residues, and bases of integrals.
Master functionA multivalued potential-like function. Its critical points are Bethe-root-like data in several arrangement-based integrable systems.
G-parking functionA graph-dependent parking function. Equivalent viewpoints include chip-firing/sandpile data and labels closely tied to spanning trees.
Cherednik algebraA noncommutative algebra built from a reflection group. It quantizes Calogero–Moser-type geometry and unexpectedly hosts parking-function representations.
Starting point

Pak–Stanley as the combinatorial portal

Shi chambers become parking labels

For the type-A Shi arrangement, Pak–Stanley labeling gives a bijection between regions and parking functions. For n = 3, the arrangement is drawn in a 2D slice of x₁ + x₂ + x₃ = 0. The sketch below uses the equivalent three-family line picture.

Shi(A₂): xᵢ − xⱼ = 0 or 1, for 1 ≤ i < j ≤ 3

Background: Stanley’s paper on hyperplane arrangements, parking functions, and tree inversions.[1]

One convention warning

Parking functions may be written 1-indexed, such as (1,1,3), or shifted to nonnegative labels, such as (0,0,2). Pak–Stanley labels in the arrangement literature often use the nonnegative convention.

A schematic A2 Shi arrangement Six lines in three parallel families divide the plane into chambers, with sample Pak-Stanley labels. x₁−x₂ = 0,1 x₂−x₃ = 0,1 x₁−x₃ = 0,1 000 100 010 001 cross a wall → add a unit Parking test sort aᵢ; require aᵢ ≤ i
This portal is combinatorial. The quantum-mechanical appearances below usually use the same hyperplane-arrangement geometry, but not necessarily the Pak–Stanley labeling itself.
Direct quantum mechanics

Calogero–Moser: hyperplanes as collision walls

Collision hyperplanes in the Calogero-Moser system Three particles on a line; in configuration space, the hyperplanes x_i=x_j form reflection walls. x₁ x₂ x₃ particles on a line x₁=x₂ x₂=x₃ x₁=x₃ type-A reflection arrangement
DirectHamiltonianreflection arrangements

The physical reading

For n particles on a line, the type-A hyperplanes xᵢ = xⱼ are collision loci. In the rational quantum Calogero–Moser Hamiltonian, those loci carry inverse-square singularities.

H = Σᵢ ∂²/∂xᵢ² − c(c+1) Σᵢ≠ⱼ 1/(xᵢ − xⱼ)²

This is one of the cleanest places where the same geometry as the braid arrangement becomes a quantum Hamiltonian. Rational Cherednik algebras package these reflection-arrangement/Dunkl-operator structures and connect them to Calogero–Moser spaces.[2]

For a physicist: the chambers are ordering sectors; the hyperplanes are singular scattering walls. “Quantization-like” behavior is not just analogy here—the arrangement sits inside the operator theory.
Integrable models

Varchenko: arrangement → Hamiltonians

A geometric machine for Bethe/Gaudin data

Varchenko’s construction assigns a quantum integrable model to a weighted affine hyperplane arrangement. Under stated assumptions, the Hamiltonian algebra is isomorphic to functions on the critical set of a master function; in a discriminantal case, this recovers the Gaudin Bethe algebra.[3]

weighted arrangement 𝒜 → master function Φ → Crit(Φ) → commuting Hamiltonians

The intuition is close to semiclassical/Bethe thinking: solve a quantum spectral problem by reducing it to critical point equations for auxiliary variables.

Flow from weighted arrangements to Bethe algebras A diagram showing a weighted affine arrangement feeding a master function, critical points, and a commuting Hamiltonian algebra. weighted affine arrangement Φ masterfunction Crit(Φ)Bethe roots Bethe algebraHamiltonians
CFT / monodromy

KZ equations: hyperplane complements and conformal blocks

KZ hypergeometric integral over a hyperplane complement Punctures on a sphere and integration variables avoid collision hyperplanes t=z_i and t_a=t_b. z₁ z₂ z₃ t t′ avoid t = zᵢ and t = t′ hyperplanes
DirectCFTmonodromy

The physics reading

In WZW/CFT language, KZ equations govern conformal blocks. Schechtman–Varchenko’s work uses hyperplane complements, local systems, Orlik–Solomon-style complexes, and generalized hypergeometric integrals to build solutions and Lie-algebra homology links.[4]

integration variables avoid divisors like tₐ = zᵢ and tₐ = t_b

This is where arrangements feel like “quantization data”: the important information is not just the equations H = 0, but the complement, monodromy around singular walls, and how differential forms transform.

Gauge theory

3d N=4: hyperplanes organize chambers and modules

Walls in parameter space

In abelian 3d 𝒩 = 4 gauge theories, hyperplane arrangements make certain Higgs/Coulomb branch and boundary-condition constructions explicit. In Omega backgrounds, boundary conditions define modules for quantized algebras of chiral Higgs- and Coulomb-branch operators.[5]

chambers ↔ boundary conditions / wall crossing / mirror-symmetric data

This is not elementary nonrelativistic QM, but it is a bona fide quantum-field-theoretic use of arrangements.

Hyperplanes in parameter space for 3d N=4 gauge theory FI and mass parameter space sliced by hyperplanes into chambers, with wall crossing and mirror symmetry annotation. mᵢ = 0mⱼ = 0 ζₐ = 0wall mixed wall chamber module mass/FI parameter space cut into chambers
QFT graphs

Feynman graphs: spanning trees and hyperplane geometry

A graph and its spanning-tree Symanzik polynomial A 3-vertex 4-edge graph has spanning trees; the first Symanzik polynomial sums products over edges not in each tree. graph G α₁α₂α₃α₄ First Symanzik / graph polynomial Ψ_G = Σ over spanning trees T multiply αₑ for e not in T T={1,2} → α₃α₄ T={1,3} → α₂α₄ T={1,4} → α₂α₃ T={2,3} → α₁α₄ T={2,4} → α₁α₃ Ψ = α₃α₄ + α₂α₄ + ...
Direct QFT graph combinatoricsparking-adjacent

What is already standard

After Feynman parametrization, scalar multi-loop integrals are characterized by the first and second Symanzik polynomials. A standard review emphasizes spanning trees, spanning forests, deletion–contraction, matrix-tree theorems, Dodgson identities, and matroids.[6]

Ψ_G(α) = Σ_{T spanning tree} ∏_{e∉T} α_e

Bloch–Esnault–Kreimer study graph hypersurfaces defined by these graph polynomials, with the first graph polynomial expressed as a spanning-tree sum.[7]

This is the safest bridge to parking functions: parking functions are tightly related to spanning trees, but the full physical Feynman diagram also needs fields, masses, momenta, numerators, symmetry factors, and regularization data.

Hyperplanes in modern cosmological-integral geometry

A newer amplitudes/cosmology line associates wavefunction coefficients and FRW integrals with hyperplane arrangements, twisted cohomology, bounded chambers, cuts, and graph tubings. This is a more literal “Feynman diagram ↔ hyperplane arrangement” appearance, but in cosmological correlator geometry rather than the default textbook QFT pipeline.[8]

Feynman-like graph to hyperplane arrangement and cuts A graph maps to linear divisors, which form hyperplanes with bounded chamber cuts. graph linear divisors / cuts
Parking functions in physics-adjacent models

Sandpiles: where parking functions feel physical

Graph parking functions and chip-firing

Postnikov–Shapiro construct graph algebras whose dimensions equal the number of spanning trees of G, with monomial bases indexed by G-parking functions; they also point to their natural appearance in the abelian sandpile model.[9]

G-parking functions ↔ spanning-tree count ↔ sandpile/chip-firing data

The abelian sandpile model is a statistical-physics model of self-organized criticality. In 2D, it is closely tied to logarithmic conformal field theory with central charge c = −2 in the literature.[10]

G-parking functions through sandpiles and spanning trees A graph with chips topples into a recurrent sandpile/spanning tree label and then a parking function. 2 0 3 sink chip configuration burning / tree a recurrent state can be related to tree data (0,1,2) G-parking label
This is the parking-function connection that feels most “physical,” but it is statistical/critical phenomena rather than ordinary Hilbert-space quantum mechanics.
Representation theory

Parking spaces meet Cherednik algebras

W-parking spaces and rational Cherednik algebras Coxeter reflection arrangement, root lattice torus, W-parking functions, and rational Cherednik algebra representation theory. reflection group W Q/(h+1)Q parking space W-module RCA link same reflection data as Calogero–Moser/Cherednik, but seen through combinatorial representations
Indirect but realrepresentation theoryCherednik

The algebraic bridge

Armstrong–Reiner–Rhoades define W-parking functions using the finite torus Q/(h+1)Q for a Weyl group W, and explicitly connect parking spaces to enumerative combinatorics, diagonal harmonics, and rational Cherednik algebras.[11]

Dotsenko also constructs symmetric-group representations isomorphic to parking-function modules using lattice vertex operators, with conjectural links to Hilbert schemes and rational Cherednik algebras.[12]

This is a good place to say “parking functions are near quantization,” but the path is algebraic: representation categories, Hilbert schemes, and Cherednik algebras—not usually textbook energy eigenstates.
Takeaway

What to remember

ConnectionHow direct?Physics intuitionParking-function role
Calogero–Moser / Cherednik Very direct Hyperplanes are singular collision walls in a quantum Hamiltonian. Mostly via later Cherednik/Catalan representation theory.
Gaudin / Bethe via arrangements Very direct Critical points of arrangement master functions encode integrable spectral data. Not central.
KZ / WZW CFT Direct Hyperplane complements organize hypergeometric integrals and monodromy. Not central.
3d N=4 gauge theory Direct but specialized Arrangements cut mass/FI spaces into chambers; boundary conditions give modules for quantized algebras. Mostly separate.
Feynman graph polynomials Direct for graphs, indirect for parking Symanzik polynomials are graph-combinatorial objects built from trees/forests. Tree labels may be parking-function-like, but not a standard full diagram classifier.
Sandpile / LCFT Statistical-field-theory route Critical lattice model with CFT scaling behavior. G-parking functions naturally index chip-firing/spanning-tree data.

The concise answer to your original hunch

Hyperplanes really do behave like a quantization scaffold in several existing formalisms: they define singular walls, monodromy data, Bethe critical equations, chamber structures, and integration cycles.

The caution

Parking functions show up most robustly as discrete labels for tree/chip-firing/Cherednik representation data. That is physically meaningful, but one categorical layer removed from “state in a Hilbert space” or “Feynman diagram type.”

Sources

Bibliography behind the demo

Links are included so the HTML stays useful offline as a reading guide, even though opening the papers requires internet access.

Stanley, “Hyperplane Arrangements, Parking Functions and Tree Inversions.” Introduces/uses the extended Shi arrangement and Pak–Stanley-style labeling background. PDF

Etingof, lecture notes on Cherednik algebras / Calogero–Moser systems. Gives the rational quantum Calogero–Moser Hamiltonian with inverse-square terms along xᵢ − xⱼ = 0. PDF

Varchenko, “Quantum Integrable Model of an Arrangement of Hyperplanes,” SIGMA 2011. Assigns a quantum integrable model to a weighted affine arrangement and relates Hamiltonians to critical points/master functions and Gaudin Bethe algebras. SIGMA page

Schechtman–Varchenko, “Arrangements of hyperplanes and Lie algebra homology,” Inventiones Mathematicae 1991. Hyperplane complements, local systems, generalized hypergeometric integrals, and KZ-related material. EuDML page

Bullimore–Dimofte–Gaiotto–Hilburn, “Boundaries, Mirror Symmetry, and Symplectic Duality in 3d N=4 Gauge Theory,” JHEP 2016. Abelian theories use hyperplane arrangements; Omega-deformed boundary conditions define modules for quantized Higgs/Coulomb operator algebras. arXiv

Bogner–Weinzierl, “Feynman graph polynomials,” 2010. Review of Symanzik polynomials, spanning trees/forests, matrix-tree theorem, deletion–contraction, Dodgson identities, and matroids. arXiv

Bloch–Esnault–Kreimer, “On motives associated to graph polynomials.” Studies graph hypersurfaces and gives the first graph polynomial as a spanning-tree sum. PDF

Recent cosmological correlator / hyperplane arrangement work. Example: “A physical basis for cosmological correlators from cuts” and related kinematic-flow papers use associated hyperplane arrangements, twisted cohomology, bounded chambers, cuts, and graph tubings. PDF

Postnikov–Shapiro, “Trees, parking functions, syzygies, and deformations of monomial ideals.” Constructs graph algebras with bases indexed by G-parking functions and dimensions equal to spanning-tree counts; discusses sandpile links. arXiv

Piroux–Ruelle, “Pre-logarithmic and logarithmic fields in a sandpile model.” Relates the 2D abelian sandpile model to boundary logarithmic CFT with central charge c = −2. arXiv

Armstrong–Reiner–Rhoades, “Parking Spaces.” Defines W-parking functions/parking spaces and notes connections to diagonal harmonics and rational Cherednik algebras. arXiv

Dotsenko, “Parking functions and vertex operators.” Constructs parking-function modules using lattice vertex operators and discusses conjectural links to Hilbert schemes and rational Cherednik algebras. arXiv

Filter applied.