Praise Adeyemo
Published 2024-06-14Version 1
The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with consecutive fixed points. A closed formula for counting the vertices of each member of the family is given and the vertex-degree polynomials for the graphs with their generating series is realised. Lastly, some isomorphisms of these graphs with various combinatorial objects are established.
Some instances of Homomesy in product of two chains
At most $4.47^n$ stable matchings
Reduced words for clans
![QR code for arXiv:2406.09666 [math.CO]](http://oss.arxitics.com/images/favicon.svg)