Unprovability results involving braids

DOI10.1112/PLMS/PDQ016zbMATH Open1225.03079arXiv0711.3785OpenAlexW2082433302WikidataQ56337024 ScholiaQ56337024MaRDI QIDQ3069723FDOQ3069723

Authors: Lorenzo Carlucci, Patrick Dehornoy, Andreas Weiermann 

Publication date: 19 January 2011

Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)

Abstract: We construct long sequences of braids that are descending with respect to the standard order of braids (``Dehornoy order), and we deduce that, contrary to all usual algebraic properties of braids, certain simple combinatorial statements involving the braid order are true, but not provable in the subsystems ISigma1 or ISigma2 of the standard Peano system.

Full work available at URL: https://arxiv.org/abs/0711.3785

Recommendations

• scientific article; zbMATH DE number 1747159
• Laver's results and low-dimensional topology
• Braid order, sets, and knots.
• Ordering the braid groups
• Dehornoy's ordering of the braid groups extends the subword ordering

zbMATH Keywords

braid groupsDehornoy ordercombinatorial statements involving the braid orderlong sequences of braidsstronger systems of arithmetic

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Foundations of classical theories (including reverse mathematics) (03B30) First-order arithmetic and fragments (03F30) Discrete-time games (91A50)

Cited In (5)

• Weighted automata on infinite words in the context of attacker-defender games
• Alternating normal forms for braids and locally Garside monoids.
• Laver's results and low-dimensional topology
• Weighted automata on infinite words in the context of attacker-defender games
• Laver and set theory

This page was built for publication: Unprovability results involving braids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3069723)