scholarly journals Toggling Independent Sets of a Path Graph

10.37236/6755 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Michael Joseph ◽  
Tom Roby
Keyword(s):  
Dynamical System ◽  
Independent Sets ◽  
Coxeter Element ◽  
Intrinsic Interest ◽  
Orbit Structure ◽  
Cyclic Sieving Phenomenon ◽  
Path Graph ◽  
The Difference ◽  
Indicator Functions ◽  
Cyclic Sieving

This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy conjecture of Propp that for the action of a "Coxeter element" of vertex toggles, the difference of indicator functions of symmetrically-located vertices is 0-mesic. Then we use our analysis to show facts about orbit sizes that are easy to conjecture but nontrivial to prove. Besides its intrinsic interest, this particular combinatorial dynamical system is valuable in providing an interesting example of (a) homomesy in a context where large orbit sizes make a cyclic sieving phenomenon unlikely to exist, (b) the use of Coxeter theory to greatly generalize the set of actions for which results hold, and (c) the usefulness of Striker's notion of generalized toggle groups.

scholarly journals Cyclic sieving for two families of non-crossing graphs

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Svetlana Poznanović
Keyword(s):  
Cyclic Group ◽  
Orbit Structure ◽  
Cyclic Sieving Phenomenon ◽  
Nous Montrons ◽  
International Audience ◽  
Cyclic Sieving ◽  
Cette Action

International audience We prove the cyclic sieving phenomenon for non-crossing forests and non-crossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of Alan Guo. Nous prouvons le phénomène de crible cyclique pour les forêts et les graphes sans croisement. Plus précisément, le groupe cyclique agit sur ces graphes naturellement par rotation et nous montrons que la structure d'orbite de cette action est codée par certains polynômes. Nos résultats confirment deux conjectures de Alan Guo.

scholarly journals Cyclic sieving for longest reduced words in the hyperoctahedral group

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
T. K. Petersen ◽  
L. Serrano
Keyword(s):  
Generating Function ◽  
Hyperoctahedral Group ◽  
Cyclic Action ◽  
Orbit Structure ◽  
Cyclic Sieving Phenomenon ◽  
Major Index ◽  
Nous Montrons ◽  
International Audience ◽  
Cyclic Sieving ◽  
Cette Action

International audience We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, $R(w_0)$ possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on $R(w_0)$. Nous montrons que l'ensemble $R(w_0)$ des expressions réduites pour l'élément le plus long du groupe hyperoctaédral présente le phénomène cyclique de tamisage. Plus précisément, $R(w_0)$ possède une action naturelle cyclique donnée par le déplacement de la première lettre d'un mot vers la fin, et nous montrons que la structure d'orbite de cette action est codée par la fonction génératrice pour l'indice majeur sur $R(w_0)$.

scholarly journals Cyclic Sieving for Longest Reduced Words in the Hyperoctahedral Group

10.37236/339 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
T. Kyle Petersen ◽  
Luis Serrano
Keyword(s):  
Generating Function ◽  
Hyperoctahedral Group ◽  
Cyclic Action ◽  
Orbit Structure ◽  
Cyclic Sieving Phenomenon ◽  
Major Index ◽  
Cyclic Sieving ◽  
Reduced Words

We show that the set $R(w_0)$ of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, $R(w_0)$ possesses a natural cyclic action given by moving the first letter of a word to the end, and we show that the orbit structure of this action is encoded by the generating function for the major index on $R(w_0)$.

scholarly journals The Cyclic Sieving Phenomenon for Non-Crossing Forests

10.37236/2419 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Stefan Kluge
Keyword(s):  
Cyclic Group ◽  
Cyclic Sieving Phenomenon ◽  
Cyclic Sieving

In this paper we prove that the set of non-crossing forests together with a cyclic group acting on it by rotation and a natural q-analogue of the formula for their number exhibits the cyclic sieving phenomenon, as conjectured by Alan Guo.

scholarly journals The cyclic sieving phenomenon

2004 ◽  
Vol 108 (1) ◽  
pp. 17-50 ◽  
Author(s):  
V. Reiner ◽  
D. Stanton ◽  
D. White
Keyword(s):  
Cyclic Sieving Phenomenon ◽  
Cyclic Sieving

scholarly journals q-Congruences, with applications to supercongruences and the cyclic sieving phenomenon

2019 ◽  
Vol 15 (09) ◽  
pp. 1919-1968 ◽  
Author(s):  
Ofir Gorodetsky
Keyword(s):  
Binomial Coefficients ◽  
Roots Of Unity ◽  
General Criterion ◽  
Lucas Numbers ◽  
Cyclic Sieving Phenomenon ◽  
Similar Formula ◽  
Apéry Numbers ◽  
Higher Derivatives ◽  
Cyclic Sieving

We establish a supercongruence conjectured by Almkvist and Zudilin, by proving a corresponding [Formula: see text]-supercongruence. Similar [Formula: see text]-supercongruences are established for binomial coefficients and the Apéry numbers, by means of a general criterion involving higher derivatives at roots of unity. Our methods lead us to discover new examples of the cyclic sieving phenomenon, involving the [Formula: see text]-Lucas numbers.

scholarly journals On sums of indicator functions in dynamical systems

2009 ◽  
Vol 30 (5) ◽  
pp. 1419-1430 ◽  
Author(s):  
OLIVIER DURIEU ◽  
DALIBOR VOLNÝ
Keyword(s):  
Dynamical System ◽  
Limit Theorem ◽  
Dynamical Systems ◽  
Partial Sums ◽  
Probability Measures ◽  
Ergodic Dynamical System ◽  
Indicator Functions

AbstractIn this paper, we are interested in the limit theorem question for sums of indicator functions. We show that in every invertible ergodic dynamical system, for every increasing sequence (an)n∈ℕ⊂ℝ+ such that an↗∞ and an/n→0 as n→∞, there exists a dense Gδ of measurable sets A such that the sequence of the distributions of the partial sums $(\sfrac {1}{a_n})\sum _{i=0}^{n-1}(\ind _A-\mu (A))\circ T^i$ is dense in the set of the probability measures on ℝ.

scholarly journals Finsler-type estimators for the cancer cell population dynamics

2015 ◽  
Vol 98 (112) ◽  
pp. 53-69
Author(s):  
Vladimir Balan ◽  
Jelena Stojanov
Keyword(s):  
Dynamical System ◽  
Population Growth ◽  
Cancer Cell ◽  
Cell Population ◽  
Biological Models ◽  
Cell Population Dynamics ◽  
Finsler Structure ◽  
Cell Population Growth ◽  
Cancer Cell Population ◽  
The Difference

We introduce a Finslerian model related to the classical Garner dynamical system, which models the cancer cell population growth. The Finsler structure is determined by the energy of the deformation field-the difference of the fields, which describe the reduced and the proper biological models. It is shown that a certain locally-Minkowski anisotropic Randers structure, obtained by means of statistical fitting, is able to provide a Zermelo-type drift of the overall cancer cell population growth, which occurs due to significant changes within the cancerous process. The geometric background, the applicative advantages and perspective openings of the constructed geometric structure are discussed.

scholarly journals The Negative $q$-Binomial

10.37236/2040 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Shishuo Fu ◽  
V. Reiner ◽  
Dennis Stanton ◽  
Nathaniel Thiem
Keyword(s):  
Binomial Coefficient ◽  
Cyclic Sieving Phenomenon ◽  
Cyclic Sieving

Interpretations for the $q$-binomial coefficient evaluated at $-q$ are discussed.  A $(q,t)$-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.

Sign in / Sign up

Export Citation Format

Share Document