Enumerations relating braid and commutation classes

Susanna Fishel, Elizabeth Milićević, Rebecca Patrias, Bridget Eileen Tenner

Research output: Contribution to journalArticle

Abstract

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.

Original languageEnglish (US)
Pages (from-to)11-26
Number of pages16
JournalEuropean Journal of Combinatorics
Volume74
DOIs
StatePublished - Dec 1 2018

Fingerprint

Braid
Enumeration
Permutation
Upper and Lower Bounds
Classify
Class

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Enumerations relating braid and commutation classes. / Fishel, Susanna; Milićević, Elizabeth; Patrias, Rebecca; Tenner, Bridget Eileen.

In: European Journal of Combinatorics, Vol. 74, 01.12.2018, p. 11-26.

Research output: Contribution to journalArticle

Fishel, Susanna ; Milićević, Elizabeth ; Patrias, Rebecca ; Tenner, Bridget Eileen. / Enumerations relating braid and commutation classes. In: European Journal of Combinatorics. 2018 ; Vol. 74. pp. 11-26.
@article{b96a7d04915b4bcbb20e96800553fc45,
title = "Enumerations relating braid and commutation classes",
abstract = "We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.",
author = "Susanna Fishel and Elizabeth Milićević and Rebecca Patrias and Tenner, {Bridget Eileen}",
year = "2018",
month = "12",
day = "1",
doi = "10.1016/j.ejc.2018.07.002",
language = "English (US)",
volume = "74",
pages = "11--26",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Enumerations relating braid and commutation classes

AU - Fishel, Susanna

AU - Milićević, Elizabeth

AU - Patrias, Rebecca

AU - Tenner, Bridget Eileen

PY - 2018/12/1

Y1 - 2018/12/1

N2 - We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.

AB - We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these bounds, and enumerate both cases.

UR - http://www.scopus.com/inward/record.url?scp=85050884680&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85050884680&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2018.07.002

DO - 10.1016/j.ejc.2018.07.002

M3 - Article

VL - 74

SP - 11

EP - 26

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -