arxiv: 2604.20138 · v1 · submitted 2026-04-22 · ✦ hep-ph · hep-th· math-ph· math.MP

Recognition: unknown

Graph-theoretic determination of massless modes in latticized theory-space models

Ketan M. Patel

Authors on Pith no claims yet

Pith reviewed 2026-05-10 00:42 UTC · model grok-4.3

classification ✦ hep-ph hep-thmath-phmath.MP

keywords graph theorybipartite matchingmassless modesfermion mass matrixlatticized theory spaceDulmage-Mendelsohn decompositiondimensional deconstruction

0 comments

The pith

The number of massless fermion modes is fixed by the cardinality of a maximum matching in the bipartite graph of allowed mass terms.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper maps the allowed fermion mass terms in latticized theory-space models to the edges of a bipartite graph whose vertices represent the fields. It shows that the number of massless modes equals a quantity set by the size of the largest possible matching in that graph. The wave functions of those modes are supported only on fields that can be reached from unmatched vertices along even-length alternating paths, as given by the Dulmage-Mendelsohn decomposition. The entire result holds for any generic nonzero values of the mass parameters and therefore depends only on which mass terms are present. This supplies a purely topological recipe for constructing models that contain any chosen number of massless modes with specified localization.

Core claim

A graph-theoretic method is introduced for analyzing fermion mass spectra in latticized theory-space models, including chain models arising from dimensional deconstruction. Fermion mass terms are mapped to bipartite graphs, with fields as vertices and nonvanishing mass terms as edges. The number of massless modes is shown to be fixed by the cardinality of a maximum matching of the associated graph. Moreover, the wave-function support of these modes is restricted to fields reachable from exposed or unmatched vertices by even-length maximum-matching-alternating paths, as characterized by the Dulmage-Mendelsohn decomposition. These results depend only on the topology of latticized theory space.

What carries the argument

The maximum matching of the bipartite graph whose edges are the allowed mass terms, whose cardinality fixes the number of massless modes, together with the Dulmage-Mendelsohn decomposition that identifies the support of those modes via alternating paths.

If this is right

Any desired number of massless modes can be realized simply by choosing a graph whose maximum matching leaves the correct number of vertices unmatched.
The spatial support of each massless mode is completely determined by the set of even-length alternating paths from exposed vertices.
The spectrum is independent of the concrete values of the mass parameters provided they remain generic and nonzero.
The same construction applies equally to chain models from deconstruction and to more general latticized theory spaces.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same matching technique could be applied to count zero modes in other discrete or lattice fermion systems whose mass matrices have a bipartite structure.
It suggests that the light-fermion content of a model is largely fixed once the connectivity pattern of the theory space is chosen.
Extensions to include dynamical or higher-order interactions would require checking whether the topological count survives when the generic-value assumption is relaxed.

Load-bearing premise

The mass matrix has generic nonzero entries exactly on the edges of the bipartite graph and zero elsewhere, so the kernel dimension is controlled solely by the graph topology rather than by the specific numerical values.

What would settle it

Pick any small bipartite graph, fill a numerical mass matrix with random nonzero entries on the corresponding positions and zeros elsewhere, then compute the dimension of its kernel and check whether it equals the value predicted by the size of a maximum matching.

Figures

Figures reproduced from arXiv: 2604.20138 by Ketan M. Patel.

**Figure 2.** Figure 2: Upon translating the graph into a field-theoretic model, the fields l1,2,3 can be identified with the three generations of standard neutrinos, while r1,2,3 represent their right-chiral partners. The remaining fields constitute five Dirac fermions, which may possess bare mass terms. The required pattern of mass terms can be realized through a straightforward extension of the site-dependent global abelian … view at source ↗

read the original abstract

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper gives a parameter-free graph-theory rule for counting and locating massless fermion modes in deconstructed models by mapping mass terms to bipartite graphs and applying maximum matching plus Dulmage-Mendelsohn decomposition.

read the letter

The main takeaway is that the number of massless modes equals the number of fields minus twice the size of a maximum matching in the graph whose edges are the allowed mass terms, and the modes themselves sit on the vertices reachable from unmatched ones via alternating paths. That result follows directly from König's theorem and the standard decomposition, so it is independent of the actual mass values as long as they are generic and nonzero. The paper does a clean job of spelling out the mapping from the latticized theory-space setup to the graph and then showing how the combinatorial tools fix both the count and the support of the zero modes. This is useful for anyone who wants to engineer a specific pattern of chiral zero modes without tuning parameters by hand. The approach is new in this context; the cited deconstruction literature does not appear to have used matching cardinality or the Dulmage-Mendelsohn decomposition for this purpose. The argument is internally consistent and rests on well-established graph algorithms rather than any new conjecture. The only soft spot I see is that the paper will need to verify, with a few explicit examples, that the graph construction really captures every allowed mass term in the models people actually build; edge cases with overlapping chains or orbifold identifications could in principle require extra bookkeeping, though nothing in the abstract suggests a problem. Overall this is a short, technical note aimed at people who already work on dimensional deconstruction or latticized extra dimensions and need a systematic way to control fermion spectra. A reader building such models will get immediate value from the design rule. It is solid enough to deserve a serious referee rather than a desk reject; the central claim is straightforward to check once the full examples are in hand.

Referee Report

0 major / 3 minor

Summary. The manuscript introduces a graph-theoretic method for analyzing fermion mass spectra in latticized theory-space models, including chain models from dimensional deconstruction. Fermion mass terms are mapped to edges in a bipartite graph with fields as vertices. The number of massless modes is fixed by the cardinality of a maximum matching in this graph (via König's theorem), while the wave-function support of these modes is restricted to fields reachable from exposed vertices by even-length alternating paths, as given by the Dulmage-Mendelsohn decomposition. The results depend only on the topology of the latticized theory space and hold for generic nonzero mass parameters.

Significance. If the central mapping and application of the combinatorial theorems hold, the work supplies a systematic, parameter-independent tool for determining and engineering the number and localization properties of massless modes in deconstructed models. This is a clear strength: the approach is built directly on externally validated results (König's theorem for generic rank and the Dulmage-Mendelsohn decomposition) rather than model-specific assumptions, enabling reproducible, falsifiable predictions of zero-mode counts and supports from graph topology alone.

minor comments (3)

The manuscript would benefit from an explicit worked example (e.g., a minimal two- or three-site chain) that shows the precise construction of the bipartite graph from the mass matrix, the maximum matching, and the resulting zero-mode count and support; this would make the mapping from mass terms to graph edges fully transparent.
A short discussion of how the method extends beyond chain models to more general latticized geometries (e.g., with loops or higher-dimensional lattices) would strengthen the claim of broad applicability.
Standard references to the original statements of König's theorem and the Dulmage-Mendelsohn decomposition should be added in the introductory section for completeness.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript, the accurate summary of our graph-theoretic method, and the recommendation for minor revision. The referee's description correctly captures the mapping of mass terms to bipartite graphs, the use of maximum matchings via König's theorem, and the localization via the Dulmage-Mendelsohn decomposition.

Circularity Check

0 steps flagged

No circularity; applies standard external graph theorems to mass-matrix topology

full rationale

The derivation maps allowed mass terms to edges of a bipartite graph whose vertices are the fermion fields. It then invokes the standard combinatorial fact that the generic rank of a bipartite matrix equals the size of a maximum matching in its support graph (König's theorem) together with the Dulmage-Mendelsohn decomposition to locate the kernel support. Both results are externally validated, parameter-free theorems that predate the paper and do not depend on any fitted values or self-referential definitions inside it. The zero-mode count |L|+|R|−2·matching-size therefore follows directly for generic nonzero entries; the mapping itself is faithful by construction of the latticized setup. No load-bearing self-citation, ansatz smuggling, or renaming of known results occurs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the domain assumption that fermion mass terms define a bipartite graph whose topology alone fixes the zero-mode spectrum for generic nonzero entries. No free parameters or new postulated entities are introduced.

axioms (2)

domain assumption Fermion mass terms can be represented as edges in a bipartite graph between left- and right-handed fields.
The mapping is stated as the starting point of the method.
domain assumption The massless-mode count and localization depend only on graph topology and are independent of the specific nonzero mass values.
Explicitly claimed in the abstract.

pith-pipeline@v0.9.0 · 5427 in / 1430 out tokens · 29939 ms · 2026-05-10T00:42:43.766615+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

25 extracted references · 13 canonical work pages · 1 internal anchor

[1]

The Cosmological constants,

Paul A. M. Dirac, “The Cosmological constants,” Nature139, 323 (1937)

1937
[2]

New basis for cosmology,

Paul A. M. Dirac, “New basis for cosmology,” Proc. Roy. Soc. Lond. A165, 199–208 (1938)

1938
[3]

Why the universe is just so,

Craig J. Hogan, “Why the universe is just so,” Rev. Mod. Phys.72, 1149–1161 (2000), arXiv:astro-ph/9909295

work page arXiv 2000
[4]

Naturalness after LHC8,

Gian F. Giudice, “Naturalness after LHC8,” PoSEPS-HEP2013, 163 (2013), arXiv:1307.7879 [hep-ph]

work page arXiv 2013
[5]

Naturalness: past, present, and future,

Nathaniel Craig, “Naturalness: past, present, and future,” Eur. Phys. J. C83, 825 (2023), arXiv:2205.05708 [hep-ph]

work page arXiv 2023
[6]

Electroweak symmetry breaking from dimensional deconstruction,

Nima Arkani-Hamed, Andrew G. Cohen, and Howard Georgi, “Electroweak symmetry breaking from dimensional deconstruction,” Phys. Lett. B513, 232–240 (2001), arXiv:hep- ph/0105239

work page arXiv 2001
[7]

Plummer,Matching Theory, North-Holland Mathematics Stud- ies, Vol

L´ aszl´ o Lov´ asz and Michael D. Plummer,Matching Theory, North-Holland Mathematics Stud- ies, Vol. 121 (North-Holland Publishing Co., Amsterdam & New York, 1986)

1986
[8]

Graphs and matrices,

D´ enes K¨ onig, “Graphs and matrices,” Mat. Fiz. Lapok38, 116–119 (1931)

1931
[9]

D´ enes K¨ onig,Theorie der endlichen und unendlichen Graphen(Akademischen Verlagsge- sellschaft, Leipzig, 1936) reprinted 1950, Chelsea, New York. Zbl. 13.228; MR 12,195

1936
[10]

Matrixok kombinatori´ us tulajdons´ agair´ ol,

Jen˝ o Egerv´ ary, “Matrixok kombinatori´ us tulajdons´ agair´ ol,” Matematikai ´ es Fizikai Lapok38, 16–28 (1931), in Hungarian; English translation:On combinatorial properties of matrices, Logistics Papers, George Washington Univ., No. 11 (1955)

1931
[11]

Two theorems in graph theory,

Claude Berge, “Two theorems in graph theory,” Proceedings of the National Academy of Sciences of the United States of America43, 842–844 (1957)

1957
[12]

Software likeMathematicaalready have such algorithms inbuilt under the function FindIndependentEdgeSet
[13]

Coverings of bipartite graphs,

A. L. Dulmage and N. S. Mendelsohn, “Coverings of bipartite graphs,” Canadian Journal of Mathematics10, 517–534 (1958), mR 20#3549

1958
[14]

A structure theory of bipartite graphs of finite exterior dimension,

A. L. Dulmage and N. S. Mendelsohn, “A structure theory of bipartite graphs of finite exterior dimension,” Trans. Roy. Soc. Canada, Ser. III53, 1–13 (1959), zbl. 91.375

1959
[15]

Rank-maximal matchings,

Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna E. Paluch, “Rank-maximal matchings,” ACM Trans. Algorithms2, 602–610 (2006)

2006
[16]

AMathematicasubroutine for computing the DM decomposition of a bipartite graph is 12 provided in the ancillary fileDM decomposition.nbincluded with the arXiv submission
[17]

Large mixing angle MSW and atmospheric neutrinos from single right-handed neutrino dominance and U(1) family symmetry,

S. F. King, “Large mixing angle MSW and atmospheric neutrinos from single right-handed neutrino dominance and U(1) family symmetry,” Nucl. Phys. B576, 85–105 (2000), arXiv:hep- ph/9912492

work page arXiv 2000
[18]

Cosmological sign of neutrino CP violation,

P. H. Frampton, S. L. Glashow, and T. Yanagida, “Cosmological sign of neutrino CP viola- tion,” Phys. Lett. B548, 119–121 (2002), arXiv:hep-ph/0208157

work page arXiv 2002
[19]

A Clockwork Theory,

Gian F. Giudice and Matthew McCullough, “A Clockwork Theory,” JHEP02, 036 (2017), arXiv:1610.07962 [hep-ph]

work page arXiv 2017
[20]

Exponential Hierarchies from Anderson Localization in Theory Space,

Nathaniel Craig and Dave Sutherland, “Exponential Hierarchies from Anderson Localization in Theory Space,” Phys. Rev. Lett.120, 221802 (2018), arXiv:1710.01354 [hep-ph]

work page arXiv 2018
[21]

Hierarchies from deterministic non-locality in theory space Anderson local- isation,

Ketan M. Patel, “Hierarchies from deterministic non-locality in theory space Anderson local- isation,” JHEP05, 002 (2025), arXiv:2501.05137 [hep-ph]

work page arXiv 2025
[22]

Flavour hierarchies from radiative corrections in latticed theory space,

Gurucharan Mohanta and Ketan M. Patel, “Flavour hierarchies from radiative corrections in latticed theory space,” (2026), arXiv:2601.10316 [hep-ph]

work page arXiv 2026
[23]

Flavour from fractal mass chains,

Alejandro Ibarra, Aadarsh Singh, and Sudhir K. Vempati, “Flavour from fractal mass chains,” Phys. Lett. B874, 140268 (2026), arXiv:2509.04811 [hep-ph]

work page arXiv 2026
[24]

Generating the fermion mass hierarchy at the TeV scale,

Nima Arkani-Hamed, Carolina Figueiredo, Lawrence J. Hall, and Claudio Andrea Manzari, “Generating the fermion mass hierarchy at the TeV scale,” (2026), arXiv:2602.17754 [hep-ph]

work page arXiv 2026
[25]

NuFit-6.0: Updated global analysis of three-flavor neutrino oscillations

Ivan Esteban, M. C. Gonzalez-Garcia, Michele Maltoni, Ivan Martinez-Soler, Jo˜ ao Paulo Pin- heiro, and Thomas Schwetz, “NuFit-6.0: updated global analysis of three-flavor neutrino oscillations,” JHEP12, 216 (2024), arXiv:2410.05380 [hep-ph]. 13

work page internal anchor Pith review arXiv 2024