Pith. sign in

REVIEW 4 major objections 5 minor 25 references

Quasitoric representation of generalized braids

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read Quasitoric braids close every normal generalized link

desk verdict A promising unification of quasitoric representation theorems, but the central algebra lemma appears to be false as written, so the main results are not yet established. read the letter →

arxiv 2411.18783 v1 pith:3BPESEKX submitted 2024-11-27 math.GT math.GR

Neha Nanda , Manpreet Singh This is my paper · ORCID
classification math.GTmath.GR MSC 57K1020F36
keywords GeneralizedbraidtheoryQuasitoricAlexandertheoremPuregroupNormalknotReidemeister-SchreierMarkovmovesVirtualknots
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

This paper works in a generalised knot theory framework in which crossings carry tags and each theory chooses which diagram moves are allowed. It defines generalized braid theories and shows that in any normal one—a theory with a dominant tag $x$ that can be moved through every other crossing—the pure braid group has a uniform finite generating set. Using that generating set, the main theorem proves that every oriented normal generalized link is the closure of a quasitoric normal generalized braid, and that the quasitoric generalized braids on $n$ strands form a subgroup. The result is a single Alexander-closure statement that specializes to classical, virtual, welded, singular, universal, and virtual-doodle links.

What carries the argument

The load-bearing mechanism is the dominant tag $x$ together with the detour move: in a normal generalized braid theory, $x$ can be slid past every other tag, so a strand carrying $x$ acts as a highway along which crossings can be rearranged without changing the braid. On top of this, the quasitoric normal form is the central object—a braid built from descending blocks $y_{p-1}\cdots y_1$. The argument uses the Reidemeister–Schreier method to obtain the pure generating set $S$, whose elements are conjugates of single-tag crossings by $x$-words; each element is then exhibited as a quasitoric product, and the detour move upgrades any $(i,j)$-quasitoric piece to an $n$-quasitoric one.

What would settle it

Produce a normal generalized braid theory and an oriented link in it whose closure is not equivalent to any quasitoric braid, or, more locally, exhibit a normal theory in which the conjugation formulas of Lemma 3.2 fail for some tag $a$, so the pure generating set $S$ of Theorem 3.3 misses a generator and the quasitoric decomposition of Theorem 4.5 cannot get started.

Watch

Extended reading notes

Core claim

The paper's central claim is Theorem 4.6: for every oriented normal generalized link $L$ there is a strand count $m$ and a quasitoric normal generalized braid whose closure is equivalent to $L$. A quasitoric generalized braid is one written as a product of descending blocks, $\beta = \beta_1\cdots\beta_q$ with $\beta_j = y_{j,p-1}\cdots y_{j,1}$, where each $y$ is an elementary generator of arbitrary tag. The proof passes through the pure subgroup: Theorem 3.3 gives the generating set $S = \{a^\lambda_{i,j},\, a^\lambda_{j,i},\, x^\lambda_{i,j} \mid 1 \le i < j \le n\}$, with $x$ the dominant tag and $a$ any other tag, and shows each such generator is quasitoric. Markov moves then arrange that an arbitrary link can be represented by a braid whose permutation is a power of an $m$-cycle, so its pure part falls into the quasitoric class. Theorem 4.7 completes the picture by proving that the quasitoric normal generalized braids on $n$ strands form a subgroup of the normal generalized braid group.

Load-bearing premise

The whole construction rests on the assumption that every normal generalized braid theory has a dominant tag $x$ that can be pulled through all other crossing types; if even one tag fails to be dominated, the generating set $S$ and the quasitoric decomposition do not follow.

Editorial extensions

If this is right

  • Theorem 4.6 gives one Alexander closure theorem for every normal generalized braid theory, so classical, virtual, welded, singular, universal, and virtual-doodle links all admit quasitoric braid closures.
  • Theorem 3.3 supplies the same finite generating set template for the pure subgroup in every normal theory, so structural questions such as abelianization, automorphisms, or representations can be attacked uniformly.
  • Theorem 4.7 means the quasitoric generalized braids on $n$ strands form an honest subgroup, so closure operations, word-length questions, and other braid-group tools can be restricted to this subclass.
  • The proof path—braid closure, making the permutation a power of an $m$-cycle, then decomposing the pure part—provides a constructive route from any link diagram to a quasitoric braid representative.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Going beyond the paper, the same Reidemeister–Schreier calculation could be pushed to a full presentation of the pure generalized braid group in any normal theory where the relations of Remark 2.4 are complete.
  • The subgroup theorem suggests defining a quasitoric braid index for generalized links, extending the classical index that has been used for knot invariants and unknotting-number bounds.
  • A testable extension is to ask whether the word problem for the quasitoric subgroup is solvable in concrete theories such as virtual, welded, or singular braids, using classical quasitoric algorithms as a template.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

4 major / 5 minor

Summary. The paper develops a common framework for generalized braid theories in the sense of Fenn and Bartholomew, defines the pure generalized braid group, and proposes a finite generating set S via the Reidemeister-Schreier method. It then introduces quasitoric generalized braids and claims that every pure normal generalized braid is quasitoric (Theorem 4.5), that every oriented normal generalized link is the closure of a quasitoric normal generalized braid (Theorem 4.6), and that the set of quasitoric normal generalized braids forms a subgroup (Theorem 4.7).

Significance. If the main theorems are correct, Theorem 4.6 would unify Alexander-type closure theorems for classical, virtual, welded, singular, and other normal generalized braid theories, and Theorem 3.3 would provide a uniform generating set for their pure subgroups. The paper's strategy of using the detour move from [BF22] and the Reidemeister-Schreier method is well motivated, and the examples show that the framework covers many known theories. However, the manuscript as it stands contains substantial gaps in the algebraic lemmas on which the main theorems rest, so the significance is conditional on a successful repair.

major comments (4)
  1. [§3, Lemma 3.2] The proof of Lemma 3.2, case (ii) of the first list, asserts x^{-1}_{i-1} a^λ_{i,i+1} x_{i-1} = a^λ_{i-1,i+1}. From the definitions, a^λ_{i-1,i+1} = x^{-1}_i(a_{i-1}x_{i-1})x_i, while the displayed computation in the proof ends with x_i a_{i-1} x_{i-1} x^{-1}_i after an unproved second equality. These two expressions are not equal in general under relations (1)-(4); in the virtual braid group, one of the paper's own examples, the analogous identity fails. Since Lemma 3.2 is the bridge from the Reidemeister-Schreier generators to the finite set S in Theorem 3.3, the pure-braid generation theorem is not established, and Theorems 4.5-4.7 inherit the gap.
  2. [§4, Theorem 4.5] The displayed factorization of a^λ_{i,j} into a product of bracketed terms is asserted without proof. The first factor is x^{-1}_{j-1}...x^{-1}_{i+1}a_i and the second begins with x_{j-1}...x_i; rearranging a_i past the block x_i...x_{j-1} requires braid and mixed relations beyond those stated in (1)-(4). Figures 17 and 18 are schematic and do not supply the missing algebraic justification. Because Theorem 4.5 is the step that shows every pure normal generalized braid is quasitoric, this is a load-bearing gap.
  3. [§4, Theorem 4.6] The reduction of π_m(β') to a power of the cyclic permutation (1 2 ... m) is not justified. The claim that M2 'adds n+1 to the orbit containing n' is imprecise: the effect of the Markov move on the permutation is to add a new fixed point and, if the new crossing is included, to multiply by a transposition that may merge orbits. Moreover, a power of an m-cycle has a restricted cycle type, and the proof does not show that arbitrary cycle types can be converted into such a form; the definition of β'' requires π(β') to be exactly that power, not merely conjugate to it.
  4. [§4, definition of quasitoric generalized braid] The defining condition for a quasitoric generalized braid writes y_{j,i} ∈ {a_i, \bar a_i, b_i, \bar b_i, ...}, but Section 3 uses the letter a for non-dominant tags only, while the example in Figure 12 and Lemma 4.2 use the dominant tag x inside the blocks. If x is not allowed, Lemmas 4.2 and 4.4 are false; if x is allowed, the definition must state this explicitly. This ambiguity directly affects the statement and proof of the main theorems.
minor comments (5)
  1. [Remark 2.4] Equation (2) contains a typo: 'xixj = = xjxi' should be 'xixj = xjxi'.
  2. [Lemma 3.2] In the first part of the proof, there are two items labeled (iii); the second should be labeled (iv).
  3. [Lemma 3.1] In the cancellation case, the step replacing x_{i_j} by x_i is not explained; a sentence justifying it in terms of the projection to the symmetric group would improve clarity.
  4. [Theorem 4.5] The statement says '1 ≤ i < j ≤ n − 1' for the generators, but the set S defined in Section 3 allows j ≤ n; this is likely a typo.
  5. [Introduction] The sentence 'More recently, Genki [Omo24] computed...' should cite the author's full name, as done in the bibliography as 'Genki Omori'.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular dependency: the quasitoric closure theorem derives from the external [BF22] framework and an independent Reidemeister-Schreier computation.

full rationale

The derivation chain is self-contained relative to its stated framework. Theorem 4.6 invokes [BF22, Theorem 6.1] as an external Alexander-theorem input, then uses only M1 and M2 moves to pass to a cyclic permutation and Theorem 4.5 to replace the pure part by a quasitoric braid. Theorem 4.5 is not circular: the generating set S in Theorem 3.3 is obtained by Reidemeister-Schreier from the assumed relations (1)-(4), and the proof that each generator is quasitoric is an explicit word decomposition into descending blocks, not a restatement of the definition of quasitoric. No parameter is fitted and no target result is assumed in an input. The only self-citation is [NNS23], cited in the introduction as one of several existing generating-set results with which the new set aligns; it is not used in any proof and is not load-bearing. A reviewer concern that Lemma 3.2's conjugation identities, particularly the k = i-1 case, do not follow from relations (1)-(4) is a proof-gap or correctness issue in the printed computation, not a circularity: the theorem could be repaired by a correct computation or a different generating set, and the gap does not make Theorem 4.6 equivalent to its assumptions. Score 1 reflects the contextual self-citation only; there is no circular step.

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

No fitted parameters or invented entities. The derivation is a combinatorial group theory argument over the Fenn-Bartholomew framework; its main axioms are the dominance relations of a normal braid theory and the detour move. These are external assumptions from [BF22], not new postulates.

assumptions (4)
  • domain assumption Normal generalized braid theory has a dominant tag x with mixed relations (1)-(4) of Remark 2.4.
    Used throughout; the paper assumes any normal theory satisfies these relations, citing [BF22].
  • domain assumption The detour move (Lemma 2.7) holds for x-above and x-below paths.
    Imported from [BF22]; used in Lemmas 4.2 and 4.4 to slide strands.
  • domain assumption Every regular generalized knot is the closure of a regular generalized braid ([BF22, Theorem 6.1]).
    External theorem used in Theorem 4.6 to reduce links to braids.
  • standard math Reidemeister-Schreier rewriting gives a generating set for pure subgroups from a Schreier system.
    Used in Section 3 to derive the generating set S.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quasitoric representation of generalized braids." pith.science (2026). https://pith.science/paper/3BPESEKX

@misc{pith2026241118783,
  author       = {Pith},
  title        = {Pith review of: Quasitoric representation of generalized braids},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3BPESEKX}},
  note         = {Machine review of arXiv:2411.18783}
}
read the original abstract

In this paper, we define generalized braid theories in alignment with the language of Fenn and Bartholomew for knot theories, and compute a generating set for the pure generalized braid theories. Using this, we prove that every oriented normal generalized knot is the closure of a quasitoric normal generalized braid. Further, we prove that the set of quasitoric normal generalized braids forms a subgroup of normal generalized braid group.

Figures

Figures reproduced from arXiv: 2411.18783 by the authors.

Figure 1
Figure 1. R-moves [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Elementary braids for the tag a The kernel of the natural πn : gBn → Sn trailing end points of strands from top to bottom is called the pure braid group and is denoted by gPn. If there is some crossing type (tag) x such that R3(x, x, a) holds for some tag a, then we say that x dominates a. If there is some crossing type x such that R3(x, x, a) and R3(x, x, a) holds for all tags a, then x dominates the theory, see [… view at source ↗
Figure 3
Figure 3. The tag x dominates the tag a A regular braid theory with a dominant tag say x is called normal. Example 1. Here are a few examples braid theories existing in the literature. (i) Artin braid group theory. The classical crossings r and ¯r have glyph of arc break depicted the over and under arcs in the diagram as shown in [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (13 more)
Figure 4
Figure 4. Figure 4: The positive and negative real crossings denoted by tag r and ¯r (ii) Virtual braid group theory. The virtual crossing type v is depicted by glyph as shown in [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 6
Figure 6. Figure 6: The twin crossing depicted by t Remark 2.2. Apart from some examples given above, other known normal braid theories include welded (or loop) braids [FRR93], unrestricted braids [KL04], flat braids [KL04], (extended) singular braids [FKR98], virtual braids [Kau99] and v…
Figure 7
Figure 7. Figure 7: The allowed moves when the tag x dominates the theory Remark 2.6. Let y1, y2, . . . yq be arbitrary tags and the tags x1, x2, x3, x3 takes the values x or x¯ depending how the R2 move is allowed. Then the following move holds in normal braid theory, which will be used …
Figure 9
Figure 9. Figure 9: The portion of the subpath P illustrated is drawn with a thicker line. Similarly P is said to be x below if the only crossings it meets are of the two types on the right of [PITH_FULL_IMAGE:figures/full_fig_p005_9.png]
Figure 9
Figure 9. Figure 9: x above and x below paths Lemma 2.7 (Detour move). Let P be an x above/below subpath of a braided diagram D, where x dominates the theory, and let P ′ be a path with the same end points as P which crosses D in such a manner as to create an x above/below path. Then the …
Figure 11
Figure 11. Figure 11: The generators aλi,j , aλj,i and xλi,j for all tags a and dominant tag x. 10 [PITH_FULL_IMAGE:figures/full_fig_p010_11.png]
Figure 12
Figure 12. Figure 12: A 5-quasitoric braid given by β = (a4x3b2x1)(b −1 4 c3c −1 2 a1)(x4b3d2a −1 1 ) For positive integers i, j with 1 ≤ i < j ≤ n, an n strand braid β is called (i, j)-quasitoric braid with n strands if it has a braid diagram of the form shown in [PITH_FULL_IMAGE:figures…
Figure 13
Figure 13. Figure 13: (i, j)-quasitoric braid on n strands Remark 4.1. If a (p, q)-quasitoric braid β is pure, then it is easy to prove that q is a multiple of p. Let qgBn be the set of all quasitoric generalized braids on n strands. We first prove that the identity element of the braid gr…
Figure 14
Figure 14. Figure 14: Our strategy is to mark tags x, x in such a way that it yields the trivial braid through a sequence of detour moves. To begin with, we consider the nth strand, mark the tag x on the 11 [PITH_FULL_IMAGE:figures/full_fig_p011_14.png]
Figure 14
Figure 14. Figure 14: Remark 4.3. It is not difficult to prove that the quasitoric braid β given by (xn−1xn−2 . . . x1)(xn−1xn−2 . . . x−1 1 )· · ·(xn−1xn−2 . . . x−1 j x −1 j−1 . . . x−1 1 )· · ·(x −1 n−1 x −1 n−2 . . . x−1 1 ) represents the identity element in the group gBn. A particula…
Figure 15
Figure 15. Figure 15: Slide nth strand parallel to (n − 1)th strand via dominant tag x and ¯x [PITH_FULL_IMAGE:figures/full_fig_p013_15.png]
Figure 19
Figure 19. Figure 19: R1(a) move [PITH_FULL_IMAGE:figures/full_fig_p015_19.png]
Figure 20
Figure 20. Figure 20: M1 and M2 moves the orbits of the action of πn(β) on {1, 2, . . . , n}. The number of elements in each orbit might be different. The M1 move on a braid β conjugates it, and therefore, conjugates the corresponding permutation. Conjugating a permutation only shuffles th…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

25 extracted references · 24 canonical work pages

  1. [1]

    Bardakov

    Valerij G. Bardakov. The virtual and universal braids. Fund. Math. , 184:1--18, 2004

    work page 2004

  2. [2]

    Bardakov, Paolo Bellingeri, and Celeste Damiani

    Valeriy G. Bardakov, Paolo Bellingeri, and Celeste Damiani. Unrestricted virtual braids, fused links and other quotients of virtual braid groups. J. Knot Theory Ramifications , 24(12):1550063, 23, 2015

    work page 2015

  3. [3]

    Alexander and M arkov theorems for generalized knots, I

    Andrew Bartholomew and Roger Fenn. Alexander and M arkov theorems for generalized knots, I . J. Knot Theory Ramifications , 31(8):Paper No. 2240009, 20, 2022

    work page 2022

  4. [4]

    Joan S. Birman. New points of view in knot theory. Bull. Amer. Math. Soc. (N.S.) , 28(2):253--287, 1993

    work page 1993

  5. [5]

    Bardakov and Tatyana A

    Valeriy G. Bardakov and Tatyana A. Kozlovskaya . Singular braids, singular links and subgroups of camomile type . arXiv e-prints , page arXiv:2212.08267, December 2022

    arXiv 2022

  6. [6]

    On a quasitoric virtual braid presentation of a virtual link

    Yongju Bae and Seogman Seo. On a quasitoric virtual braid presentation of a virtual link. Kyungpook Math. J. , 55(1):191--203, 2015

    work page 2015

  7. [7]

    On the quasitoric braid index of a link

    Yongju Bae and Seogman Seo. On the quasitoric braid index of a link. J. Korean Math. Soc. , 52(6):1305--1321, 2015

    work page 2015

  8. [8]

    Structural aspects of twin and pure twin groups

    Valeriy Bardakov, Mahender Singh, and Andrei Vesnin. Structural aspects of twin and pure twin groups. Geom. Dedicata , 203:135--154, 2019

    work page 2019

Show all 25 references
  1. [9]

    Abhijit Champanerkar, Ilya Kofman, and Jessica S. Purcell. Volume bounds for weaving knots. Algebr. Geom. Topol. , 16(6):3301--3323, 2016

    2016

  2. [10]

    Generalised biquandles for generalised knot theories

    Roger Fenn. Generalised biquandles for generalised knot theories. In New ideas in low dimensional topology , volume 56 of Ser. Knots Everything , pages 79--103. World Sci. Publ., Hackensack, NJ, 2015

    2015

  3. [11]

    The singular braid monoid embeds in a group

    Roger Fenn, Ebru Keyman, and Colin Rourke. The singular braid monoid embeds in a group. J. Knot Theory Ramifications , 7(7):881--892, 1998

    1998

  4. [12]

    Some remarks on the braid-permutation group

    Roger Fenn, Rich\' a rd Rim\' a nyi, and Colin Rourke. Some remarks on the braid-permutation group. In Topics in knot theory ( E rzurum, 1992) , volume 399 of NATO Adv. Sci. Inst. Ser. C: Math. Phys. Sci. , pages 57--68. Kluwer Acad. Publ., Dordrecht, 1993

    1992

  5. [13]

    Goldsmith

    Deborah L. Goldsmith. The theory of motion groups. Michigan Math. J. , 28(1):3--17, 1981

    1981

  6. [14]

    Kauffman

    Louis H. Kauffman. Virtual knot theory. European J. Combin. , 20(7):663--690, 1999

    1999

  7. [15]

    Kauffman and Sofia Lambropoulou

    Louis H. Kauffman and Sofia Lambropoulou. Virtual braids. Fund. Math. , 184:159--186, 2004

    2004

  8. [16]

    a t Bonn, Mathematisches Institut, Bonn, 1999. Dissertation, Rheinische Friedrich-Wilhelms-Universit\

    Christoph Lamm. Zylinder- K noten und symmetrische V ereinigungen , volume 321 of Bonner Mathematische Schriften [Bonn Mathematical Publications] . Universit\" a t Bonn, Mathematisches Institut, Bonn, 1999. Dissertation, Rheinische Friedrich-Wilhelms-Universit\" a t Bonn, Bonn, 1999

    1999

  9. [17]

    Fourier Knots

    Christoph Lamm . Fourier Knots . arXiv e-prints , page arXiv:1210.4543, October 2012

    2012 arXiv

  10. [18]

    Formulas for the C asson invariant of certain integral homology 3-spheres

    Sang Youl Lee and Myoungsoo Seo. Formulas for the C asson invariant of certain integral homology 3-spheres. J. Knot Theory Ramifications , 18(11):1551--1576, 2009

    2009

  11. [19]

    V. O. Manturov. A combinatorial representation of links by quasitoric braids. European J. Combin. , 23(2):207--212, 2002

    2002

  12. [20]

    J. McCool. On basis-conjugating automorphisms of free groups. Canad. J. Math. , 38(6):1525--1529, 1986

    1986

  13. [21]

    Combinatorial group theory: P resentations of groups in terms of generators and relations

    Wilhelm Magnus, Abraham Karrass, and Donald Solitar. Combinatorial group theory: P resentations of groups in terms of generators and relations . Interscience Publishers [John Wiley & Sons], New York-London-Sydney, 1966

    1966

  14. [22]

    Polynomial invariants, knot homologies, and higher twist numbers of weaving knots W(3,n)

    Rama Mishra and Ross Staffeldt. Polynomial invariants, knot homologies, and higher twist numbers of weaving knots W(3,n) . J. Knot Theory Ramifications , 30(4):Paper No. 2150025, 57, 2021

    2021

  15. [23]

    Structure and automorphisms of pure virtual twin groups

    Tushar Kanta Naik, Neha Nanda, and Mahender Singh. Structure and automorphisms of pure virtual twin groups. Monatsh. Math. , 202(3):555--582, 2023

    2023

  16. [24]

    Minimal generating sets and the abelianization for the quasitoric braid group

    Genki Omori. Minimal generating sets and the abelianization for the quasitoric braid group. Journal of Knot Theory and Its Ramifications , 33(13):2450046, 2024

    2024

  17. [25]

    Any link has a diagram with only triangles and quadrilaterals

    Reiko Shinjo and Kokoro Tanaka . Any link has a diagram with only triangles and quadrilaterals . arXiv e-prints , page arXiv:2308.14118, August 2023

    2023 arXiv

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.