Complexes of Injective Words and Their Commutation Classes
Jakob Jonsson, Volkmar Welker

TL;DR
This paper investigates the structure of Boolean cell complexes formed by injective words over a finite alphabet and explores their commutation classes, extending prior research on related combinatorial complexes.
Contribution
It generalizes previous work by Farmer and Bj"orner and Wachs on injective word complexes to include their commutation classes.
Findings
Characterization of complexes of injective words
Analysis of their commutation classes
Extension of existing combinatorial frameworks
Abstract
Let be a finite alphabet. An injective word over is a word over such that each letter in appears at most once in the word. We study Boolean cell complexes of injective words over and their commutation classes. This generalizes work by Farmer and by Bj\"orner and Wachs on the complex of all injective words.
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
Topicssemigroups and automata theory · Algebraic structures and combinatorial models · Advanced Combinatorial Mathematics
