Centralizer of Braids and Fibonacci Numbers
Usman Ali, Azeem Haider
TL;DR
This paper explores the computation of simple centralizers in braid groups, revealing their connection to Fibonacci numbers, and discusses the planarity of certain commuting graphs.
Contribution
It introduces a novel link between braid centralizers and Fibonacci numbers and analyzes the planarity of related commuting graphs.
Findings
Centralizers of simple braids relate to Fibonacci numbers.
Some commuting graphs are planar.
New methods for computing braid centralizers.
Abstract
The paper encloses computation of simple centralizer of simple braids and their connection with Fibonacci numbers. Planarity of some commuting graphs is also discussed in the last section.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Finite Group Theory Research · Advanced Combinatorial Mathematics