Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices

We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks. A consequence of this result is that these lattices have the strong Sperner property, which as...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete mathematics and theoretical computer science Ročník DMTCS Proceedings, 28th...
Hlavní autor: Mühle, Henri
Médium: Journal Article Konferenční příspěvek
Jazyk:angličtina
Vydáno: DMTCS 22.04.2020
Discrete Mathematics & Theoretical Computer Science
Témata:
[math.math-co]mathematics [math]/combinatorics [math.co]
Combinatorics
Mathematics
Combinatorics
ISSN:1365-8050, 1462-7264, 1365-8050
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks. A consequence of this result is that these lattices have the strong Sperner property, which asserts that the cardinality of the union of the k largest antichains does not exceed the sum of the k largest ranks for all k ≤ n. Subsequently, we use a computer to complete the proof that any noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus affirmatively answering a special case of a question of D. Armstrong. This was previously established only for the Coxeter groups of type A and B.
AbstractList We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks. A consequence of this result is that these lattices have the strong Sperner property, which asserts that the cardinality of the union of the k largest antichains does not exceed the sum of the k largest ranks for all k ≤ n. Subsequently, we use a computer to complete the proof that any noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus affirmatively answering a special case of a question of D. Armstrong. This was previously established only for the Coxeter groups of type A and B.
Author Mühle, Henri
Author_xml – sequence: 1
  givenname: Henri
  surname: Mühle
  fullname: Mühle, Henri
  organization: Laboratoire d'informatique de l'École polytechnique [Palaiseau]
BackLink https://hal.science/hal-02166346$$DView record in HAL
BookMark eNpVkU9LAzEQxYNUUKsnv0CuItUkk2Szx1L_VCgqVM8hm03aLd1NSYLQb-92K6Knecy8-THMu0CjLnQOoWtK7rhkpbqv22zTnQQJJ-icghQTRQQZ_dFn6CKlDSGUlbw4R2a5b1uXY2PxbG2aDj84G9pdSE1uQpew6Wqc1w4vcwzdCi93LnYu4vcYepX32IeIX0NnY0ip6Q3vJuZhFS9Mzo116RKderNN7uqnjtHn0-PHbD5ZvD2_zKaLiaUFwER5D4Xg1JOCO2Wh8KYivhBVXfoSmGUUuBCM0ZoZToSVTCjJ66KwnvfTEsbo5citg9noXWxaE_c6mEYPjRBX-nCb3TrNy7oCwnnle4QDUJUnShElgAOtXN2zbo6stdn-Q82nC33oEUalBC6_aO-9PXqHH0Tnfxco0UMqekhFH1KBb2Xrgbo
ContentType Journal Article
Conference Proceeding
Copyright Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
1XC
VOOES
DOA
DOI 10.46298/dmtcs.6363
DatabaseName CrossRef
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList

CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1365-8050
ExternalDocumentID oai_doaj_org_article_49db3044bf864e338bf0880853431bed
oai:HAL:hal-02166346v1
10_46298_dmtcs_6363
GroupedDBID -~9
.4S
.DC
29G
2WC
5GY
5VS
8FE
8FG
AAFWJ
AAYXX
ABDBF
ABJCF
ABUWG
ACGFO
ACIWK
ACUHS
ADBBV
ADQAK
AENEX
AFFHD
AFKRA
AFPKN
AIAGR
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARCSS
B0M
BAIFH
BBTPI
BCNDV
BENPR
BFMQW
BGLVJ
BPHCQ
CCPQU
CITATION
EAP
EBS
ECS
EDO
EJD
EMK
EPL
EST
ESX
GROUPED_DOAJ
HCIFZ
I-F
IAO
IBB
ICD
ITC
J9A
KQ8
KWQ
L6V
M7S
MK~
ML~
OK1
OVT
P2P
PHGZM
PHGZT
PIMPY
PQGLB
PQQKQ
PROAC
PTHSS
PV9
REM
RNS
RSU
RZL
TR2
TUS
XSB
~8M
1XC
VOOES
ID FETCH-LOGICAL-c1733-8ff37541f074e8c37fab0f75bd9f932c213455221d2a405c625864d77cf42c293
IEDL.DBID DOA
ISSN 1365-8050
1462-7264
IngestDate Fri Oct 03 12:43:45 EDT 2025
Sat Nov 29 14:59:27 EST 2025
Sat Nov 29 02:48:26 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Combinatorics
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MeetingName 28-th International Conference on Formal Power Series and Algebraic Combinatorics
MergedId FETCHMERGED-LOGICAL-c1733-8ff37541f074e8c37fab0f75bd9f932c213455221d2a405c625864d77cf42c293
OpenAccessLink https://doaj.org/article/49db3044bf864e338bf0880853431bed
ParticipantIDs doaj_primary_oai_doaj_org_article_49db3044bf864e338bf0880853431bed
hal_primary_oai_HAL_hal_02166346v1
crossref_primary_10_46298_dmtcs_6363
PublicationCentury 2000
PublicationDate 2020-04-22
PublicationDateYYYYMMDD 2020-04-22
PublicationDate_xml – month: 04
  year: 2020
  text: 2020-04-22
  day: 22
PublicationDecade 2020
PublicationTitle Discrete mathematics and theoretical computer science
PublicationYear 2020
Publisher DMTCS
Discrete Mathematics & Theoretical Computer Science
Publisher_xml – name: DMTCS
– name: Discrete Mathematics & Theoretical Computer Science
SSID ssj0012947
ssib044734695
Score 2.1460178
Snippet We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated...
SourceID doaj
hal
crossref
SourceType Open Website
Open Access Repository
Index Database
SubjectTerms [math.math-co]mathematics [math]/combinatorics [math.co]
Combinatorics
Mathematics
Title Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices
URI https://hal.science/hal-02166346
https://doaj.org/article/49db3044bf864e338bf0880853431bed
Volume DMTCS Proceedings, 28th...
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: DOA
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044734695
  issn: 1365-8050
  databaseCode: M~E
  dateStart: 19980101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: Continental Europe Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BFMQW
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/conteurope
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 1365-8050
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0012947
  issn: 1365-8050
  databaseCode: PIMPY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwED4hYICBN6K8ZCHWQJ2YJB55CqS2ilRAMEV-UoYG1AYkFn47d3kgmFhYMjhOYn0X576zL98BHGonYrRsGHAlVSCM1YFyWgZGdRV3XHFeKTHd95LBIH14kNmPUl-UE1bLA9fAHQtpNYbcQvs0Fg4DKu1xYiBRiND1aWfp64uspw2mmv2DUIqk_htPxKFMj-24NNOjOIqjX_6nkulHrzJqV1Err3K1AksNHWSn9TBWYcYVa7Dcllpgzcxbg8X-t7zqdB3U8GM8plJYhp2PMLRnF45Sw9v8K6YKy7A7G9I69xMbvjoqZ88yWniflB8MiSobvBTVCNF1sYxgoEtZT5WUDTfdgLury9vz66CplRAYnkRRkHpPxWy5R0rgUhMlXumuT060lR4pmiHhthPkWtyGCjmawbAH8bRJYrzAszLahNnipXBbwJxR2IpOTEsuTOiV9yLWxkiuNbfCd-CwRTB_rSUxcgwlKqDzCuicgO7AGaH73YV0rKsGtG7eWDf_y7odOEDb_LrH9WkvpzYkJ8iWRPzOt__jSTuwEFIo3RVBGO7CbDl5c3swb97L5-lkv3q78Nj_vNyHueymnz1-AYFz2Tk
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Discrete+mathematics+and+theoretical+computer+science&rft.atitle=Symmetric+Chain+Decompositions+and+the+Strong+Sperner+Property+for+Noncrossing+Partition+Lattices&rft.au=M%C3%BChle%2C+Henri&rft.date=2020-04-22&rft.pub=DMTCS&rft.issn=1462-7264&rft.eissn=1365-8050&rft.volume=DMTCS+Proceedings%2C+28th+International+Conference+on+Formal+Power+Series+and+Algebraic+Combinatorics+%28FPSAC+2016%29&rft_id=info:doi/10.46298%2Fdmtcs.6363&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-02166346v1
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1365-8050&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1365-8050&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1365-8050&client=summon