Complexes of Injective Words and Their Commutation Classes
classification
🧮 math.CO
math.KT
keywords
injectivewordwordsclassescommutationcomplexesalphabetappears
read the original abstract
Let $S$ be a finite alphabet. An injective word over $S$ is a word over $S$ such that each letter in $S$ appears at most once in the word. We study Boolean cell complexes of injective words over $S$ and their commutation classes. This generalizes work by Farmer and by Bj\"orner and Wachs on the complex of all injective words.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.