Complexes of Injective Words and Their Commutation Classes

Simple item page
dc.creatorJonsson, Jakob
dc.creatorWelker, Volkmar
dc.date2007-12-13
dc.date.accessioned2026-07-07T08:49:00Z
dc.date.available2026-07-07T08:49:00Z
dc.descriptionLet $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örner and Wachs on the complex of all injective words.
dc.identifierhttps://arxiv.org/abs/0712.2143
dc.identifierhttp://arxiv.org/abs/0712.2143
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/144150
dc.subjectCombinatorics
dc.subjectK-Theory and Homology
dc.titleComplexes of Injective Words and Their Commutation Classes
dc.typetext

Files

Collections

arXiv