Skip to Content
MathematicsMathematics
  • Correction
  • Open Access

10 February 2026

2 Pages

Correction: Diamantis et al. Topology and Algebra of Bonded Knots and Braids. Mathematics 2025, 13, 3260

,
and
1
Department of Data Analytics and Digitalisation, School of Business and Economics, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands
2
Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago, 851 South Morgan Street, Chicago, IL 60607-7045, USA
3
International Institute for Sustainability with Knotted Chiral Meta Matter (WPI-SKCM2), Hiroshima University, 1-3-1 Kagamiyama, Higashi-Hiroshima, Hiroshima 739-8526, Japan
4
School of Applied Mathematical and Physical Sciences, National Technical University of Athens, Zografou Campus, GR-15780 Athens, Greece

Text Correction

There was an omission in the original publication [1]. A correction has been made to Section 6.3, in the statement of Theorem 8. The same correction has been made to Section 9.2, in the statement of Theorem 13. Namely, the following relation has been added in the presentations in both stated theorems:
b 1 ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) = ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) b 1
Although we explain just above Theorem 8 the method by which one obtains in the statement of Theorem 8 the irredundant presentation of the tight bonded braid monoid  B B n with only the first elementary bond, b 1 , from its full presentation with all elementary bonds, given in the statement of Theorem 6, yet, the above relation reflecting the far commuting of elementary bonds ( b i b j = b j b i   f o r   | i − j | > 1 ) was omitted in Theorem 8. Then, exactly the same omission followed in the irredundant presentation of the enhanced tight bonded braid group E B n , in the statement of Theorem 13. So, the complete statements of Theorems 8 and 13 read as follows:
Theorem 8.
The tight bonded braid monoid B B n admits the following irredundant presentation: it is generated by the classical braid generators and their inverses σ 1 ± 1 , … , σ n − 1 ± 1 and a single bond generator b 1 , subject to the following relations:
σ i σ j = σ j σ i for | i − j | > 1 , σ i σ i + 1 σ i = σ i + 1 σ i σ i + 1 for all i , b 1 σ j ± 1 = σ j ± 1 b 1 for j > 2 , b 1 σ 1 ± 1 = σ 1 ± 1 b 1 b 1 ( σ 2 σ 1 ) ( σ 1 σ 2 ) = ( σ 2 σ 1 ) ( σ 1 σ 2 ) b 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) = ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) b 1 .
Theorem 13.
The enhanced tight bonded braid group E B n admits an irredundant presentation with generators the classical invertible braid generators σ 1 , … , σ n − 1 together with a single attracting bond generator b 1 and its inverse b 1 − 1 , subject to the following relations:
σ i σ j = σ j σ i for | i − j | > 1 , σ i σ i + 1 σ i = σ i + 1 σ i σ i + 1 for all i , b 1 σ j = σ j b 1 for j > 2 , b 1 σ 1 = σ 1 b 1 b 1 ( σ 2 σ 1 ) ( σ 1 σ 2 ) = ( σ 2 σ 1 ) ( σ 1 σ 2 ) b 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) = ( σ 2 σ 1 σ 3 σ 2 ) − 1 b 1 ( σ 2 σ 1 σ 3 σ 2 ) b 1 .
In both statements, of Theorem 8 and of Theorem 13, we also stressed, for full clarity and self-containedness, the invertibility of the classical braid group generators, although this was not an omission. It was already explicitly stated in the full presentation given in Theorem 6 and the classical braid group is a very well-known mathematical object. Namely, in the statement of Theorem 8 we added “and their inverses” as well as the inverse generators of the classical braid group generators, and in the statement of Theorem 13 we added the word “invertible” for the classical braid group generators.
The authors state that the scientific conclusions are unaffected. This correction was approved by the Academic Editor. The original publication has also been updated.

Reference

  1. Diamantis, I.; Kauffman, L.H.; Lambropoulou, S. Topology and Algebra of Bonded Knots and Braids. Mathematics 2025, 13, 3260. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.