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. Rowmotion and genera ...
Article

Rowmotion and generalized toggle groups

Jessica Striker
Download article
Open on arXiv
Submitted on
September 27, 2017
Accepted on
May 7, 2018
Published on
May 25, 2018
Last modified on
March 31, 2025
Volume 20
Vol. 20:1
Combinatorics
DOI
10.23638/DMTCS-20-1-17
License
arXiv.org - Non-exclusive license to distribute
ADVANCE Institutional Transformation Award: NDSU ADVANCE FORWARD - Transforming a Gendered Institution
Indicators
1006
Views
753
Downloads

Rowmotion and generalized toggle groups

Jessica Striker
Abstract
We generalize the notion of the toggle group, as defined in [P. Cameron-D. Fon-der-Flaass '95] and further explored in [J. Striker-N. Williams '12], from the set of order ideals of a poset to any family of subsets of a finite set. We prove structure theorems for certain finite generalized toggle groups, similar to the theorem of Cameron and Fon-der-Flaass in the case of order ideals. We apply these theorems and find other results on generalized toggle groups in the following settings: chains, antichains, and interval-closed sets of a poset; independent sets, vertex covers, acyclic subgraphs, and spanning subgraphs of a graph; matroids and convex geometries. We generalize rowmotion, an action studied on order ideals in [P. Cameron-D. Fon-der-Flaass '95] and [J. Striker-N. Williams '12], to a map we call cover-closure on closed sets of a closure operator. We show that cover-closure is bijective if and only if the set of closed sets is isomorphic to the set of order ideals of a poset, which implies rowmotion is the only bijective cover-closure map. Comment: 26 pages, 5 figures, final journal version
Keywords
  • Mathematics - Combinatorics
  • 05E18, 06A75
Preview
Loading PDF preview...