Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Noncrossing partitio ...
Conference paper

Noncrossing partitions, toggles, and homomesy

David Einstein (1), Miriam Farber (2), Emily Gunawan (3), Michael Joseph (4), Matthew Macauley (5), James Propp (1), Simon Rubinstein-Salzedo
(1) Department of Mathematics [Lowell]
(2) Department of Mathematics [MIT]
(3) Department of Mathematics [Minneapolis]
(4) Department of Mathematics [Storrs]
(5) Department of Mathematical Sciences [Clemson]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6378
License
https://about.hal.science/hal-authorisation-v1
Indicators
547
Views
838
Downloads

Noncrossing partitions, toggles, and homomesy

David Einstein (1), Miriam Farber (2), Emily Gunawan (3), Michael Joseph (4), Matthew Macauley (5), James Propp (1), Simon Rubinstein-Salzedo
(1) Department of Mathematics [Lowell]
(2) Department of Mathematics [MIT]
(3) Department of Mathematics [Minneapolis]
(4) Department of Mathematics [Storrs]
(5) Department of Mathematical Sciences [Clemson]
Abstract
We introduce n(n − 1)/2 natural involutions (“toggles”) on the set S of noncrossing partitions π of size n, along with certain composite operations obtained by composing these involutions. We show that for many operations T of this kind, a surprisingly large family of functions f on S (including the function that sends π to the number of blocks of π) exhibits the homomesy phenomenon: the average of f over the elements of a T -orbit is the same for all T -orbits. Our methods apply more broadly to toggle operations on independent sets of certain graphs.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Preview
Loading PDF preview...