Pith. sign in

REVIEW 2 major objections 2 minor 48 references

Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries

T0 review · 2 major / 2 minor · reviewed 2026-05-15 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A single eigenvector certifies conformal rigidity for vertex-transitive graphs and similar symmetric ones.

desk verdict The paper introduces orbit-isometric embeddings to certify conformal rigidity via subdifferentials and claims single-eigenvector checks suffice for vertex-transitive graphs, but the multiplicity reduction needs explicit verification. read the letter →

arxiv 2605.15017 v1 pith:JPKIDMFI submitted 2026-05-14 math.CO math.OCmath.SP

Andrew Niu This is my paper · ORCID
classification math.COmath.OCmath.SP MSC 05C50
keywords conformalrigiditygraphLaplaciansspectralembeddingssubdifferentialsorbit-isometriesvertex-transitivegraphseigenvalueoptimization
checked against Cost.FunctionalEquationalexander_duality_circle_linking
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper develops a subdifferential framework that unifies variational optimization of Laplacian eigenvalues with the geometry of spectral embeddings. It introduces orbit-isometric embeddings, a symmetry-aware weakening of the edge-isometric condition, and proves this weaker notion still certifies whether uniform edge weights extremize the second-smallest or largest eigenvalue. For all vertex-transitive graphs and a broader class, the certification collapses to the existence of one suitable eigenvector. A reader cares because the method replaces numerical searches with algebraic checks that are exact and often reduce to linear feasibility.

What carries the argument

The orbit-isometric spectral embedding, a symmetry-reduced analogue of edge-isometric embeddings that remains sufficient to certify conformal rigidity.

What would settle it

A vertex-transitive graph on which the single-eigenvector algebraic test declares rigidity but direct numerical maximization of lambda_2(w) or minimization of lambda_n(w) finds a non-uniform weight that improves the extremum.

Watch

Extended reading notes

Core claim

A graph is lower conformally rigid when uniform weights maximize lambda_2 and upper conformally rigid when they minimize lambda_n. The subdifferential analysis shows that an orbit-isometric embedding certifies either property, and symmetry reduction implies that for vertex-transitive graphs a single eigenvector suffices, yielding an algebraically exact test via linear feasibility or quadratic equations solved by Gröbner bases.

Load-bearing premise

That orbit-isometric embeddings characterize conformal rigidity just as edge-isometric ones do.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

2 major / 2 minor

Summary. The paper introduces a subdifferential framework unifying variational optimization of Laplacian eigenvalues with the geometry of edge-isometric spectral embeddings to characterize conformal rigidity of graphs. It defines orbit-isometric embeddings as a symmetry-aware weakening of edge-isometry that remains sufficient for rigidity, then uses representation theory to show that for vertex-transitive graphs (and a larger class) rigidity is certified by a single eigenvector. This yields an algebraic certification procedure reducing in many cases to linear feasibility or Gröbner-basis solution of quadratic equations.

Significance. If the central claims hold, the work supplies an exact, non-numerical certification method for conformal rigidity that resolves an open question for vertex-transitive graphs and explains previously unexplained examples. The unification of subdifferentials, orbit-isometries, and representation-theoretic reduction constitutes a genuine technical advance with potential to streamline future work on symmetric graphs.

major comments (2)
  1. [Abstract / §3] Abstract and §3 (orbit-isometric definition): the reduction from full orbit-isometry on the eigenspace to a single-eigenvector check is load-bearing for the vertex-transitive claim. When multiplicity of λ₂ exceeds 1 (e.g., cycles C_n, n>3), the isometry condition must hold on the entire irreducible representation; the manuscript must supply an explicit invariance or projection argument showing why a single vector suffices, or the claim is not yet established.
  2. [§4] §4 (main theorem): the statement that orbit-isometric embeddings characterize conformal rigidity for the stated class relies on the subdifferential characterization of edge-isometric embeddings. The paper must verify that the subdifferential inclusion remains equivalent after the orbit-isometric relaxation; otherwise the sufficiency direction fails.
minor comments (2)
  1. [§2] Notation for the normalized weight set and the subdifferential operator should be introduced once with a dedicated display equation rather than inline.
  2. [§5] The Gröbner-basis certification procedure is mentioned only in the abstract; a brief complexity or termination remark in the main text would aid readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and the positive evaluation of our work. The comments highlight important points that require clarification in the presentation. We address each major comment below and will revise the manuscript accordingly to strengthen the arguments.

read point-by-point responses

  1. Referee: [Abstract / §3] Abstract and §3 (orbit-isometric definition): the reduction from full orbit-isometry on the eigenspace to a single-eigenvector check is load-bearing for the vertex-transitive claim. When multiplicity of λ₂ exceeds 1 (e.g., cycles C_n, n>3), the isometry condition must hold on the entire irreducible representation; the manuscript must supply an explicit invariance or projection argument showing why a single vector suffices, or the claim is not yet established.

    Authors: We appreciate this observation. In the manuscript, the orbit-isometric embedding is defined such that it respects the group action on the eigenspace. For vertex-transitive graphs, the relevant eigenspace forms an irreducible representation of the automorphism group. By the properties of irreducible representations and the fact that the condition is invariant under the group action, satisfaction for a single eigenvector (chosen generically) implies the condition for the entire space via projection onto the representation. However, to address the referee's concern directly, we will add an explicit lemma in Section 3 that provides the invariance argument: specifically, if the embedding is orbit-isometric for one vector in the eigenspace, then by averaging the inner products over the group orbits, the condition holds for all vectors in the space. This will make the reduction rigorous and explicit. revision: yes

  2. Referee: [§4] §4 (main theorem): the statement that orbit-isometric embeddings characterize conformal rigidity for the stated class relies on the subdifferential characterization of edge-isometric embeddings. The paper must verify that the subdifferential inclusion remains equivalent after the orbit-isometric relaxation; otherwise the sufficiency direction fails.

    Authors: We agree that the equivalence needs to be verified explicitly for the relaxed condition. In the proof of Theorem 4.1, the necessity direction follows directly from the definition, as orbit-isometry is weaker but still implies the edge conditions for the subdifferential. For sufficiency, we show that if the subdifferential condition holds for an orbit-isometric embedding, it corresponds to the variational characterization. To strengthen this, we will include a dedicated proposition in Section 4 that proves the subdifferential inclusion is preserved under the orbit-isometric relaxation by demonstrating that the supporting hyperplanes or subgradients align due to the symmetry reduction. This will confirm that the characterization remains valid. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; derivation introduces independent framework and certification

full rationale

The paper defines lower/upper conformal rigidity directly from the variational properties of Laplacian eigenvalues under normalized edge weights. It unifies this with the known (external) characterization via edge-isometric spectral embeddings and introduces the new, weaker orbit-isometric condition plus subdifferential language as sufficient for rigidity. For vertex-transitive graphs the single-eigenvector certification is derived via representation-theoretic reduction of the orbit condition; this step is presented as new content resolving an open question rather than a tautological renaming or self-citation reduction. No equations are shown to be equivalent by construction to fitted inputs, no ansatz is smuggled via self-citation, and the central claims retain independent mathematical content beyond the starting definitions. The derivation is therefore self-contained against external benchmarks.

Assumptions & free parameters 0 free parameters · 1 assumptions · 1 invented entities

The framework rests on standard definitions of the Laplacian and normalized edge weights plus the new notions of orbit-isometry and subdifferential characterization; no free parameters are introduced in the abstract.

assumptions (1)
  • domain assumption G is a connected undirected graph
    Stated at the opening of the definition of lower/upper conformal rigidity.
invented entities (1)
  • orbit-isometric embedding
    purpose: Weaker geometric condition than edge-isometry that still certifies conformal rigidity while respecting graph symmetries
    Newly defined in the paper to enable symmetry reduction and single-eigenvector certification.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries." pith.science (2026). https://pith.science/paper/JPKIDMFI

@misc{pith2026260515017,
  author       = {Pith},
  title        = {Pith review of: Conformal Rigidity of Graphs: Subdifferentials and Orbit-Isometries},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JPKIDMFI}},
  note         = {Machine review of arXiv:2605.15017}
}
abstract

A connected undirected graph $G = (V,E)$ is lower conformally rigid if uniform edge weights maximize the second smallest Laplacian eigenvalue $\lambda_2(w)$ over all normalized edge weights $w$, and upper conformally rigid if uniform edge weights minimize the largest eigenvalue $\lambda_n(w)$ over all normalized edge weights; $G$ is conformally rigid if it is lower or upper conformally rigid. This paper establishes a new framework for conformal rigidity through the language of subdifferentials, unifying the variational perspective on eigenvalue optimization with the geometry of edge-isometric spectral embeddings, which are known to characterize conformal rigidity. This subdifferential framework lends itself naturally to techniques of symmetry reduction that motivate the notion of an orbit-isometric embedding - a weaker condition than edge-isometry that accounts for the symmetries of $G$ while remaining sufficient for conformal rigidity. The notion opens the door to tools from representation theory: for a large class of graphs, including all vertex-transitive ones, we show that conformal rigidity is certified by a single eigenvector, resolving an open question and explaining the conformal rigidity of previously unexplained graphs. This extra structure enables a new, algebraically exact certification method for conformal rigidity, bypassing the numerical difficulties of prior approaches. In many cases, the problem reduces to a check of linear feasibility, and in general, to solving a system of quadratic equations via Gr\"{o}bner bases.

Figures

Figures reproduced from arXiv: 2605.15017 by the authors.

Figure 1
Figure 1. The barbell graph with uniform edge weights (left) and a weight redistribution that strictly increases λ2 (right). This shows that the barbell graph is not lower conformally rigid. This example suggests that for a graph G to be lower conformally rigid, there cannot be any asymmetries in the density of the graph; otherwise we could shift weight from denser regions to sparser regions. Thus, for G to be lower conformal… view at source ↗
Figure 2
Figure 2. The friendship graph F3 with uniform edge weights (left) and a weight redistribution that strictly decreases λn (right). This shows that F3 is not upper conformally rigid. As in the case of lower conformal rigidity, every edge of G must look the same to λn to be upper conformally rigid. Since λn measures the most oscillatory function on G, roughly speaking, we do not want hubs or asymmetries in the degrees of vertic… view at source ↗
Figure 3
Figure 3. A lower conformally rigid graph (A), an upper con￾formally rigid graph (B), and a lower and upper conformally rigid graph (C) (also known as the Desargues graph). 4 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (11 more)
Figure 4
Figure 4. Figure 4: Cay(Z21, {1, 6}) and edge-isometric embeddings on Eλ2 and Eλn . To certify lower conformal rigidity, we must find eigenvectors φi ∈ Eλ2 such that (2) holds for all m = 42 edges. One can verify that λ2 = 4(1 − cos (2π/7)) with multiplicity 2. The following eigenvectors …
Figure 5
Figure 5. Figure 5: The map i 7→ i+ 7 (mod 21) is a graph automorphism of G = Cay(Z21, {1, 6}). Edge orbits are labeled by color. notion of an orbit-isometric spectral embedding as the symmetry reduced analogue of edge-isometric embeddings. Definition 2.6. We call a spectral embedding P o…
Figure 6
Figure 6. Figure 6: Edge lengths of Cay(Z21, {1, 6}) under the orbit￾isometric embedding given by φ1  . for some c ∈ R. Instead of finding a collection of eigenvectors satisfying 42 con￾straints, we now just have to satisfy 2 constraints. Here, the single eigenvector φ1 = (cos (2πj/7))20…
Figure 7
Figure 7. Figure 7: G = Cay(Z12, {2, 3}) with color-coded edge orbits. for k = 1, 4, 5. Since G is an abelian Cayley graph, we know that the set of orbit￾energy distributions ℓZ12 (Eλ2 ) = {ℓZ12 (φ) : φ ∈ Eλ2 } ⊆ R 2 is a convex polyhedral cone. We will later show that this cone has extre…
Figure 12
Figure 12. Figure 12: Lower conformal rigidity certificate to (12) for the graph on 8000 vertices. vertices, we achieved the runtimes shown in [PITH_FULL_IMAGE:figures/full_fig_p030_12.png]
Figure 13
Figure 13. Figure 13: Valid (x0, x2) values for orbit-isometric embeddings of G on Eλ2 . Points indicate the embeddings used in [PITH_FULL_IMAGE:figures/full_fig_p032_13.png]
Figure 14
Figure 14. Figure 14: The graph P25.01 (HoG 56682). The previous example illustrates that some conformally rigid graphs are degen￾erate in the sense that their relevant eigenspace Eλ is so large that they are still conformally rigid even in the absence of a large automorphism group. Intuit…
Figure 15
Figure 15. Figure 15: ℓZ12 (Eλ2 ) for G = Cay(Z12, {2, 3}), with solution eigenvector φ = φ 1 1 + √ 1 3 φ 4 1 . The line c · (12, 12), c > 0 is in red. Example 2.7 (continued). We can now fully explain our exact certificate of lower conformal rigidity of G = Cay(Z12, {2, 3}). The group Z12…
Figure 16
Figure 16. Figure 16: Non-Cayley vertex-transitive (20, 10) graph: spring layout (left), PCA-projections of edge-isometric symmetrized em￾beddings on Eλ2 (center) and Eλn (right). Example 7.6. Let G be the non-Cayley, vertex-transitive graph (20, 10) on n = 20 vertices from Mathematica (Ho…
Figure 17
Figure 17. Figure 17: Exact rank-1 lower conformal rigidity certificate φφT to (24) for the graph on 8000 vertices. Even when Eλ does not decompose into distinct irreducibles, it is clear that Cone {ℓΨ(φj ) : 1 ≤ j ≤ h} is always a subset of ℓΨ(Eλ). Thus, we can always check this polyhedra…
Figure 18
Figure 18. Figure 18: Symmetry reduction flowchart 7.3. Symmetry Reduction Pipeline. We now give a summary of our entire symmetry reduction pipeline shown in the flowchart shown in [PITH_FULL_IMAGE:figures/full_fig_p049_18.png]

Discussion (0). Continue with ORCID to comment.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

48 extracted references · 48 canonical work pages

  1. [1]

    Catherine Babecki, Stefan Steinerberger, and Rekha R. Thomas. Spectrahedral geometry of graph sparsifiers.SIAM J. Discrete Math., 39(1):449–483, 2025

    work page 2025

  2. [2]

    Symmetrization in Analysis

    Albert II Baernstein, David Drasin, and Richard S. Laugesen.Symmetrization in analysis. With a foreword by Walter Hayman, volume 36 ofNew Math. Monogr.Cambridge: Cam- bridge University Press, 2019

    work page 2019

  3. [3]

    Lectures on Modern Convex Optimization

    Aharon Ben-Tal and Arkadi Nemirovski.Lectures on modern convex optimization. MPS/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Programming Society (MPS), Philadelphia, PA, 2001. Anal- ysis, algorithms, and engineering applications

    work page 2001

  4. [4]

    A Survey of Maximal k-Degenerate Graphs and k-Trees

    Allan Bickle. A survey of maximalk-degenerate graphs andk-trees.Theory and Applications of Graphs, 0(1):Article 5, 2024

    work page 2024

  5. [5]

    Jacek Bochnak, Michel Coste, and Marie-Fran¸ coise Roy.Real algebraic geometry. Transl. from the French., volume 36 ofErgeb. Math. Grenzgeb., 3. Folge. Berlin: Springer, rev. and updated ed. edition, 1998

    work page 1998

  6. [6]

    Introduction to applied linear algebra

    Stephen Boyd and Lieven Vandenberghe.Convex optimization. Cambridge University Press, Cambridge, 2004

    work page 2004

  7. [7]

    All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9

    Stephan Brandt, Gunnar Brinkmann, and Thomas Harmuth. All Ramsey numbersr(K 3, G) for connected graphs of order 9.Electron. J. Comb., 5(1):research paper r7, 20, 1998

    work page 1998

  8. [8]

    Lie Groups and Lie Algebras

    Theodor Br¨ ocker and Tammo tom Dieck.Representations of compact Lie groups, volume 98 ofGrad. Texts Math.Springer, Cham, 1985

    work page 1985

Show all 48 references
  1. [9]

    Paulus-rozenfield graphs.https://aeb.win.tue.nl/graphs/Paulus.html, 1973–present

    Andries Brouwer. Paulus-rozenfield graphs.https://aeb.win.tue.nl/graphs/Paulus.html, 1973–present. Accessed: 2026-02-17

    1973

  2. [10]

    Bussemaker and Dragoˇ s M

    Frans C. Bussemaker and Dragoˇ s M. Cvetkovic. There are exactly 13 connected, cubic, inte- gral graphs.Publ. Fac. ´Electrotech. Univ. Belgrade, S´ er. Math. Phys., 544-576:43–48, 1977

    1977

  3. [11]

    On the order-diameter ratio of girth-diameter cages

    Stijn Cambie, Jan Goedgebeur, Jorik Jooken, and Tibo Van den Eede. On the order-diameter ratio of girth-diameter cages. Preprint, arXiv:2511.21144 [math.CO] (2025), 2025

    2025

  4. [12]

    Fan R. K. Chung.Spectral graph theory, volume 92 ofReg. Conf. Ser. Math.Providence, RI: AMS, American Mathematical Society, 1997

    1997

  5. [13]

    George E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic de- composition. InAutomata theory and formal languages (Second GI Conf., Kaiserslautern, 1975), Lecture Notes in Comput. Sci., Vol. 33, pages 134–183. Springer, Berlin-New York, 1975

    1975

  6. [14]

    House of Graphs 2.0: A database of interesting graphs and more.Discrete Applied Mathematics, 325:97–107, 2023

    Kris Coolsaet, Sven D’hondt, and Jan Goedgebeur. House of Graphs 2.0: A database of interesting graphs and more.Discrete Applied Mathematics, 325:97–107, 2023

    2023

  7. [15]

    An introduction to computational algebraic geometry and commutative algebra.Undergraduate Texts Math

    David Cox, John Little, and Donal O’Shea.Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra.Undergraduate Texts Math. New York, NY: Springer, 2nd ed. edition, 1996. 50

    1996

  8. [16]

    Exploiting special structure in semidefinite programming: A survey of theory and applications.European J

    Etienne de Klerk. Exploiting special structure in semidefinite programming: A survey of theory and applications.European J. Oper. Res., 201(1):1–10, 2010

    2010

  9. [17]

    Attainable bounds for algebraic connectivity and maximally connected regular graphs.J

    Geoffrey Exoo, Theodore Kolokolnikov, Jeanette Janssen, and Timothy Salamon. Attainable bounds for algebraic connectivity and maximally connected regular graphs.J. Graph Theory, 107(3):522–549, 2024

    2024

  10. [18]

    Farenick and Barbara A

    Douglas R. Farenick and Barbara A. F. Pidkowich. The spectral theorem in quaternions. Linear Algebra Appl., 371:75–102, 2003

    2003

  11. [19]

    Some minimax problems for graphs.Discrete Math., 121(1-3):65–74, 1993

    Miroslav Fiedler. Some minimax problems for graphs.Discrete Math., 121(1-3):65–74, 1993

    1993

  12. [20]

    A first course, volume 129 ofGrad

    William Fulton and Joe Harris.Representation theory. A first course, volume 129 ofGrad. Texts Math.New York etc.: Springer-Verlag, 1991

    1991

  13. [21]

    Karin Gatermann and Pablo A. Parrilo. Symmetry groups, semidefinite programs, and sums of squares.J. Pure Appl. Algebra, 192(1-3):95–128, 2004

    2004

  14. [22]

    Texts Math

    Chris Godsil and Gordon Royle.Algebraic graph theory, volume 207 ofGrad. Texts Math. New York, NY: Springer, 2001

    2001

  15. [23]

    Exhaustive generation of edge-girth-regular graphs

    Jan Goedgebeur and Jorik Jooken. Exhaustive generation of edge-girth-regular graphs. Preprint, arXiv:2401.08271 [math.CO] (2024), 2024

    2024

  16. [24]

    Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.Math

    Frank G¨ oring, Christoph Helmberg, and Susanna Reiss. Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian.Math. Program., 131(1-2 (A)):95–111, 2012

    2012

  17. [25]

    Embedded in the shadow of the separator.SIAM J

    Frank G¨ oring, Christoph Helmberg, and Markus Wappler. Embedded in the shadow of the separator.SIAM J. Optim., 19(1):472–501, 2008

    2008

  18. [26]

    Jo˜ ao Gouveia, Stefan Steinerberger, and Rekha R. Thomas. Conformal Rigidity and Spectral Embeddings of Graphs. Preprint, arXiv:2506.20541 [math.CO] (2025), 2025

    2025

  19. [27]

    Part 1: Fundamentals, volume 305 ofGrundlehren Math

    Jean-Baptiste Hiriart-Urruty and Claude Lemar´ echal.Convex analysis and minimization algorithms. Part 1: Fundamentals, volume 305 ofGrundlehren Math. Wiss.Berlin: Springer- Verlag, 1993

    1993

  20. [28]

    Grundlehren Text Edit

    Jean-Baptiste Hiriart-Urruty and Claude Lemar´ echal.Fundamentals of convex analysis. Grundlehren Text Edit. Berlin: Springer, 2001

    2001

  21. [29]

    Horn and Charles R

    Roger A. Horn and Charles R. Johnson.Matrix analysis.Cambridge: Cambridge University Press, 2nd ed. edition, 2013

    2013

  22. [30]

    On vertex-girth-regular graphs: (non-)existence, bounds and enumeration.Electron

    Robert Jajcay, Jorik Jooken, and Istv´ an Porups´ anszki. On vertex-girth-regular graphs: (non-)existence, bounds and enumeration.Electron. J. Comb., 32(4):research paper p4.51, 27, 2025

    2025

  23. [31]

    A faster interior point method for semidefinite programming

    Tarun Kathuria, Swati Padmanabhan, Yin Tat Lee, Haotian Jiang, and Zhao Song. A faster interior point method for semidefinite programming. InProceedings of the 61st annual IEEE symposium on foundations of computer science, FOCS 2020, virtual conference, November 16–19, 2020, p...

    2020

  24. [32]

    Small Ram- sey numbers for books, wheels, and generalizations.Electron

    Bernard Lidick´ y, Gwen McKinley, Florian Pfender, and Steven Van Overberghe. Small Ram- sey numbers for books, wheels, and generalizations.Electron. J. Comb., 32(4):research paper p4.64, 20, 2025

    2025

  25. [33]

    Mayr and Albert R

    Ernst W. Mayr and Albert R. Meyer. The complexity of the word problems for commutative semigroups and polynomial ideals.Adv. in Math., 46(3):305–329, 1982

    1982

  26. [34]

    MOSEK ApS.MOSEK Optimization Library Version 11.1, 2026

    2026

  27. [35]

    Joint numerical ranges: recent advances and applications minicourse by V

    Vladim´ ır M¨ uller and Yuri Tomilov. Joint numerical ranges: recent advances and applications minicourse by V. M¨ uller and Yu. Tomilov.Concr. Oper., 7:133–154, 2020

    2020

  28. [36]

    Andrew Niu, 2026.https://github.com/andrewmniu/conformally-rigid-graphs

    2026

  29. [37]

    Alex Fax, and Richard M

    Reza Olfati-Saber, J. Alex Fax, and Richard M. Murray. Consensus and cooperation in net- worked multi-agent systems.Proc. IEEE, 95(1):215–233, 2007

    2007

  30. [38]

    Extremal graph realizations and graph Laplacian eigenvalues.SIAM J

    Braxton Osting. Extremal graph realizations and graph Laplacian eigenvalues.SIAM J. Dis- crete Math., 37(3):1630–1644, 2023

    2023

  31. [39]

    Princeton Ser

    Leiba Rodman.Topics in quaternion linear algebra. Princeton Ser. Appl. Math. Princeton, NJ: Princeton University Press, 2014

    2014

  32. [40]

    Translated from the French by Leonard L

    Jean-Pierre Serre.Linear representations of finite groups. Translated from the French by Leonard L. Scott, volume 42 ofGrad. Texts Math.Springer, Cham, 1977

    1977

  33. [41]

    Stefan Steinerberger and Rekha R. Thomas. Conformally rigid graphs.J. Graph Theory, 109(3):366–386, 2025. 51

    2025

  34. [42]

    The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem.SIAM Rev., 48(4):681– 699, 2006

    Jun Sun, Stephen Boyd, Lin Xiao, and Persi Diaconis. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem.SIAM Rev., 48(4):681– 699, 2006

    2006

  35. [43]

    The Sage Developers.SageMath, the Sage Mathematics Software System (Version 10.7), 2025.https://www.sagemath.org

    2025

  36. [44]

    Symmetry in semidefinite programs.Linear Algebra Appl., 430(1):360–369, 2009

    Frank Vallentin. Symmetry in semidefinite programs.Linear Algebra Appl., 430(1):360–369, 2009

    2009

  37. [45]

    West.Introduction to graph theory

    Douglas B. West.Introduction to graph theory. New Delhi: Prentice-Hall of India, 2nd ed. edition, 2005

    2005

  38. [46]

    Exploring structure and randomness

    Yufei Zhao.Graph theory and additive combinatorics. Exploring structure and randomness. Cambridge: Cambridge University Press, 2023

    2023

  39. [47]

    Zwierzy´ nski

    Krzysztof T. Zwierzy´ nski. Generating integral graphs using PRACE research infrastructure. Technical white paper, Partnership for Advanced Computing in Europe (PRACE), 2013

    2013

  40. [48]

    Alexander A. Zykov. ¨Uber einige Eigenschaften der Streckenkomplexe.Mat. Sb., Nov. Ser., 24:163–188, 1949. Department of Mathematics, University of W ashington, Seattle W A 98195 Email address:amniu@uw.edu 52

    1949

Pith tools

Reviewed May 15, 2026 · model on record in the stance chip above.