On meandric permutations

arXiv2208.09752MaRDI QIDQ6408370FDOQ6408370

Authors: Viktor Lopatkin 

Publication date: 20 August 2022

Abstract: We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are exactly incident matrices of the corresponding adjacency graphs of the diagrams. Finally, we show that these matrices are idempotent over the field $mathsfGF(2)$, and obtain a criterion for a permutation to be meandric.

This page was built for publication: On meandric permutations

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