Abstract
This paper analyzes a certain action called "whirling" that can be defined on any family of functions between two finite sets equipped with a linear (or cyclic) ordering. Many maps of interest in dynamical algebraic combinatorics, such as rowmotion of order ideals, can be represented as a composition of "toggling" involutions, each of which modifies its object only locally. Similarly whirling is made up of locally-acting whirling maps which directly generalize toggles, but cycle through more than two possible outputs. In this first paper on whirling, we consider it as a map on subfamilies of functions between finite sets. For whirling acting on the set of injections or the set of surjections, we prove that within each whirling orbit, any two elements of the codomain appear as outputs of functions the same number of times. This result can be stated in terms of the homomesy phenomenon, which occurs when a statistic has the same average across every orbit. We further explore homomesy results and conjectures for whirling on restricted-growth words, which correspond to set partitions. These results extend the collection of combinatorial objects for which we have interesting dynamics and homomesy, and open the door to considering whirling in other contexts. 21 pages, 5 figures
Related Publications
Experiments with a new boosting algorithm
In an earlier paper, we introduced a new "boosting" algorithm called AdaBoost which, theoretically, can be used to significantly reduce the error of any learni...
The role of common ontology in achieving sharable, reusable knowledge bases
Although AI research and commercial system development depend on bodies of formally represented knowledge that are expensive and difficult to construct, current knowledge base d...
Ontolingua:A Mechanism to Support portable Ontologies
An ontology is a set of definitions of content-specific knowledge representation primitives: classes, relations, functions, and object constants. Ontolingua is mechanism for wri...
Pseudo-convergent Q-Learning by Competitive Pricebots
We study novel aspects of multi-agent Qlearning in a model market in which two identical, competing "pricebots" strategically price a commodity. Two fundamenta...
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Probabilistic inference is an attractive approach to uncertain reasoning and empirical learning in artificial intelligence. Computational difficulties arise, however, because pr...
Publication Info
- Year
- 2025
- Type
- article
- Volume
- vol. 27:3
- Issue
- Combinatorics
- Citations
- 0
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.46298/dmtcs.14126