Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/101354
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gutierres, Gonçalo | - |
dc.contributor.author | Mamede, Ricardo Nuno | - |
dc.contributor.author | Santos, José Luis | - |
dc.date.accessioned | 2022-08-24T08:30:12Z | - |
dc.date.available | 2022-08-24T08:30:12Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 1077-8926 | pt |
dc.identifier.uri | https://hdl.handle.net/10316/101354 | - |
dc.description.abstract | Using the standard Coxeter presentation for the symmetric group Sn, two re- duced expressions for the same group element w are said to be commutationally equivalent if one expression can be obtained from the other one by applying a nite sequence of commutations. The commutation classes can be seen as the vertices of a graph bG (w), where two classes are connected by an edge if elements of those classes di er by a long braid relation. We compute the radius and diameter of the graph bG (w0), for the longest element w0 in the symmetric group Sn, and show that it is not a planar graph for n > 6. We also describe a family of commutation classes which contains all atoms, that is classes with one single element, and a subfamily of commutation classes whose elements are in bijection with standard Young tableaux of certain moon-polyomino shapes. | pt |
dc.language.iso | eng | pt |
dc.rights | openAccess | pt |
dc.rights.uri | http://creativecommons.org/licenses/by-nd/4.0/ | pt |
dc.title | Commutation Classes of the Reduced Words for the Longest Element of ${\mathfrak S}_n$ | pt |
dc.type | article | - |
degois.publication.firstPage | 1 | pt |
degois.publication.lastPage | 25 | pt |
degois.publication.issue | 2 | pt |
degois.publication.title | Electronic Journal of Combinatorics | pt |
dc.peerreviewed | yes | pt |
dc.identifier.doi | 10.37236/9481 | pt |
degois.publication.volume | 27 | pt |
dc.date.embargo | 2020-01-01 | * |
uc.date.periodoEmbargo | 0 | pt |
item.fulltext | Com Texto completo | - |
item.grantfulltext | open | - |
item.languageiso639-1 | en | - |
item.cerifentitytype | Publications | - |
item.openairetype | article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.dept | Faculty of Sciences and Technology | - |
crisitem.author.parentdept | University of Coimbra | - |
crisitem.author.parentdept | University of Coimbra | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.researchunit | CMUC - Centre for Mathematics of the University of Coimbra | - |
crisitem.author.orcid | 0000-0001-9480-498X | - |
crisitem.author.orcid | 0000-0002-2727-6774 | - |
Appears in Collections: | I&D CMUC - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Commutation-classes-of-the-reduced-words-for-the-longest-element-of-SsubnsubElectronic-Journal-of-Combinatorics.pdf | 413.43 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
3
checked on Nov 17, 2022
WEB OF SCIENCETM
Citations
3
checked on May 2, 2023
Page view(s)
98
checked on Sep 25, 2024
Download(s)
68
checked on Sep 25, 2024
Google ScholarTM
Check
Altmetric
Altmetric
This item is licensed under a Creative Commons License