pith. sign in

arxiv: 2605.01886 · v2 · submitted 2026-05-03 · 🧮 math.AG · math.CO

Tropical Degenerations of Network Games:Valuation Classes and Equilibrium Coalescence

Hangkun Hu , Jingyi Wang , Minggang Wang This is my paper

Pith reviewed 2026-05-09 16:45 UTC · model grok-4.3

classification 🧮 math.AG math.CO
keywords tropical degenerationsnetwork gamesPuiseux equilibriavaluation coalescencebinomial reductionscheme-theoretic multiplicitycross-prism familyalgebraic degree
0
0 comments X

The pith

In the collision-normalized cross-prism family of multilinear network games, 2^L Puiseux equilibrium branches share valuation and leading-coefficient vectors and collide at a single nonreduced torus point of scheme-theoretic length 2^L.

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

The paper develops a valuation-theoretic framework for tracking how equilibria of multilinear network games behave when parameters are allowed to degenerate tropically. Equilibrium conditions are written as an ideal over the Puiseux series field; branches are grouped into valuation classes whose initial forms simplify, under multilinearity, to binomial systems whose solutions are read off from exponent-difference graphs and Smith normal forms. The central construction is a collision-normalized cross-prism family in which many branches are forced to share exactly the same valuation vector and leading coefficients, so that their limiting initial fiber sits at one torus point that carries multiplicity equal to the number of branches. This shows that coalescence can be an intrinsic scheme-theoretic phenomenon rather than merely the disappearance of higher-order terms, and these local invariants are then used to refine global algebraic-degree counts for the game.

Core claim

In the collision-normalized cross-prism family, 2^L Puiseux equilibrium branches share the same valuation vector and the same leading-coefficient vector. The corresponding limiting initial fiber is supported at a single torus point that is nonreduced with scheme-theoretic length 2^L. Thus valuation coalescence is realized as an intrinsic scheme-theoretic collision rather than merely as a loss of higher-order terms. These local degeneration invariants are then related to the algebraic-degree theory of network games, showing how global equilibrium counts can be refined by valuation classes, binomial initial systems, Smith lattice data, and nonreduced collision fibers.

What carries the argument

The collision-normalized cross-prism family, which forces 2^L Puiseux branches to share identical valuation and leading-coefficient vectors so that their initial scheme becomes a single nonreduced point of length 2^L.

If this is right

  • For valuation vectors in the relative interiors of generator-wise maximal tropical cells, multilinearity forces the generator-wise initial system to reduce to a binomial system.
  • The resulting binomial systems are controlled by exponent-difference graphs, strongly connected component decompositions, and lattice indices obtained from Smith normal form.
  • Unimodular diagonal blocks produce initial-coefficient rigidity while non-unimodular blocks produce torsion-type leading-coefficient multiplicities.
  • Global equilibrium counts for network games can be refined by the local data of valuation classes, binomial initial systems, Smith lattice indices, and nonreduced collision fibers.

Where Pith is reading between the lines

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

  • The same binomial-reduction and Smith-form machinery could be applied to other multilinear systems whose equilibria are cut out by ideals over Puiseux fields.
  • Lattice-index computations via Smith normal form might be automated to predict coalescence multiplicities without constructing the full cross-prism family.
  • The distinction between scheme-theoretic collision and mere loss of higher-order terms suggests a finer tropical invariant that could be tracked in numerical homotopy continuation for game equilibria.

Load-bearing premise

The framework requires multilinearity of the network games together with valuation vectors lying in the relative interiors of generator-wise maximal tropical cells, and the cross-prism family is built specifically to exhibit the nonreduced coalescence.

What would settle it

An explicit Gröbner-basis or primary-decomposition computation for the initial ideal when L=1 that shows the scheme-theoretic length of the initial fiber is not equal to 2 would falsify the claimed multiplicity.

read the original abstract

A valuation-theoretic framework is developed for studying tropical degenerations of multilinear network games. Equilibrium conditions are modeled by an ideal over the Puiseux field, and valuation classes and cluster multiplicities are used to describe the organization of Puiseux equilibrium branches under degeneration. For valuation vectors lying in the relative interiors of generator-wise maximal tropical cells, multilinearity is shown to force a binomial reduction of the generator-wise initial system. The resulting binomial systems are governed by exponent-difference graphs, strongly connected component decompositions, and lattice indices computed via Smith normal form. In particular, unimodular diagonal blocks yield initial-coefficient rigidity, whereas non-unimodular blocks give rise to torsion-type leading-coefficient multiplicities. The generic binomial theory is complemented by a collision-normalized cross-prism family. In this family, 2^L Puiseux equilibrium branches share the same valuation vector and the same leading-coefficient vector. The corresponding limiting initial fiber is supported at a single torus point, but this point is nonreduced with scheme-theoretic length 2^L. Thus valuation coalescence is realized as an intrinsic scheme-theoretic collision rather than merely as a loss of higher-order terms. These local degeneration invariants are then related to the algebraic-degree theory of network games, showing how global equilibrium counts can be refined by valuation classes, binomial initial systems, Smith lattice data, and nonreduced collision fibers.

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.

Referee Report

3 major / 2 minor

Summary. The paper develops a valuation-theoretic framework for tropical degenerations of multilinear network games over Puiseux fields. Equilibrium ideals reduce to binomial systems when valuation vectors lie in the relative interiors of generator-wise maximal tropical cells, with the binomial structure governed by exponent-difference graphs, strongly connected component decompositions, and Smith normal form lattice indices. Unimodular blocks yield leading-coefficient rigidity while non-unimodular blocks produce torsion-type multiplicities. The framework is illustrated by the collision-normalized cross-prism family, in which 2^L Puiseux equilibrium branches share a common valuation vector and leading-coefficient vector, so that the limiting initial fiber is supported at a single torus point of scheme-theoretic length 2^L. These local invariants are related to the algebraic-degree theory of network games to refine global equilibrium counts.

Significance. If the binomial reduction and the explicit length-2^L computation hold, the work supplies a scheme-theoretic interpretation of valuation coalescence in network-game degenerations and a systematic way to refine algebraic equilibrium counts by valuation classes, initial ideals, and lattice data. The explicit cross-prism family provides a concrete, falsifiable example of nonreduced collision fibers, which could serve as a model for further degeneration studies in tropical algebraic geometry and game theory.

major comments (3)
  1. [collision-normalized cross-prism family] § on collision-normalized cross-prism family (the paragraph beginning 'The generic binomial theory is complemented by...'): the assertion that the initial fiber has scheme-theoretic length exactly 2^L for general L rests on the family being engineered so that all 2^L branches share identical leading coefficients; an independent verification that the reduced binomial ideal (after Smith normal form) defines a length-2^L point in the torus, without relying on the normalization, is not supplied.
  2. [binomial reduction paragraph] The paragraph on binomial reduction ('For valuation vectors lying in the relative interiors... multilinearity is shown to force a binomial reduction'): the claim that multilinearity forces the initial system to be binomial is stated without an explicit local coordinate change or generator-wise initial-form computation that would confirm the reduction holds uniformly across all generators.
  3. [Smith normal form and torsion multiplicities] The discussion of torsion-type leading-coefficient multiplicities via Smith normal form: while the lattice-index computation is outlined, no concrete matrix example for L>2 is given to show that the torsion order multiplies to exactly 2^L rather than a different divisor.
minor comments (2)
  1. Notation for valuation classes and cluster multiplicities is introduced without a compact summary table relating them to the classical tropical cell decomposition.
  2. The abstract refers to 'exponent-difference graphs' before they are defined; a forward reference or brief definition in the introduction would improve readability.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive suggestions. The comments identify places where additional explicit verifications and examples would improve clarity and rigor. We address each major comment in turn and indicate the revisions planned for the next version of the manuscript.

read point-by-point responses

  1. Referee: [collision-normalized cross-prism family] § on collision-normalized cross-prism family (the paragraph beginning 'The generic binomial theory is complemented by...'): the assertion that the initial fiber has scheme-theoretic length exactly 2^L for general L rests on the family being engineered so that all 2^L branches share identical leading coefficients; an independent verification that the reduced binomial ideal (after Smith normal form) defines a length-2^L point in the torus, without relying on the normalization, is not supplied.

    Authors: We acknowledge that the length-2^L claim in the collision-normalized cross-prism family is tied to the construction in which all branches share the same valuation and leading-coefficient vectors. To supply the requested independent verification, we will add an explicit computation of the reduced binomial ideal (post-Smith normal form) for the family, showing directly that it cuts out a non-reduced point of length exactly 2^L in the torus. This computation will be presented without presupposing the shared leading coefficients beyond the explicit exponent matrix of the cross-prism equations. revision: yes

  2. Referee: [binomial reduction paragraph] The paragraph on binomial reduction ('For valuation vectors lying in the relative interiors... multilinearity is shown to force a binomial reduction'): the claim that multilinearity forces the initial system to be binomial is stated without an explicit local coordinate change or generator-wise initial-form computation that would confirm the reduction holds uniformly across all generators.

    Authors: The referee is correct that the binomial-reduction statement would be strengthened by explicit details. In the revised manuscript we will insert a local coordinate change together with a generator-wise computation of the initial forms. This will demonstrate that multilinearity of the network-game equations forces every generator-wise initial form to be binomial whenever the valuation vector lies in the relative interior of a maximal tropical cell, and that the reduction is uniform across all generators. revision: yes

  3. Referee: [Smith normal form and torsion multiplicities] The discussion of torsion-type leading-coefficient multiplicities via Smith normal form: while the lattice-index computation is outlined, no concrete matrix example for L>2 is given to show that the torsion order multiplies to exactly 2^L rather than a different divisor.

    Authors: We agree that a concrete matrix example for L>2 would make the torsion-multiplicity claim more transparent. We will add an explicit Smith-normal-form computation for the exponent matrix when L=3, verifying that the product of the torsion orders equals 8 and thereby confirming that the multiplicities multiply to exactly 2^L in this case. The general argument via Smith normal form will remain unchanged, but the example will illustrate the pattern. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper develops its valuation-theoretic framework from standard Puiseux series and ideal theory applied to multilinear network games. It derives the binomial reduction directly from multilinearity when valuation vectors lie in relative interiors of generator-wise maximal tropical cells, then analyzes the resulting systems via exponent-difference graphs, SCC decompositions, and Smith normal form lattice indices to obtain coefficient rigidity or torsion multiplicities. The collision-normalized cross-prism family is introduced explicitly as a complement to illustrate the nonreduced length-2^L coalescence in one specific case, rather than serving as an input that defines or forces the general claims. No load-bearing step reduces a central result to a self-definition, a fitted parameter renamed as prediction, or a self-citation chain; the derivation remains independent and self-contained against external algebraic and tropical geometry benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 3 invented entities

The paper relies on standard algebraic geometry background while introducing new modeling assumptions and entities specific to network games; no free parameters are evident, but several domain assumptions and invented constructs underpin the central claims.

axioms (2)
  • domain assumption Equilibrium conditions of multilinear network games can be modeled by an ideal over the Puiseux field.
    Stated directly as the modeling approach in the abstract.
  • domain assumption For valuation vectors in relative interiors of generator-wise maximal tropical cells, multilinearity forces a binomial reduction of the generator-wise initial system.
    Key technical claim enabling the subsequent graph and lattice analysis.
invented entities (3)
  • valuation classes and cluster multiplicities no independent evidence
    purpose: to describe the organization of Puiseux equilibrium branches under degeneration
    New classification tools introduced in the framework.
  • exponent-difference graphs and strongly connected component decompositions no independent evidence
    purpose: to govern the binomial systems after reduction
    Combinatorial objects defined to analyze the initial systems.
  • collision-normalized cross-prism family no independent evidence
    purpose: to exhibit 2^L branches sharing valuation and leading coefficients with nonreduced scheme-theoretic length 2^L
    Specific family constructed to realize the coalescence phenomenon.

pith-pipeline@v0.9.0 · 5550 in / 1720 out tokens · 82051 ms · 2026-05-09T16:45:07.407168+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · 1 internal anchor

  1. [1]

    Littman, and Satinder Singh

    Michael Kearns, Michael L. Littman, and Satinder Singh. Graphical models for game theory. InProceed- ings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pages 253–260. Morgan Kaufmann, 2001

    work page 2001

  2. [2]

    [HSS98] B

    Birkett Huber and Bernd Sturmfels. A polyhedral method for solving sparse polynomial systems.Math- ematics of Computation, 64(212):1541–1555, 1995. doi:10.1090/S0025-5718-1995-1297471-4

    work page doi:10.1090/s0025-5718-1995-1297471-4 1995

  3. [3]

    Cox, John Little, and Donal O’Shea.Using Algebraic Geometry

    David A. Cox, John Little, and Donal O’Shea.Using Algebraic Geometry. Graduate Texts in Mathematics, vol. 185. Springer, New York, second edition, 2005. doi:10.1007/b138611

    work page doi:10.1007/b138611 2005

  4. [4]

    Tropical complementarity prob- lems and Nash equilibria.SIAM Journal on Discrete Mathematics, 37(3):1645–1665, 2023

    Xavier Allamigeon, St´ ephane Gaubert, and Fr´ ed´ eric Meunier. Tropical complementarity prob- lems and Nash equilibria.SIAM Journal on Discrete Mathematics, 37(3):1645–1665, 2023. doi:10.1137/21M1446861

    work page doi:10.1137/21m1446861 2023

  5. [5]

    Product-mix auctions and tropical geometry.Mathematics of Opera- tions Research, 44(4):1396–1411, 2019

    Ngoc Mai Tran and Josephine Yu. Product-mix auctions and tropical geometry.Mathematics of Opera- tions Research, 44(4):1396–1411, 2019. doi:10.1287/moor.2018.0975

    work page doi:10.1287/moor.2018.0975 2019

  6. [6]

    The polyhedral geometry of truthful auctions.Mathe- matical Programming, 210:539–566, 2025

    Michael Joswig, Max Klimm, and Sylvain Spitz. The polyhedral geometry of truthful auctions.Mathe- matical Programming, 210:539–566, 2025. doi:10.1007/s10107-024-02168-y

    work page doi:10.1007/s10107-024-02168-y 2025

  7. [7]

    The Nullstellensatz and Positivstellen- satz for sparse tropical polynomial systems.Foundations of Computational Mathematics, 2025

    Marianne Akian, Antoine B´ ereau, and St´ ephane Gaubert. The Nullstellensatz and Positivstellen- satz for sparse tropical polynomial systems.Foundations of Computational Mathematics, 2025. doi:10.1007/s10208-025-09708-8

    work page doi:10.1007/s10208-025-09708-8 2025

  8. [8]

    Cyber-physical security of a smart grid infrastructure.Proceedings of the IEEE, 100(1):195–209, 2012

    Yilin Mo, Tiffany Hyun-Jin Kim, Kenneth Brancik, Dona Dickinson, Heejo Lee, Adrian Perrig, and Bruno Sinopoli. Cyber-physical security of a smart grid infrastructure.Proceedings of the IEEE, 100(1):195–209, 2012. doi:10.1109/JPROC.2011.2161428

    work page doi:10.1109/jproc.2011.2161428 2012

  9. [9]

    Peer-to-peer energy trading in a microgrid.Applied Energy, 220:1–12, 2018

    Chenghua Zhang, Jianzhong Wu, Yue Zhou, Meng Cheng, and Chao Long. Peer-to-peer energy trading in a microgrid.Applied Energy, 220:1–12, 2018. doi:10.1016/j.apenergy.2018.03.010

    work page doi:10.1016/j.apenergy.2018.03.010 2018

  10. [10]

    The Algebraic Degree of Network Games via Tropical Geometry: A Geometric Perspective on Datta's Formula

    Hangkun Hu, Jingyi Wang, and Minggang Wang. The algebraic degree of network games via trop- ical geometry: A geometric perspective on Datta’s formula. arXiv:2604.17741 [math.AG], 2026. doi:10.48550/arXiv.2604.17741

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.48550/arxiv.2604.17741 2026

  11. [11]

    Graduate Studies in Mathe- matics, vol

    Diane Maclagan and Bernd Sturmfels.Introduction to Tropical Geometry. Graduate Studies in Mathe- matics, vol. 161. American Mathematical Society, Providence, RI, 2015. 28 H. HU, J. WANG, AND M. WANG

    work page 2015

  12. [12]

    Datta.Algebraic Methods in Game Theory

    Ruchira S. Datta.Algebraic Methods in Game Theory. PhD thesis, University of California, Berkeley, 2003

    work page 2003

  13. [13]

    Ruchira S. Datta. Finding all Nash equilibria of a finite game using polynomial algebra.Economic Theory, 42(1):55–96, 2010. doi:10.1007/s00199-009-0447-z

    work page doi:10.1007/s00199-009-0447-z 2010

  14. [14]

    Bernshtein

    David N. Bernshtein. The number of roots of a system of equations.Functional Analysis and Its Appli- cations, 9(3):183–185, 1975. doi:10.1007/BF01075595

    work page doi:10.1007/bf01075595 1975

  15. [15]

    CBMS Regional Conference Series in Math- ematics, vol

    Bernd Sturmfels.Solving Systems of Polynomial Equations. CBMS Regional Conference Series in Math- ematics, vol. 97. American Mathematical Society, Providence, RI, 2002

    work page 2002

  16. [16]

    Binomial ideals.Duke Mathematical Journal, 84(1):1–45, 1996

    David Eisenbud and Bernd Sturmfels. Binomial ideals.Duke Mathematical Journal, 84(1):1–45, 1996. doi:10.1215/S0012-7094-96-08401-X

    work page doi:10.1215/s0012-7094-96-08401-x 1996

  17. [17]

    A vector bundle approach to Nash equilibria.Ad- vances in Applied Mathematics, 175:103028, 2026

    Hirotachi Abo, Irem Portakal, and Luca Sodomaco. A vector bundle approach to Nash equilibria.Ad- vances in Applied Mathematics, 175:103028, 2026. doi:10.1016/j.aam.2025.103028

    work page doi:10.1016/j.aam.2025.103028 2026

  18. [18]

    Geometry of dependency equilibria.Rendiconti dell’Istituto di Matematica dell’Universit` a di Trieste, 54:5, 2022

    Irem Portakal and Bernd Sturmfels. Geometry of dependency equilibria.Rendiconti dell’Istituto di Matematica dell’Universit` a di Trieste, 54:5, 2022. doi:10.13137/2464-8728/33881

    work page doi:10.13137/2464-8728/33881 2022

  19. [19]

    Nash conditional independence curve.Journal of Symbolic Computation, 122:102255, 2024

    Irem Portakal and Javier Sendra-Arranz. Nash conditional independence curve.Journal of Symbolic Computation, 122:102255, 2024. doi:10.1016/j.jsc.2023.102255

    work page doi:10.1016/j.jsc.2023.102255 2024

  20. [20]

    Game theory of undirected graphical models.Journal of Algebra, 666:574–606, 2025

    Irem Portakal and Javier Sendra-Arranz. Game theory of undirected graphical models.Journal of Algebra, 666:574–606, 2025. doi:10.1016/j.jalgebra.2024.12.004

    work page doi:10.1016/j.jalgebra.2024.12.004 2025

  21. [21]

    TheGameTheorypackage for Macaulay2

    Erin Connelly, Vincenzo Galgano, Zhuang He, Giacomo Maletto, Elke Neuhaus, Irem Portakal, Hannah Tillmann-Morris, and Chenyang Zhao. TheGameTheorypackage for Macaulay2. arXiv:2507.16755, 2025

    work page arXiv 2025