WorksPhysics and Astronomy
Free fermions from integer arithmetic: a Galois-theoretic test for free-fermionic spectra
Abstract
The spectrum of a free-fermionic operator is built from a few single-particle quantities. For operators with rational entries this confines, as is known, the Galois group of the characteristic polynomial of each sector to a hyperoctahedral group, up to elementary abelian -groups. We turn this into a test for free-fermionic spectra that uses only integer arithmetic: Frobenius cycle types modulo primes can prove that a spectrum is not free-fermionic, and an exact recovery of the single-particle data, certified by power sums, confirms it when it is. As a worked example, the test recovers Onsager's dispersion relation from the characteristic polynomial of the Ising transfer matrix. As applications, we prove that the periodic Fendley chain with generic couplings admits no free-fermion solution of the Chapman–Elman–Mann form for a range of sizes, bearing on whether a simplicial clique is necessary for free-fermion solvability, and we detect hidden tensor-product and matchgate structure in any basis. The Galois group grades spectral structure: hyperoctahedral for free fermions, symmetric on subsets with particle-number conservation, apparently imprimitive for the partially decoupled Bethe equations of the exclusion process, and alternating within sectors for the interacting models tested.
Introduction
A free-fermionic model is exactly solvable because its many-body spectrum is built from a few single-particle energies. For the two-dimensional Ising model this is the content of Kaufman’s spinor solution [36] of Onsager’s model [46]: every eigenvalue of the row transfer matrix on a ring of sites has the form
with a fixed parity of in each spin-flip sector. The same structure governs matchgate circuits, which are classically simulable for this reason [57, 56, 31], and Hamiltonians that are free only after a nonlocal change of variables, the free fermions in disguise of Fendley [16], characterized graph-theoretically by Chapman, Flammia, Elman, and Mann [10, 12, 9].
Arranged by , the spectrum (1) is the rank-one tensor , , a point of the Segre variety , and its eigenvalues satisfy whenever . For an operator with rational entries every automorphism of preserves these relations, so the Galois group of the characteristic polynomial is confined to the symmetries of the hypercube: for the square of the transfer matrix in a spin-flip sector it is a subgroup of the hyperoctahedral group , of order , and for the transfer matrix itself, whose eigenvalues involve the half-angles and a possibly irrational , an extension of such a subgroup by an elementary abelian 2-group (Proposition 2.4); a generic matrix of size has the symmetric group . This confinement is a special case of a theorem of Jouve, Kowalski, and Zywina [30]: for an element of a reductive group, the Galois group of the characteristic polynomial of lies in the Weyl group extended by the Galois action on characters, and acts through the weights of . Free fermions are the case of in its spin representation, whose weights are the sign vectors . With particle-number conservation the hidden group is acting on the -particle space , and its Weyl group acts on -element subsets.
This paper uses the confinement as a test that reads off the hidden group through its Weyl group, with free fermions as the main case. The Galois group of an integer polynomial is accessible through its factorizations modulo primes: by Chebotarev’s density theorem [53], the degrees of the irreducible factors modulo are cycle types of Frobenius elements, which equidistribute in the group. A cycle length incompatible with the allowed group orders, or a certificate that the group contains an alternating group with and , rules out free-fermionic structure. The test needs no fermionic representation, works in any basis, and costs a few factorizations of integer polynomials. It concerns the spectrum only: it detects free-fermionic spectral structure, not fermionic dynamics, and operators whose spectra are trivially of free form, such as commuting stabilizer Hamiltonians, pass it.
Results
Section 2 proves the hyperoctahedral lemma and derives rigorous criteria for non-freeness: for transfer matrices and their squares, for complex and orthogonal operators, for number-conserving free fermions and free parafermions, and for Pauli Hamiltonians with symmetry sectors. Section 3 gives a three-step procedure (screen, recover, certify) and works it out for the Ising transfer matrix, recovering Onsager’s dispersion relation from the integer characteristic polynomial and certifying the Kaufman form exactly for strips of width 3 to 7. Section 4 contains the applications. The first concerns claw-free frustration graphs without a simplicial clique, which lie outside the free-fermion solutions of Chapman, Elman, and Mann [9]: we prove that for generic couplings the periodic Fendley chain and further cycle powers admit no free-fermion solution of their form at a range of sizes (Theorem 4.1), and we certify 23 graphs on at most 9 vertices, 176 on 10, and 29 on 11. This complements exact free solutions reported for other graphs of this kind, including the periodic Fendley chain on 8 and 9 sites [2]. The second recovers hidden group structure, tensor factors and free-fermion modes, from the multiplicative relations among eigenvalues. The third concerns quantum circuits (§ 4.3). Section 5 shows how the Galois group grades spectral structure: interacting integrable models have alternating groups inside their symmetry sectors, in agreement with recent work on Bethe equations [6, 40], while the totally asymmetric exclusion process, whose Bethe equations partially decouple, appears to have imprimitive groups of intermediate size. Appendix A validates the test on free-fermion models from the literature: in every family the points flagged free are known free-fermion points or have roots-of-unity spectra, except for three-dimensional Ising bars with a Clifford background, which Appendix A explains through the Lie algebra of a Pauli orbit. At one of these points the hidden group is symplectic, which the Galois group cannot distinguish from free fermions; Table 6 summarizes the families. Appendix § 8 recovers the single-particle spectra of further known models (Table 7), and § 6 lists open questions.
| setting | flagged free | known free or roots-of-unity points |
| Ising strips, real and imaginary fields | zero field; | planar zero field [46, 36]; |
| eight-vertex | Fan–Wu [14] | |
| crossing and four-spin couplings | (2) | Fan–Wu via the vertex map |
| three-dimensional Ising | Wang–Hazzard locus | [58] |
| braid representations | Alexander; Jones at | free [35]; roots of unity [20] |
| circuits | matchgates | [57, 31] |
| number-conserving chains | on subsets | tight-binding chains |
Table 6. Points flagged free in the main families tested; further models are in Table 5 and the text. Points with roots-of-unity spectra pass the screen without being free-fermionic in any useful sense; the bars with a Clifford background and generic bonds of Appendix A are explained there by the Lie algebra of a Pauli orbit, and one of them is symplectic, not free.
| model | recovered | agreement with the literature | certificate |
| dimers, strip width | , exact [33, 55, 41] | exact | |
| transverse-field Ising chain, open, | exact [42, 47] | exact | |
| XY chain, open, | exact [42] | exact | |
| Kitaev honeycomb, flux-free sector | [38] | numerical | |
| chain in disguise, | exact [16] | exact | |
| free parafermions, , | exact [15] | exact | |
| Fendley–Pozsgay chains, | exact [17] | none | |
| Ising on the Möbius strip, | signed hypercube | numerical [43] | numerical |
Table 7. Recoveries of known single-particle spectra. “Exact” agreement means a rational identity between the recovered polynomial and the published one; an exact certificate means agreement of all power sums with the exact traces.
The arithmetic of spectra has been used before for particular models, for example the Galois action on the spectra of small Heisenberg rings [44] and integer factorization as a signature of Hilbert-space fragmentation [48]. The use of hyperoctahedral Galois groups as a test for free-fermionic structure, the certificates of non-freeness, and the three-step procedure appear to be new.
The hyperoctahedral lemma and certificates of non-freeness
Definition 2.1. Let . We say has free form of rank if there are , a squarefree reciprocal polynomial of degree with roots , none equal to , and a set of sign vectors, either all of or its even-parity half, such that
The arguments below use only the splitting field of . For uniform couplings need not be squarefree ( below), and is then not literally of free form of lower rank; but is the splitting field of the squarefree part of with the factors removed, so parts (1) and (2) of Lemma 2.2 and Corollary 2.3 hold with the rank of that part. For the Ising transfer matrix , is the characteristic polynomial of on a spin-flip sector, is the characteristic polynomial of the single-particle matrix, and [36]. For a free-fermion Hamiltonian the form is additive, , and the arguments below apply with sums in place of products.
Let act on by , and let be the subgroup with .
Lemma 2.2. Let have free form of rank (Definition 2.1), with the roots , , pairwise distinct, and let be the splitting field of . Then:
(1) the splitting field of is contained in , so is a quotient of ;
(2) embeds in via ;
(3) acts on the roots of through sign vectors: ;
(4) if is the even half and no with even equals with odd, the image lies in .
In particular every cycle of a Frobenius element at a prime of good reduction has length at most the largest order of an element of ; if , or under the hypothesis of (4), its cycle type is that of an element of , respectively , acting on $S.
Proof. Each is a monomial in the roots of , which gives (1). An automorphism permutes the roots of and commutes with , so it permutes the pairs , which are distinct because is squarefree with no root . Recording the permutation of the pairs and whether goes to or to its inverse gives an injective homomorphism into , which is (2). Then , which is (3). For (4), maps roots of to roots of , and changes the parity of by . □
Lemma 2.2 is the elementary core of a general statement. For a reductive group over with a faithful representation , Jouve, Kowalski, and Zywina show that the Galois group of the splitting field of is a subquotient of the group generated by the Weyl group and the Galois action on the characters of a maximal torus, that the eigenvalues are the values of the weights of at , and that Galois acts through its action on the weights [30 Prop. 2.1, Lemma 2.4]; random elements attain the whole group [30 Thm. 1.1] (see also [24]). For in the spin representation this gives Lemma 2.2. Galois groups and multiplicative relations among eigenvalues are related in [39, 52].
Corollary 2.3 (non-freeness certificate). If an irreducible factor of of degree has Galois group containing and , then divides no polynomial of free form of rank at most $L.
Proof. Parts (1) and (2) of Lemma 2.2 do not use that the are distinct: the splitting field of every divisor of a polynomial of free form of rank lies in , so the Galois group of every factor is a quotient of a subgroup of . Since the factor is irreducible of degree , its Galois group is a subgroup of ; containing , it is or , and for it has the simple group as a composition factor, so is a composition factor of a subgroup of . A subgroup has the abelian normal subgroup with quotient in , so is a composition factor of a subgroup of , and . This forces . □
The same argument applies to every bound below: in each case the nonabelian composition factors of the relevant Galois group are those of subgroups of (of or in Proposition 2.9), so the order bounds stated there are only needed for element orders, and an alternating group , , is excluded as soon as (respectively and ). In each application the rank is fixed in advance by the size of the system: for a transfer matrix on sites, or a circuit on qubits, it is , the number of Majorana pairs, and for a Hamiltonian it is the number of modes; certificates exclude free form of this rank. The bounds below apply in the same way to sectors and factors: they constrain every polynomial whose roots are of the given form, not only the full characteristic polynomial. The operator itself, not its square, is usually given, and its entries may be complex.
Proposition 2.4. Suppose every eigenvalue of a rational matrix is of the form for some , with and the roots of a rational reciprocal polynomial of degree . Then all eigenvalues lie in a Galois extension of of degree at most , in whose Galois group every element has order dividing for the order of some element of . If instead the matrix is the realification of a matrix over whose eigenvalues have this form with and the roots of a reciprocal polynomial over , then all eigenvalues lie in a Galois extension of of degree at most in whose Galois group every element has order dividing for the orders of some elements of . Consequently a factor of degree with Galois group containing and , or a Frobenius cycle whose length divides no such (respectively no such ), for instance, for a single set, a cycle longer than in the first case, proves that the eigenvalues are not all of this form.
Proof. Let be the splitting field of the reciprocal polynomial, of degree at most . The set is Galois stable, so is Galois over of degree at most , and the kernel of its Galois group over is an elementary abelian -group; if the image of has order , then . In the second case the same construction over gives a Galois extension of of degree at most containing the eigenvalues of the complex matrix. The eigenvalues of its realification are these and their complex conjugates, which lie in , a Galois extension of of degree at most . The group embeds in , so its elements have orders dividing , and every element of has its square in this subgroup. In both cases the nonabelian composition factors are those of subgroups of , and with is one only if , as in Corollary 2.3. □
Remark 2.5 (two sectors). Suppose the eigenvalues form two sets as in Proposition 2.4, each with its own rational data and (respectively over ), as for the two parity sectors of a transfer matrix, with no assumption that the sectors are defined over . The argument of the proof, applied to the compositum of the two fields, gives element orders dividing , respectively , for orders of elements of , and the composition-factor criterion is unchanged. Every cycle-length certificate in this paper also satisfies this stronger condition.
Remark 2.6 (orthogonal operators). If with real orthogonal and , then after removal of the factor (of the factors if ) the characteristic polynomial is , and the Galois group of is imprimitive with blocks , so it never contains . Proposition 2.4 applies instead to the half-degree polynomial , whose splitting field lies in that of : a factor of of degree containing with certifies non-freeness.
Proposition 2.7 (number-conserving free fermions). Suppose every eigenvalue of a rational matrix is for an -element subset of , where the are the distinct roots of a rational polynomial of degree . Then the Galois group of the characteristic polynomial is a quotient of . If the eigenvalues are the for all and are pairwise distinct, it acts on them through the action of on -element subsets.
Proof. Each lies in the splitting field of . An automorphism permutes the roots of by a permutation , and . □
This is the case of acting on in [30 Lemma 2.4], whose Weyl group is . As in Corollary 2.3, a factor of degree whose Galois group contains with excludes this form; § 5 confirms the action on subsets for tight-binding chains.
Remark 2.8 (free parafermions). For free parafermions with symmetry [15] the energies are , , . If and the are the roots of a polynomial of degree over , then, as in Proposition 2.4, every energy lies in the field generated over by the cube roots of the roots of this polynomial and of its complex conjugate, a Galois extension of of degree at most whose nonabelian composition factors are those of subgroups of ; a factor of degree whose Galois group contains with excludes this form.
Pauli Hamiltonians
Let be a sum of Pauli strings with frustration graph (an edge between anticommuting strings). In the free-fermion solutions of Chapman, Elman, and Mann [9 Sec. I.A, Result 1], each symmetry sector, a joint eigenspace of commuting conserved charges, carries an additive free spectrum with modes, the independence number of . Every Pauli realization of is a representation of the twisted group algebra of ; its irreducible modules, which we call central sectors, are labeled by the eigenvalues of central Pauli products, are defined over , and have dimension with the rank of the anticommutation form. For rational couplings the restriction of to a central sector is a Hermitian matrix over , so its characteristic polynomial lies in . We say that a central sector has the Chapman–Elman–Mann form if it is the direct sum of the joint eigenspaces of commuting operators with entries in that lie in the algebra generated by the terms of and commute with , as the conserved charges of [9] do, and if on each the spectrum is the multiset of the numbers , with no constant term, over all or over a parity half, each counted at least once, where are the roots of a polynomial whose coefficients lie in the field generated over by the eigenvalues labeling . Allowing parity halves only weakens the criterion below; each has at least states.
Proposition 2.9. Suppose a central sector of dimension has the Chapman–Elman–Mann form. If a factor of degree of its characteristic polynomial, in or in , has Galois group containing , then or . If is even, the set of eigenvalues of the sector is symmetric under .
Proof. Work over . The Galois group of the factor over is a subgroup of index at most of its group over , so it still contains , and the factor remains irreducible over . Let be an eigenvalue in the subspace such that or is a root of the factor, let be the field generated over by the labels of , and let . An automorphism of over fixes the central sector and maps to the joint eigenspace with the conjugate labels; the embeddings of give distinct joint eigenspaces, each of dimension at least , so . The splitting field over of the polynomial with roots contains and , and as in Lemma 2.2 its Galois group is isomorphic to a subgroup of . (Repeated or vanishing only shrink this group.) Its Galois closure over is the compositum of its images under the embeddings of , where denotes the splitting field. The group permutes the embeddings by composition, with image in ; its kernel fixes every pointwise, so it maps each , which is Galois over , into itself, and embeds in . The Galois group of the factor over is a quotient of and contains the simple group , so is a composition factor of or of a subgroup of , hence of a subgroup of or of . As in Corollary 2.3, or . For even the map preserves parity, so the set of eigenvalues on each , and hence on the sector, is symmetric. □
We therefore certify non-freeness of the Chapman–Elman–Mann form when
or, for even , when the set of eigenvalues of a central sector is not symmetric under , that is, when its squarefree part does not satisfy .
Certifying alternating groups
A primitive permutation group of degree containing a cycle of prime length contains , by a theorem of Jordan [11 Thm. 3.3E]. A transitive group containing a -cycle with is primitive. Indeed, permutes the blocks of a block system in orbits of size or . A block fixed by that contains a point moved by contains all such points, so it has more than points and is everything; otherwise the moved points lie in at least distinct blocks, which are then singletons. A Frobenius element with a single cycle of prime length , , and all other cycle lengths prime to has a power that is a -cycle, so its observation certifies in the Galois group of an irreducible factor of degree . The range contains a prime only for ; smaller factors are certified only through cycle lengths.
Screen, recover, certify
Let be a square integer matrix and its characteristic polynomial, restricted to a symmetry sector when one is known.
Screen. Remove zero roots and repeated factors, replace by when all exponents are divisible by , and factor over . For each factor of degree at least , factor modulo to primes of good reduction, record the cycle types, and test the cycle lengths and Jordan’s criterion. If a criterion of Section 2 applies, stop: the spectrum is not free-fermionic, with proof. Otherwise the point is a free candidate.
Recover. Compute the roots to high precision. Within a sector, the ratios for differing in two positions are the most frequent nontrivial ratios, of the form ; for the ratios for one position are more frequent still and give the directly. Choosing consistently among them, , and the remaining are peeled off one at a time. Accept the labeling only if it regenerates the whole spectrum, then recognize the coefficients of and as rationals.
(3) Certify. Compare exact power sums. For , , where is the companion matrix of the polynomial with roots and is the Chebyshev polynomial. For the even half,
with the Chebyshev polynomial of the second kind; the sign of is fixed by the case . Equality with the exact traces for gives exactly, by Newton’s identities.
A certificate in step 1 proves that the spectrum at a given rational point is not of free form; steps 2 and 3, when they succeed, prove that it is. If neither applies, the procedure is inconclusive at that point. Step 1 alone has false positives: rational or cyclotomic spectra (finite-order and Clifford operators), accidental factorizations at special points, and sectors too small for any group to be excluded. Commuting stabilizer Hamiltonians such as the toric code [37] have integer spectra that are sums of independent signed couplings with parity constraints, and are therefore trivially of free form: the procedure concerns free-fermionic structure of the spectrum, not whether the dynamics is that of nontrivially coupled fermions. Step 2 is unambiguous for a simple spectrum; with repeated pairs, as for the uniform couplings of § 3.1, ratios coincide, the labeling is accepted only if it regenerates the spectrum, and step 3 certifies the result. Free form for generic parameters means free form over the function field of the parameters , with all data, , , and the operators defining sectors, in or ; since for algebraically independent values , it is equivalent to free form at any such values, with data in . If a family has free form for generic parameters, then at a rational parameter point the Galois group of each factor is a quotient of a subgroup of the generic Galois group (of a decomposition group at a prime of the integral closure above the maximal ideal of the point), and every bound above passes to such subquotients, since it bounds a composition factor or the order of an element [7 Ch. V, §2, Thm. 2]. Symmetry of the set of eigenvalues under also passes to specializations, since the eigenvalues at the point are the specializations of the generic ones. A certificate at one rational point therefore excludes free form for generic parameters.
Worked example: the Ising transfer matrix
Take the zero-field Ising model on a ring of sites with bond weight for an integer , so that and the row transfer matrix has integer entries. The global spin flip commutes with ; in the basis of configurations with , the sector matrices are integer matrices of size .
Recovery. Step 2, applied to the roots of the sector polynomials at 1200 bits, returns for and
with in the flip-even sector and in the flip-odd sector, and . For the recovered single-particle polynomials agree exactly with , with the upper sign in the flip-even sector; for in the flip-even sector the polynomial in is
For the labeling of the flip-odd sector is ambiguous: preserves the multiset of sums over even , a reflection of triality for . The result is Onsager’s dispersion relation, with [46, 36], obtained without a fermionic or spinor construction. For a disordered and frustrated strip (, couplings random in sign and size across the row and constant along it), the single-particle polynomial in of each sector is an irreducible rational sextic; the two sextics differ only in their constant terms, and the Galois group of each is , so the Galois group of each sector polynomial lies in .
Certificates. For and , step 3 certifies in both sectors
with , , antiperiodic momenta in the flip-even sector and periodic momenta in the flip-odd sector. All products over momenta are determinants of Chebyshev polynomials in the companion matrix of , upper sign in the flip-even sector, so no algebraic numbers appear. The quantity is rational: with one has (for and ), and is a square; for and , and in the two sectors. For the matrix is similar to a positive definite matrix, so its spectrum is determined by that of . Since the spectrum of determines for all and is symmetric in and on the torus, these certificates give the exact partition function of every torus with at these couplings, and for its restriction to each boundary sector in the direction of length . A proof valid for all requires an identity uniform in , supplied in the known proofs by the spinor representation [36] or a determinant formula for the partition function.
Applications
Claw-free frustration graphs without a simplicial clique
Chapman and Flammia, and Elman, Chapman, and Flammia, showed that claw-free frustration graphs satisfying further conditions give free-fermion solutions [10, 12]. Chapman, Elman, and Mann proved that a claw-free graph with a simplicial clique, a clique such that for every the neighborhood of induces a clique in , admits a free-fermion solution, with energies given by the roots of independence polynomials [9 Sec. I.A, Result 1]; whether the simplicial clique is necessary is open [9 Sec. IX] (see also [50]). The spectrum depends on the realization only through the central sector [9 Sec. VIII], so the central sectors of the realization with one qubit per vertex cover all realizations. Graphs that become simplicial after twin collapse are free [49] and are excluded. Exact free solutions of the Chapman–Elman–Mann form for 107 graphs outside these classes, among them and , are reported in [2].
Small graphs. There are 14, 50, 191, 881, 4944 connected claw-free graphs on 5, . . . , 9 vertices, of which 0, 0, 2, 13, 186 have no simplicial clique; all of these contain even holes, and 173 remain after twin collapse. Each was tested in every central sector for three random choices of integer couplings with Proposition 2.9 (Table 1). No control with a simplicial clique was ever certified, and none of the 106 graphs of [2] with exact free certificates that lie in our sets on at most 10 vertices is certified. Among the extensions by one vertex of the undecided graphs on 9 vertices, 176 of the 2624 graphs on 10 vertices are certified, 799 have a factor containing to which Proposition 2.9 does not apply, 192 are consistent with free form, and 1457 give the test no power; in a sample of 800 graphs on 11 vertices with , 29 are certified, 582 are consistent, and 189 give the test no power. Here a graph is consistent if some factor has degree with and , so that Proposition 2.9 could apply, but no certificate is found; otherwise the test has no power beyond the symmetry test for even , which these graphs pass.
The classes are assigned in the order certified, uncertified, consistent, no power. A graph counts as certified if some choice of couplings certifies it; of the 192 consistent graphs, 190 are consistent at all three choices. Numerically, none of the 190 graphs on 10 vertices consistent at all three choices, nor 120 sampled on 11, has a sector spectrum that is a full additive hypercube or a union of two full 3-mode hypercubes; the free forms not excluded for them involve parity halves, which at these sizes impose almost no constraint.
| class | graphs | certified | , uncertified | consistent | no power |
| no simplicial clique, | 1 | 1 | 0 | 0 | 0 |
| no simplicial clique, | 9 | 2 | 3 | 0 | 4 |
| no simplicial clique, | 163 | 20 | 48 | 6 | 89 |
| simplicial clique (controls) | 30 | 0 | 0 | 5 | 25 |
| simplicial after twin collapse (controls) | 28 | 0 | 0 | 0 | 28 |
| with a claw (controls) | 20 | 13 | 0 | 0 | 7 |
Table 1. Claw-free frustration graphs without a simplicial clique, , and controls. “, uncertified”: some factor has Galois group containing , but fails, so Proposition 2.9 does not apply. “Consistent” and “no power” are defined in the text.
Cycle powers. The square of the cycle is the frustration graph of Fendley’s chain [16] with periodic boundary conditions, whose spectrum Zheng, Pozsgay, and Chen obtain from functional relations of a commuting family of transfer matrices, with free, nested free, or interacting spectra depending on the couplings [60] (see also [21]). Cycle powers are claw-free for every . For each of three random choices of integer couplings, every central sector is certified by Proposition 2.9: by a factor whose Galois group contains the alternating group (for , of degree 128), or, for with , by the asymmetry of the spectrum. By the remark on specialization in § 3, this proves the following.
Theorem 4.1. For generic couplings, in particular for algebraically independent couplings, no Pauli realization of the frustration graph of the periodic Fendley chain has a free-fermion solution of the Chapman–Elman–Mann form for and ; the same holds for with and for with .
For with the sector spectra are degenerate and small, and the test has no power; for exact free solutions are reported in [2], which also finds numerically that and have none.
The undecided graphs are mostly those with . For them, if the spectrum is symmetric under , the factors of the polynomial in have degree at most , and a factor in is either even, so imprimitive, or paired with its reflection, so of degree at most . Then either fails or cannot occur, and deciding them requires a test of free form that is not vacuous on parity halves.
Hidden group structure from multiplicative relations
Galois automorphisms preserve every multiplicative relation among eigenvalues [39, 52]. The relation lattice and the configuration of weights it induces identify the algebraic group in which an operator lives: a hypercube or half-cube for free fermions, a grid for a tensor product , a cross-polytope for a generic orthogonal or symplectic matrix, and no relations for a generic matrix. We compute the relations by lattice reduction on the logarithms of the eigenvalues at 2000 to 4000 bits, keep relations with residual at most at a precision of bits (every accepted relation has residual at most ), and identify the configuration against a library of these shapes; the relations are verified numerically, not exactly. Table 2 shows that the factor structure is recovered from the characteristic polynomial alone, also after conjugation by a random unimodular matrix: the number of free-fermion modes, the sizes of hidden tensor factors, and mixtures of the two. Spectral methods cannot distinguish free fermions from a product of independent qubits, which give the same cube.
| operator | expected rank | found | configuration |
| : , , , , | grids (cube) | ||
| generic, size | full | full | no relations |
| Ising, zero field, | half-cube | ||
| Ising, real field, | no relations | ||
| matchgate circuits, | modes | cube, | |
| XXZ, eight-vertex (integrable), | full | full | no relations |
| Ising () generic | simplex half-cube |
Table 2. Rank of the multiplicative group generated by the distinct eigenvalues and the recovered configuration. For a tensor product of factors of sizes the expected rank is ; “full” means equal to the number of distinct eigenvalues. Circuit matrices are integer multiples of rational orthogonal matrices, and the scale adds one to the rank; for odd , matchgate circuits have a zero mode that lowers it by one. The Ising entries use random couplings.
Quantum circuits
Circuits of real orthogonal two-qubit gates with rational entries (rational points on the circle) have rational unitaries. Matchgates , acting as on and as on with , on nearest-neighbor qubits generate free-fermionic circuits [57, 56, 31]. On 5, 6, and 7 qubits, brickworks of matchgates are free, with longest cycles 4, 12, 12, also after conjugation by random local rotations or, on 5 and 6 qubits, by a random rational orthogonal matrix of full size, since the test depends only on the spectrum; so are next-nearest-neighbor matchgates routed through fermionic swaps and Floquet matchgate circuits. The screen flags 25 circuits: on each of 5, 6, and 7 qubits, brickworks of generic gates (longest cycles 30, 62, 126), a single generic gate repeated as a Floquet circuit, and matchgate circuits with one generic gate, with one SWAP, with next-nearest-neighbor matchgates without fermionic swaps, with gates having , with a single-qubit kick, or with alternate layers conjugated by a generic single-qubit rotation; and matchgates on the edges of a grid. By Remark 2.6 all 25 are certified not free: each has a factor of the half-degree polynomial whose Galois group contains with . For periodic brickworks at even , each parity sector is free with its own modes, as for the Ising sectors of § 3.1, and a hypercube labeling of each sector is recovered. Clifford-type circuits have roots-of-unity spectra and pass the screen; their spectra are highly degenerate, which is why step 1 alone is not a proof of freeness.
What the Galois group sees
The Galois groups of sector factors grade the algebraic structure of a spectrum (Table 3). The bounds in the first two rows are Lemma 2.2 and Proposition 2.7, and equality with the full group is observed through Frobenius statistics; the last row is certified in every case listed; the third is observed.
| spectral structure | Galois group of a sector factor | examples |
| free fermions | in or | Ising strips, matchgate circuits, Fendley’s chains |
| free fermions, particle number conserved | in on -element subsets | tight-binding chains, Alexander braid representations |
| partially decoupled Bethe equations | imprimitive (observed), blocks over real cyclotomic fields | totally asymmetric exclusion |
| interacting, integrable or not | contains | XXZ, eight-vertex, symmetric exclusion, , Baxter–Wu |
Table 3. Galois groups of factors of sector polynomials.
Number conservation. For tight-binding chains with random integer hoppings and on-site energies, with , , and , the -particle sector polynomial is irreducible of degree , the longest Frobenius cycle equals Landau’s function , and over 1500 primes the frequencies of cycle types agree with the class distribution of acting on -element subsets within total variation 0.034, 0.057, 0.045, with no Frobenius element outside the group. The Alexander braid representations of Appendix A show the same signature.
Interacting integrable models. Integrable models that are not free behave like generic ones inside their symmetry sectors (Table 4). In inhomogeneous eight-vertex models whose columns share Baxter’s invariants and , so that the transfer matrices commute [13], and in the six-vertex model, the sector factors have Galois groups containing alternating groups of full degree, while free-fermion columns, [14], give small groups.
| columns | factor degrees | largest factor |
| free fermion, all different | (), () | longest cycle 4 |
| integrable, fixed | 12 or 16 | contains , |
| six-vertex, fixed | 1, 6, 10, 15 | contains |
| generic | 16 () | contains |
Table 4. Inhomogeneous eight-vertex transfer matrices, , 200 primes per factor, with, in the integrable rows, and, except in the six-vertex row (), away from the degenerate values , , . Containment of , , certifies non-freeness by Proposition 2.4, since .
The lattice supersymmetric model [45, 18], whose chain is equivalent to the XXZ chain at , shows its supersymmetry exactly in the characteristic polynomial: every nonzero factor of the sector with fermions divides the polynomial of a sector with fermions, and the weighted count of zero modes equals the Witten index. Its sectors on chains, ladders, a triangular strip, a grid, and trees nevertheless contain alternating groups, for example and on an open chain of 12 sites. These results agree with the large Galois groups of Bethe equations for the Heisenberg chain [6] and with the theorem that the Galois group of the Bethe equations of the Gaudin model with one-box weights at all sites contains the alternating group whenever the target shape is neither a hook nor self-transpose [40 Thm. C]. The symmetric exclusion process on 14 sites with 7 particles gives , , and in the sector of momentum 0.
The totally asymmetric exclusion process. On a ring of sites with particles, the Bethe equations of this process decouple, given one collective parameter [26, 25], and its transition probabilities are determinants [51]; the generator has integer entries. Over the -particle sector splits into norms of momentum sectors, so we use the rational sectors of momentum 0 and . In every case examined these contain factors whose Galois groups contain alternating groups far above the free bounds, for example for , for , and for , which proves that no sector spectrum is of free form. Other factors are not alternating. For the sector of momentum 0 has a factor of degree 84 with no Jordan certificate over 600 primes, whose Frobenius cycle types are compatible only with 3 blocks of 28; among 400 further primes, at each of the 267 inert in every cycle length is divisible by 3, the pattern of a norm from . For factors of degree 90 and 30 are compatible only with 2 blocks and with norms from , at the 203 inert primes among 400. In both cases the block field is with . No blocks occur for , , , and , where and all large factors contain alternating groups, nor for , where the sector of momentum 0 has factors of degree 15, containing , and of degree 5. These block structures are observed, not proved. Golinelli and Mallick explain high-order degeneracies of the spectrum of this process by a hidden symmetry of its Bethe ansatz [22] (see also [23]); whether that symmetry accounts for these block structures is open.
Integrability organizes the spectrum into sectors and commuting families. Free fermions in addition make every eigenvalue a monomial in a few algebraic numbers, which confines the Galois group to a Weyl group; partial decoupling of Bethe equations appears to leave an intermediate, imprimitive trace; in the other interacting models tested no trace remains. The test is therefore a test for free-fermionic spectral structure, in any basis and in disguise, and not for integrability. Like any test through Weyl groups, it cannot distinguish types and , whose Weyl groups coincide: a symplectic hidden group, with eigenvalues of the form , can pass the screen. Appendix A gives an example, which the relation lattice of § 4.2 separates.
The analogy with zeros of -functions is close: there Frobenius elements equidistribute in a monodromy group whose type determines the random-matrix statistics [34]; here the Frobenius statistics of a single characteristic polynomial reflect its Galois group, and in the examples above, at random parameters, they are consistent with the full Weyl group of the hidden group: for free fermions and with particle-number conservation.
Outlook
The converse of Lemma 2.2 fails for individual matrices, since a matrix with rational eigenvalues has trivial Galois group. For families one may ask whether a Galois action at generic parameter points through a subgroup of acting on sign vectors, with each sector of size or , forces free form identically in the parameters. The symplectic example of Appendix shows that abstract embeddability of the Galois groups in does not suffice; whether its Galois action is of this finer form is not settled by our data. More generally the method reads off a hidden reductive group through its Weyl group and weights: for free fermions, with particle-number conservation, the reflection group for free parafermions with symmetry, and products of general linear groups for hidden tensor products. The imprimitive groups of the exclusion process suggest a finer invariant that measures partial decoupling of Bethe equations; proving the block structure of § 5 is open. The limiting factor is size: the screen has no power when all factors have small degree, which leaves part of § 4.1 undecided.
Appendix A. Validation on known models
Unless stated otherwise, couplings are integers drawn at random across the row and constant along the transfer direction, which removes translation symmetry. “Free” means that the screen finds no certificate under the criteria of § 2; “not free” means certified by Corollary 2.3, Proposition 2.4, Remark 2.6, or Remark 2.8. The maximal element orders are for .
Ising strips and fields
In zero field, with couplings random in sign and size so that plaquettes are frustrated, each sector polynomial is irreducible of degree , and the longest Frobenius cycle over 150 primes equals : 12 at and 24 at . Over 3000 primes the frequencies of cycle types agree with the class distribution of acting on the even sign vectors, of order (23040 at , 322560 at ), within total variation 0.02 to 0.034, with no Frobenius element outside the group. A real field makes the polynomial irreducible of degree , with a full -cycle; at its Galois group contains . At the imaginary field the polynomial satisfies and has the same hyperoctahedral image; at with the spectrum is not free. The Ising model on the Möbius strip and the Klein bottle [43] is free, as is a field on alternate sites; one non-planar chord per row gives at .
Eight-vertex models
Deforming free-fermion columns by , , the test is free exactly at and certifies non-freeness at the other 12 values; in a two-parameter deformation it is free exactly at the origin.
Crossing and four-spin couplings
For the square-lattice Ising model with nearest-neighbor couplings, crossing diagonal couplings , , and a four-spin coupling on each plaquette, the map of Ising models with two- and four-spin couplings to an eight-vertex model [32, 59] and the Fan–Wu condition [14] give, after the nearest-neighbor weights cancel, the free-fermion condition
We have not found condition (2) stated in this form in [32, 59, 14]. Without four-spin coupling it reduces to , that is, to for real couplings. On 15 integer points of (2), including sign weights (complex couplings), the test reports free; on 18 nearby points off it, it certifies non-freeness. On grids of 2744 points at zero field and at field (), the 2640 points off (2) in each grid are certified not free; the other 104 points are degenerate solutions of (2), with a diagonal coupling or the four-spin weight trivial or a pure sign, and are flagged free, so the nontrivial part of the locus is tested only on the 15 points above. With both diagonal couplings neither trivial nor a pure sign and no four-spin term, all 36 points of a random-column scan () are certified not free; all 189 such points with uniform couplings at are certified not free. These nulls are consistent with Barahona’s theorem that spin-glass problems become hard off planar lattices or in a field [3].
Three-dimensional models
The three-dimensional model of Wang and Hazzard [58] is solvable at imaginary couplings . With per-link random weights on its locus the test reports free (factors of degree 8, longest cycle , with 4 modes per flux sector); off the locus it certifies non-freeness, with a factor of degree 256 containing . Its bond graph is non-planar, but the bonds with non-Clifford weights form a perfect matching within each layer, and all three-dimensional connectivity runs through bonds and fields at . In a scan of Ising models on the non-planar bars with cross-sections , , prism, and , with real and Gaussian-integer couplings, all 563 points are certified not free, by alternating groups or by cycle lengths, such as 5, 7, or 9, that divide no element order allowed by Proposition 2.4, also with two sectors (Remark 2.5). With all couplings equal to the transfer matrix of the bars with cross-sections and prism is a Clifford operator, and is a scalar for some ; this is a point of the tractable set of [28]. Generic bonds give a transfer matrix with a product of exponentials of Pauli strings, so is a scalar times a product of exponentials of the Pauli strings in the orbit of those of under conjugation by . The Lie algebra generated by these strings is, by [1], a direct sum of free-fermionic, orthogonal, symplectic, or unitary algebras or of controlled versions of these (tensored with the group algebra of a group of commuting Pauli strings); lies in the corresponding complexified group, which determines the structure of the spectrum of , and hence that of up to -th roots of unity. With one generic bond per period, all 12 tests are flagged free, 6 of them with no factor of degree above 4; with two bonds, 4 of 12 are flagged free, 1 of them without power, and 8 are certified not free; with three or four bonds, all 24 are certified. The dimension of this Lie algebra separates the flagged from the certified points: at every certified point it is at least 240. At the flagged points it is abelian (7 points without power and 2 others), in each sector of the global spin flip (3 points), or tensored with the group algebra of a group of 32 commuting Pauli strings (3 points, one with further central elements), all free-fermionic, except at one point with two bonds, where it is in each sector of the global spin flip. There each sector of is the sum of four copies of the defining representation of , with eigenvalues , , which are not of free form. The Galois test cannot distinguish this case, since the Weyl groups of types and coincide, but the relation lattice of § 4.2, applied to the transfer matrix itself, finds on its two factors of degree 16 a cross-polytope, as for an orthogonal or symplectic matrix, not a cube.
Calibrations
Table 5 lists further models known to be free or not.
Table 5. Calibrations.
Table 5. Calibrations. For Hamiltonians the energies are additive and the bound is in the number of modes. Fendley’s chain has no Jordan–Wigner map to free fermions and its frustration graph contains no claw; the control with a longitudinal field has a claw [10, 12].
Further models
The three-spin model of Baxter and Wu [5], integrable and not free, is certified not free on uniform strips of widths 7 and 8 (cycles 102 and 66, divisible by the primes 17 and 11, which divide no allowed element order, and , ) and with random columns at widths 6 and 7 (, ). The Kitaev–Heisenberg model [8] on a ladder has four factors of degree 64 containing ; the pure Kitaev ladder has only factors of degree 4, where the test has no power. Among non-Hermitian chains, the transverse-field Ising chain with an imaginary transverse field (, realified) satisfies with longest cycles 12 and 24, consistent with free form, while the Ising chain with an imaginary longitudinal field gives and . A tight-binding chain with a quasiperiodic on-site potential of rational frequency (, ) has a factor of degree 126 with longest cycle and total variation 0.117 from on 4-element subsets over 300 primes; the chain of Su, Schrieffer, and Heeger [54] on 8 sites has factors too small for the test. For the toric code [37] on a torus with random couplings every factor is linear, and the spectrum is a constant plus the sums over two even half-cubes of the vertex and plaquette couplings.
Knot invariants and the Tutte plane
Braid-group representations on from the free-fermion six-vertex -matrix, which yields the Alexander–Conway polynomial [35], decompose into exterior powers of the reduced Burau matrix with factor degrees , and their Galois groups lie in (longest cycles 6 for ). Those from the -matrix (Jones polynomial) at rational contain () and () in all 16 long braid words tested. In the semisimple path representations at , all eigenvalues are roots of unity exactly for (and ), and not for ; rational never collapses. With Hecke parameter , these are points at which the Jones polynomial is computable in polynomial time [28], and for they are the orders at which the image of the braid group in the Jones representations is finite for every : it is infinite modulo its center for , , , and for , , while the finite images at (and , ) were identified earlier by Jones and others [20 Thm. 2.3 and Sec. 4]. For Potts transfer matrices on planar strips the test is free for , the Ising hyperbola of the Tutte plane, at widths , with longest cycles 12, 24, 30 equal to , and certifies non-freeness for .
Supersymmetric models and hard squares
For the hard-core lattice gas at activity , which governs the ground states of the model [27], the row transfer matrix of hard squares has only roots of unity as eigenvalues for every width and boundary condition tested (periodic widths 6 to 13, open widths 2, 5, 8, 11), as known [19, 29, 4]; at , , , , (periodic width 10) it does not, and the groups contain alternating groups. Hard hexagons, the honeycomb lattice, and the king’s graph at give alternating groups.
Appendix B. Recoveries of known single-particle spectra
Section 3.1 recovers Onsager’s dispersion relation; this appendix collects the corresponding recoveries for further free-fermion and free-parafermion models. In each case below, step 2 of the procedure (recovery of the hypercube labeling) was applied to the exact characteristic or minimal polynomial with no input from the known solution, and the recovered single-particle polynomial, recognized over (or over ), was then compared with the published formula. Where stated, step 3 certified the result exactly: the power sums of the free form, computed from the recovered polynomial alone, agree with the exact traces for every exponent up to the dimension, so the characteristic polynomial is the composed product. Transfer matrices use the multiplicative form; Hamiltonians use the additive form , for which the recovered object is .
Dimers. For the dimer transfer matrix on strips of width , the recovered numbers satisfy identically, the Chebyshev form of the solution of Kasteleyn, Temperley and Fisher in Lieb’s transfer-matrix formulation [33, 55, 41]; the certificate holds with for all .
Quantum chains. For open transverse-field Ising and XY chains with random integer couplings, the recovered polynomial is the characteristic polynomial of the Majorana single-particle matrix of Lieb, Schultz, and Mattis [42]; for uniform unit couplings, the critical chain with , it gives to 140 digits, as in Pfeuty’s solution [47].
Kitaev’s honeycomb model. On and tori, the flux-free sector reproduces the Majorana dispersion of [38] to , the four loop sectors corresponding to momentum shifts by , , , ; only the flux sector with all plaquette operators equal to has this form.
Free fermions in disguise. For the chain of [16] with sites, the recovered polynomial is with given by Fendley’s recursion, exactly, in every case, with exact certificates. Here no Jordan–Wigner transformation is available, and the single-particle data are obtained from integer arithmetic alone. The number of levels is , where is the number of terms, consistent with the example in [16].
Free fermions beyond Jordan–Wigner. The chains of Fendley and Pozsgay [17] have a frustration graph that contains claws, so the criterion of Chapman, Elman, and Mann does not apply to them directly. For (5 to 9 qubits) the screen has no power, since all factors have degree at most 4, but recovery gives modes and with as in [17 eq. (4.4)], exactly.
Free parafermions. For the three-state chain of [15], energies are sums with ; the recovered agrees exactly with Fendley’s polynomial, and the traces in certify the spectrum for all . For uniform couplings and , .
The Möbius strip. The transfer matrix composed with the site reflection has the same moduli hypercube as the open strip; its signs are reproduced to 140 digits by reflection parities of the modes, ordered by increasing , times the reordering sign . Since this labeling depends on the ordering of real numbers, it is not defined over , and the identification is numerical; compare [43].
References
References
- [1]G. Aguilar, S. Cichy, J. Eisert, and L. Bittel, Full classification of Pauli Lie algebras, preprint (2024), arXiv:2408.00081.arxiv.org/abs/2408.00081
- [2]Anonymous, Which frustration graphs give free fermions? A converse to the even-hole, claw-free theorem, and exact free sectors of the periodic Fendley chain, preprint, Zenodo (2026), doi:10.5281/zenodo.22994979.DOI
- [3]F. Barahona, On the computational complexity of Ising spin glass models, J. Phys. A 15 (1982), no. 10, 3241–3253, doi:10.1088/0305-4470/15/10/028.DOI
- [4]R. J. Baxter, Hard squares for z = −1, Ann. Comb. 15 (2011), no. 2, 185–195, doi:10.1007/s00026-011-0089-2.DOI
- [5]R. J. Baxter and F. Y. Wu, Exact solution of an Ising model with three-spin interactions on a triangular lattice, Phys. Rev. Lett. 31 (1973), 1294–1297, doi:10.1103/PhysRevLett.31.1294.DOI
- [6]O. R. Bellwood and W. J. Munro, Algebraic structure of finite-size Bethe solutions in the Heisenberg chain, preprint (2026), arXiv:2605.05589.arxiv.org/abs/2605.05589
- [7]N. Bourbaki, Commutative Algebra. Chapters 1–7, Elements of Mathematics, Springer, Berlin, 1989.
- [8]J. Chaloupka, G. Jackeli, and G. Khaliullin, Kitaev–Heisenberg model on a honeycomb lattice: possible exotic phases in iridium oxides A₂IrO₃, Phys. Rev. Lett. 105 (2010), 027204, doi:10.1103/PhysRevLett.105.027204.DOI
- [9]A. Chapman, S. J. Elman, and R. L. Mann, A unified graph-theoretic framework for free-fermion solvability, preprint (2023), arXiv:2305.15625.arxiv.org/abs/2305.15625
- [10]A. Chapman and S. T. Y. Chan, Characterization of solvable spin models via graph invariants, Quantum 4 (2020), 278, doi:10.22331/q-2020-06-04-278.DOI
- [11]J. D. Dixon and B. Mortimer, Permutation Groups, Graduate Texts in Mathematics, vol. 163, Springer, New York, 1996, doi:10.1007/978-1-4612-0731-3.
- [12]S. J. Elman, A. Chapman, and S. T. F. Chapman, Free fermions behind the disguise, Comm. Math. Phys. 388 (2021), no. 2, 969–1003, doi:10.1007/s00220-021-04220-w.DOI
- [13]K. Fabricius and B. M. McCoy, New developments in the eight vertex model, J. Stat. Phys. 111 (2003), no. 1–2, 323–337, doi:10.1023/A:1022213209641.DOI
- [14]C. Fan and F. Y. Wu, General lattice model of phase transitions, Phys. Rev. B 2 (1970), no. 3, 723–733, doi:10.1103/PhysRevB.2.723.DOI
- [15]P. Fendley, Free parafermions, J. Phys. A 47 (2014), no. 7, 075001, doi:10.1088/1751-8113/47/7/075001.DOI
- [16]P. Fendley, Free fermions in disguise, J. Phys. A 52 (2019), 335002, doi:10.1088/1751-8121/ab305d.DOI
- [17]P. Fendley and B. Pozsgay, Free fermions beyond Jordan and Wigner, SciPost Phys. 16 (2024), 102, doi:10.21468/SciPostPhys.16.4.102.DOI
- [18]P. Fendley, K. Schoutens, and J. de Boer, Lattice models with N = 2 supersymmetry, Phys. Rev. Lett. 90 (2003), 120402, doi:10.1103/PhysRevLett.90.120402.DOI
- [19]P. Fendley, K. Schoutens, and B. van Eerten, Hard squares with negative activity, J. Phys. A 38 (2005), no. 2, 315–322, doi:10.1088/0305-4470/38/2/002.DOI
- [20]M. H. Freedman, M. J. Larsen, and Z. Wang, The two-eigenvalue problem and density of Jones representation of braid groups, Comm. Math. Phys. 228 (2002), no. 1, 177–199, doi:10.1007/s002200200636.DOI
- [21]K. Fukai, B. Pozsgay, and I. Vona, Solving models with generalized free fermions II: path-product expansion and conserved charges, preprint (2026), arXiv:2605.31453.arxiv.org/abs/2605.31453
- [22]O. Golinelli and K. Mallick, Spectral degeneracies in the totally asymmetric exclusion process, J. Stat. Phys. 120 (2005), 779–798, doi:10.1007/s10955-005-6972-7.DOI
- [23]O. Golinelli and K. Mallick, The asymmetric simple exclusion process: an integrable model for non-equilibrium statistical mechanics, J. Phys. A 39 (2006), 12679–12705, doi:10.1088/0305-4470/39/41/S03.DOI
- [24]A. Gorodnik and A. Nevo, Splitting fields of elements in arithmetic groups, Math. Res. Lett. 18 (2011), no. 6, 1281–1288, doi:10.4310/MRL.2011.v18.n6.a16.DOI
- [25]L.-H. Gwa and H. Spohn, Bethe solution for the dynamical-scaling exponent of the noisy Burgers equation, Phys. Rev. A 46 (1992), 844–854, doi:10.1103/PhysRevA.46.844.DOI
- [26]L.-H. Gwa and H. Spohn, Six-vertex model, roughened surfaces, and an asymmetric spin Hamiltonian, Phys. Rev. Lett. 68 (1992), 725–728, doi:10.1103/PhysRevLett.68.725.DOI
- [27]L. Huijse and K. Schoutens, Supersymmetry, lattice fermions, independence complexes and cohomology theory, Adv. Theor. Math. Phys. 14 (2010), no. 2, 643–694, doi:10.4310/ATMP.2010.v14.n2.a8.DOI
- [28]F. Jaeger, D. L. Vertigan, and D. J. A. Welsh, On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc. 108 (1990), no. 1, 35–53, doi:10.1017/S0305004100068936.DOI
- [29]J. Jonsson, Hard squares with negative activity and rhombus tilings of the plane, Electron. J. Combin. 13 (2006), no. 1, R67, doi:10.37236/1093.
- [30]F. Jouve, E. Kowalski, and D. Zywina, Splitting fields of characteristic polynomials of random elements in arithmetic groups, Israel J. Math. 193 (2013), 263–307, doi:10.1007/s11856-012-0117-x.DOI
- [31]R. Jozsa and A. Miyake, Matchgates and classical simulation of quantum circuits, Proc. R. Soc. A 464 (2008), no. 2100, 3089–3106, doi:10.1098/rspa.2008.0189.DOI
- [32]L. P. Kadanoff and F. J. Wegner, Some critical properties of the eight-vertex model, Phys. Rev. B 4 (1971), no. 11, 3989–3993, doi:10.1103/PhysRevB.4.3989.DOI
- [33]P. W. Kasteleyn, The statistics of dimers on a lattice, Physica 27 (1961), no. 12, 1209–1225, doi:10.1016/0031-8914(61)90063-5.DOI
- [34]N. M. Katz and P. Sarnak, Zeroes of zeta functions and symmetry, Bull. Amer. Math. Soc. 36 (1999), no. 1, 1–26, doi:10.1090/S0273-0979-99-00766-1.DOI
- [35]L. H. Kauffman and H. Saleur, Free fermions and the Alexander–Conway polynomial, Comm. Math. Phys. 141 (1991), 293–327, doi:10.1007/BF02101508.
- [36]B. Kauffman, Crystal statistics. II. Partition function evaluated by spinor analysis, Phys. Rev. 76 (1949), 1232–1243, doi:10.1103/PhysRev.76.1232.DOI
- [37]A. Yu. Kitaev, Fault-tolerant quantum computation by anyons, Ann. Physics 303 (2003), 2–30, doi:10.1016/S0003-4916(02)00018-0.DOI
- [38]A. Kitaev, Anyons in an exactly solved model and beyond, Ann. Physics 321 (2006), no. 1, 2–111, doi:10.1016/j.aop.2005.10.005.DOI
- [39]E. Kowalski, The large sieve, monodromy, and zeta functions of algebraic curves, 2: independence of the zeros, Int. Math. Res. Not. IMRN 2008 (2008), rnn091, 57 pp., doi:10.1093/imrn/rnn091.DOI
- [40]S. Liao and L. Rybińkov, Maximal transitivity of the cactus group on standard Young tableaux, preprint (2025), arXiv:2506.16561.arxiv.org/abs/2506.16561
- [41]E. H. Lieb, Solution of the dimer problem by the transfer matrix method, J. Math. Phys. 8 (1967), no. 12, 2339–2341, doi:10.1063/1.1705163.DOI
- [42]E. Lieb, T. Schultz, and D. Mattis, Two soluble models of an antiferromagnetic chain, Ann. Physics 16 (1961), no. 3, 407–466, doi:10.1016/0003-4916(61)90115-4.DOI
- [43]W. T. Lu and F. Y. Wu, Ising model on nonorientable surfaces: exact solution for the Möbius strip and the Klein bottle, Phys. Rev. E 63 (2001), 026107, doi:10.1103/PhysRevE.63.026107.DOI
- [44]J. Milewski, G. Banaszak, T. Lulek, M. Labuz, and R. Stagraczyński, Galois actions on the eigenproblem of the Heisenberg heptagon, Open Syst. Inf. Dyn. 19 (2012), no. 2, 1250012, doi:10.1142/S1230161212500126.DOI
- [45]H. Nicolai, Supersymmetry and spin systems, J. Phys. A 9 (1976), no. 9, 1497–1506, doi:10.1088/0305-4470/9/9/010.DOI
- [46]L. Onsager, Crystal statistics. I. A two-dimensional model with an order-disorder transition, Phys. Rev. 65 (1944), 117–149, doi:10.1103/PhysRev.65.117.DOI
- [47]P. Pfeuty, The one-dimensional Ising model with a transverse field, Ann. Physics 57 (1970), no. 1, 79–90, doi:10.1016/0003-4916(70)90270-8.DOI
- [48]N. Regnault, S. Liu, and B. Bernevig, Integer characteristic polynomial factorization and Hilbert space fragmentation, preprint (2022), arXiv:2210.08019.arxiv.org/abs/2210.08019
- [49]J. Ruh and S. J. Elman, Expanding the class of free fermions via twin-collapse methods, Phys. Rev. A 113 (2026), no. 2, 022456, doi:10.1103/sfvf-vdh5.DOI
- [50]J. Ruh, S. J. Elman, and A. Chapman, A graph-theoretic analysis of non-generic free-fermion solvability by Krylov decompositions, preprint (2026), arXiv:2610.03557.arxiv.org/abs/2610.03557
- [51]G. M. Schütz, Exact solution of the master equation for the asymmetric exclusion process, J. Stat. Phys. 88 (1997), 427–445, doi:10.1007/BF02508478.DOI
- [52]C. J. S. Smith, Additive and multiplicative relations connecting conjugate algebraic numbers, J. Number Theory 23 (1986), no. 2, 243–254, doi:10.1016/0022-314X(86)90094-6.
- [53]P. Stevenhagen and H. W. Lenstra, Jr., Chebotarëv and his density theorem, Math. Intelligencer 18 (1996), no. 2, 26–37, doi:10.1007/BF03027290.DOI
- [54]W. P. Su, J. R. Schrieffer, and A. J. Heeger, Solitons in polyacetylene, Phys. Rev. Lett. 42 (1979), 1698–1701, doi:10.1103/PhysRevLett.42.1698.DOI
- [55]H. N. V. Temperley and M. E. Fisher, Dimer problem in statistical mechanics: an exact result, Philos. Mag. 6 (1961), no. 68, 1061–1063, doi:10.1080/14786436108243366.DOI
- [56]B. M. Terhal and D. P. DiVincenzo, Classical simulation of noninteracting-fermion quantum circuits, Phys. Rev. A 65 (2002), 032325, doi:10.1103/PhysRevA.65.032325.DOI
- [57]L. G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Comput. 31 (2002), no. 4, 1229–1254, doi:10.1137/S0097539700377025.DOI
- [58]Z. Wang and K. R. A. Hazzard, Topological correlations in three-dimensional classical Ising models: an exact solution with a continuous phase transition, Phys. Rev. Research 5 (2023), 013086, doi:10.1103/PhysRevResearch.5.013086.DOI
- [59]F. Y. Wu, Ising model with four-spin interactions, Phys. Rev. B 4 (1971), no. 7, 2312–2314, doi:10.1103/PhysRevB.4.2312.DOI
- [60]M. Zheng, B. Pozsgay, and S. Chen, Exact solutions of hidden free fermion models, preprint (2026), arXiv:2609.14134.arxiv.org/abs/2609.14134