Divides with cusps, shadows, and transvergent diagrams
Pith reviewed 2026-05-23 02:03 UTC · model grok-4.3
The pith
Divides with gleams convert transvergent diagrams of symmetric links into divides with cusps and back while preserving link type.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By introducing divides with gleams, which augment A'Campo's divides with Turaev shadow data called gleams, the paper constructs two algorithms: one that produces a divide with cusps from a given transvergent diagram of a symmetric link, and one that produces a transvergent diagram from a given divide with cusps, such that both diagrams represent the identical symmetric link in S^3.
What carries the argument
Divides with gleams, which generalize A'Campo's divides by adding gleam data from Turaev's shadows to record the information needed to maintain symmetry across conversions.
If this is right
- Every symmetric link presented by a transvergent diagram admits a divide-with-cusps representation.
- Every divide with cusps corresponds to a symmetric link that admits a transvergent diagram.
- The link type and the rotational symmetry are unchanged by either conversion.
- Symmetric links therefore possess two fully interchangeable diagrammatic languages connected by explicit, algorithmic translations.
Where Pith is reading between the lines
- One could now compute invariants of symmetric links in whichever of the two diagrams makes the calculation simpler, then transfer the result back.
- The same gleam-augmented construction might adapt to other symmetry groups or to links in other three-manifolds.
- Explicit examples produced by the algorithms could be used to test conjectures that are easier to state in one representation than the other.
Load-bearing premise
That the gleam data added in the intermediate divides with gleams correctly tracks and preserves both the link type and the pi rotational symmetry at every step of the two algorithms.
What would settle it
A concrete transvergent diagram to which the first algorithm is applied, yielding a divide with cusps whose associated link is either not symmetric or isotopic to a different link than the original.
Figures
read the original abstract
A link $L$ in $S^3$ is called a symmetric link if it is preserved by a $\pi$ rotation around a closed geodesic in $S^3$. Any symmetric link can be depicted by a diagram with a symmetry axis lying on the plane of the diagram, called a transvergent diagram. Recently, Sugawara proved that any symmetric link can be represented by a divide with cusps, which is a generalization of A'Campo's divide that allows a finite number of cusps. In this paper, we introduce a generalization of A'Campo's divide in terms of Turaev's shadow, called a divide with gleams. By using divides with gleams, we provide an algorithm to obtain a divide with cusps that represents a symmetric link from its given transvergent diagram. Conversely, we also provide an algorithm to draw a transvergent diagram of the link of a given divide with cusps.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper introduces divides with gleams, a generalization of A'Campo's divides via Turaev shadows, and asserts the existence of two algorithms: one converting a given transvergent diagram of a symmetric link into a divide with cusps (via gleams), and the converse. Both are claimed to preserve the represented link type and the symmetry.
Significance. If the algorithms and their correctness proofs are supplied and verified, the work would furnish explicit, bidirectional translations between transvergent diagrams and divides-with-cusps representations of symmetric links, extending Sugawara's existence result and potentially enabling new computational or classification tools in the study of symmetric links.
major comments (1)
- The central claim consists in the explicit construction and correctness of the two conversion algorithms. The supplied text asserts their existence but contains no step-by-step constructions, no verification that link type and symmetry are preserved at each stage, and no proof that the intermediate divides-with-gleams objects are well-defined. This absence renders the main theorem unsupported.
Simulated Author's Rebuttal
We thank the referee for the detailed report and for identifying the central issue with the presentation of our algorithms. We agree that the main theorem requires explicit constructions and verifications to be fully supported, and we will revise the manuscript accordingly.
read point-by-point responses
-
Referee: The central claim consists in the explicit construction and correctness of the two conversion algorithms. The supplied text asserts their existence but contains no step-by-step constructions, no verification that link type and symmetry are preserved at each stage, and no proof that the intermediate divides-with-gleams objects are well-defined. This absence renders the main theorem unsupported.
Authors: We accept this assessment. The current manuscript states the existence of the algorithms but does not supply the required step-by-step constructions, intermediate verifications, or proofs of well-definedness. In the revised version we will add these details: Section 3 will contain the explicit algorithm converting a transvergent diagram to a divide with gleams (with gleam assignments and cusp placements), followed by a proof that the resulting object is well-defined and represents the same symmetric link; Section 4 will contain the converse algorithm together with the corresponding preservation arguments. These additions will make the main theorem fully supported. revision: yes
Circularity Check
No significant circularity detected
full rationale
The paper's central contribution consists of explicit constructive algorithms that convert between transvergent diagrams and divides with cusps via the auxiliary notion of divides with gleams. These constructions are presented directly without any fitted parameters, self-definitional equations, or load-bearing self-citations. The cited results from Sugawara (on divides with cusps) and Turaev (on shadows) are independent prior work and are not invoked to justify uniqueness or to close a derivation loop. The equivalence of link types and preservation of symmetry are asserted to follow from the step-by-step definitions of the algorithms themselves, making the derivation self-contained.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Standard definitions and properties of symmetric links, transvergent diagrams, A'Campo's divides, and Turaev shadows hold as stated in the referenced literature.
invented entities (1)
-
divide with gleams
no independent evidence
Reference graph
Works this paper leans on
-
[1]
A’Campo, N., Generic immersions of curves, knots, monod romy and Gordian number, Inst. Hautes ´Etudes Sci. Publ. Math. No. 88 (1998), 151–169
work page 1998
-
[2]
Boyle, K., Issa, A., Equivariant 4-genera of strongly in vertible and periodic knots, J. Topol. 15 (2022), no. 3, 1635–1674
work page 2022
-
[3]
Carrega, A., Martelli, B., Shadows, ribbon surfaces, an d quantum invariants, Quantum Topol. 8 (2017), no. 2, 249–294
work page 2017
-
[4]
V., Diagrams of divide links, Proc
Chmutov, S. V., Diagrams of divide links, Proc. Amer. Mat h. Soc. 131 (2003), no. 5, 1623–1627. 30 RYOGA FURUTANI
work page 2003
-
[5]
P., 3-manifolds efficiently bound 4-manifolds, J
Costantino, F., Thurston, D. P., 3-manifolds efficiently bound 4-manifolds, J. Topol. 1 (2008), no. 3, 703–745
work page 2008
-
[6]
Furutani, R., Koda, Y., Divides and hyperbolic volumes, to appear in Ann. Sc. Norm. Super. Pisa Cl. Sci. (5)
-
[7]
H., Ishikawa, M., Links of oriented divides an d fibrations in link exteriors, Osaka J
Gibson, W. H., Ishikawa, M., Links of oriented divides an d fibrations in link exteriors, Osaka J. Math. 39 (2002), no. 3, 681–703
work page 2002
-
[8]
Hirasawa, M., Visualization of A’Campo’s fibered links a nd unknotting operation, Proceedings of the First Joint Japan-Mexico Meeting in Topology (Morelia, 1999), Topology Appl. 121 (2002), no. 1–2, 287–304
work page 1999
-
[9]
Hirasawa, M., Hiura, R., and Sakuma, M., Invariant Seife rt surfaces for strongly invertible knots, in Essays in geometry—dedicated to Norbert A’Campo, 325–349, IRMA Lect. Math. Theor. Phys., 34, EMS Press, Berlin
-
[10]
Ishikawa, M., Tangent circle bundles admit positive op en book decompositions along arbitrary links, Topology 43 (2004), no. 1, 215–232
work page 2004
-
[11]
Ishikawa, M., Naoe, H., Milnor fibration, A’Campo’s div ide and Turaev’s shadow, Singularities— Kagoshima 2017, 95–116, World Sci. Publ., Hackensack, NJ, 2 020
work page 2017
- [12]
- [13]
-
[14]
R., Fixed point free involutions on the 3-sp here, Ann
Livesay, G. R., Fixed point free involutions on the 3-sp here, Ann. of Math. (2) 72 (1960), 603– 611
work page 1960
-
[15]
Martelli, B., Four-manifolds with shadow-complexity zero, Int. Math. Res. Not. IMRN 2011 (2011), no. 6, 1268–1351
work page 2011
-
[16]
Naoe, H., Shadows of 4-manifolds with complexity zero a nd polyhedral collapsing, Proc. Amer. Math. Soc. 145 (2017), no. 10, 4561–4572
work page 2017
-
[17]
Sugawara, S., Divides with cusps and symmetric links, T opology Appl. 362 (2025), Paper No. 109207
work page 2025
-
[18]
Sugawara, S., Yoshinaga, M., Divides with cusps and Kir by diagrams for line arrangements, Topology Appl. 313 (2022), Paper No. 107989, 17 pp
work page 2022
-
[19]
Turaev, V. G., Quantum invariants of knots and 3-manifolds, De Gruyter Studies in Mathemat- ics, 18, Walter de Gruyter & Co., Berlin, 1994. Department of Mathematics / International Institute for Su stainability with Knot- ted Chiral Meta Matter (WPI-SKCM 2), Hiroshima University, 1-3-1 Kagamiyama, Higashi- Hiroshima, Hiroshima 739-8526, Japan Email addre...
work page 1994
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.