scholarly journals Birational Rowmotion and Coxeter-Motion on Minuscule Posets

10.37236/9557 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Soichi Okada
Keyword(s):  
Dynamical System ◽  
Discrete Dynamical System ◽  
Order Ideal ◽  
Positive Real ◽  
Finite Poset ◽  
Coxeter Number ◽  
Order Ideals ◽  
Minuscule Poset

Birational rowmotion is a discrete dynamical system on the set of all positive real-valued functions on a finite poset, which is a birational lift of combinatorial rowmotion on order ideals. It is known that combinatorial rowmotion for a minuscule poset has order equal to the Coxeter number, and exhibits the file homomesy phenomenon for refined order ideal cardinality statistics. In this paper we generalize these results to the birational setting. Moreover, as a generalization of birational promotion on a product of two chains, we introduce birational Coxeter-motion on minuscule posets, and prove that it enjoys periodicity and file homomesy.

Identification of gene interactions in fungal–plant symbiosis through discrete dynamical system modelling

2009 ◽  
Vol 3 (5) ◽  
pp. 414-428 ◽  
Author(s):  
J.G.C. Angeles ◽  
Z. Ouyang ◽  
A.M. Aguirre ◽  
P.J. Lammers ◽  
M. Song
Keyword(s):  
Dynamical System ◽  
Discrete Dynamical System ◽  
Gene Interactions ◽  
System Modelling

scholarly journals Promotion and Evacuation

10.37236/75 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Richard P. Stanley
Keyword(s):  
Vector Space ◽  
Hecke Algebra ◽  
Linear Extensions ◽  
Linear Transformations ◽  
Basic Properties ◽  
Finite Poset ◽  
Order Ideals ◽  
Maximal Chains

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schützenberger. This paper surveys the basic properties of these two operations and discusses some generalizations. Linear extensions of a finite poset $P$ may be regarded as maximal chains in the lattice $J(P)$ of order ideals of $P$. The generalizations concern permutations of the maximal chains of a wider class of posets, or more generally bijective linear transformations on the vector space with basis consisting of the maximal chains of any poset. When the poset is the lattice of subspaces of ${\Bbb F}_q^n$, then the results can be stated in terms of the expansion of certain Hecke algebra products.

scholarly journals Iterative Properties of Birational Rowmotion I: Generalities and Skeletal Posets

10.37236/4334 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Darij Grinberg ◽  
Tom Roby
Keyword(s):  
Finite Order ◽  
Disjoint Union ◽  
Parallel Analysis ◽  
Birational Map ◽  
Finite Poset ◽  
Order Ideals ◽  
Set Up ◽  
Grafting Onto

We study a birational map associated to any finite poset $P$. This map is a far-reaching generalization (found by Einstein and Propp) of classical rowmotion, which is a certain permutation of the set of order ideals of $P$. Classical rowmotion has been studied by various authors (Fon-der-Flaass, Cameron, Brouwer, Schrijver, Striker, Williams and many more) under different guises (Striker-Williams promotion and Panyushev complementation are two examples of maps equivalent to it). In contrast, birational rowmotion is new and has yet to reveal several of its mysteries. In this paper, we set up the tools for analyzing the properties of iterates of this map, and prove that it has finite order for a certain class of posets which we call "skeletal". Roughly speaking, these are graded posets constructed from one-element posets by repeated disjoint union and "grafting onto an antichain"; in particular, any forest having its leaves all on the same rank is such a poset. We also make a parallel analysis of classical rowmotion on this kind of posets, and prove that the order in this case equals the order of birational rowmotion.

scholarly journals $(q,t)$-Characters of Kirillov-Reshetikhin Modules of Type $A_r$ as Quantum Cluster Variables

10.37236/7188 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Bolor Turmunkh
Keyword(s):  
Dynamical System ◽  
Discrete Dynamical System ◽  
Cluster Algebra ◽  
Quiver Varieties ◽  
Quantum Cluster ◽  
T System

Nakajima (2003) introduced a $t$-deformation of $q$-characters, $(q,t)$-characters for short, and their twisted multiplication through the geometry of quiver varieties. The Nakajima $(q,t)$-characters of Kirillov-Reshetikhin modules satisfy a $t$-deformed $T$-system. The $T$-system is a discrete dynamical system that can be interpreted as a mutation relation in a cluster algebra in two different ways, depending on the choice of direction of evolution. In this paper, we show that the Nakajima $t$-deformed $T$-system of type $A_r$ forms a quantum mutation relation in a quantization of exactly one of the cluster algebra structures attached to the $T$-system.

Geometry and Kinematics of Cylindrical Waterbomb Tessellation

2021 ◽  
Author(s):  
Rinki Imada ◽  
Tomohiro Tachi
Keyword(s):  
Dynamical System ◽  
Recurrence Relation ◽  
Discrete Dynamical System ◽  
Kinematic Model ◽  
Theoretical Reason ◽  
Finite Solution ◽  
Geometry And Kinematics ◽  
Folded Surfaces

Abstract Folded surfaces of origami tessellations have attracted much attention because they sometimes exhibit non-trivial behaviors. It is known that cylindrical folded surfaces of waterbomb tessellation called waterbomb tube can transform into wave-like surfaces, which is a unique phenomenon not observed on other tessellations. However, the theoretical reason why wave-like surfaces arise has been unclear. In this paper, we provide a kinematic model of waterbomb tube by parameterizing the geometry of a module of waterbomb tessellation and derive a recurrence relation between the modules. Through the visualization of the configurations of waterbomb tubes under the proposed kinematic model, we classify solutions into three classes: cylinder solution, wave-like solution, and finite solution. Furthermore, we give proof of the existence of a wave-like solution around one of the cylinder solutions by applying the knowledge of the discrete dynamical system to the recurrence relation.

scholarly journals The Limit Point of the Pentagram Map

2018 ◽  
Vol 2020 (9) ◽  
pp. 2818-2831 ◽  
Author(s):  
Max Glick
Keyword(s):  
Dynamical System ◽  
Limit Point ◽  
Convex Polygon ◽  
Discrete Dynamical System ◽  
Explicit Description ◽  
Cartesian Coordinates ◽  
The Subject ◽  
Pentagram Map

Abstract The pentagram map is a discrete dynamical system defined on the space of polygons in the plane. In the 1st paper on the subject, Schwartz proved that the pentagram map produces from each convex polygon a sequence of successively smaller polygons that converges exponentially to a point. We investigate the limit point itself, giving an explicit description of its Cartesian coordinates as roots of certain degree three polynomials.

EFFECT OF STEP SIZE ON BIFURCATIONS AND CHAOS OF A MAP-BASED BVP OSCILLATOR

2010 ◽  
Vol 20 (06) ◽  
pp. 1789-1795 ◽  
Author(s):  
HONGJUN CAO ◽  
CAIXIA WANG ◽  
MIGUEL A. F. SANJUÁN
Keyword(s):  
Dynamical System ◽  
Neuron Model ◽  
Discrete Dynamical System ◽  
Period Doubling ◽  
Vital Role ◽  
Bifurcation Parameter ◽  
Decomposition Technique ◽  
Step Size ◽  
Discrete Step ◽  
Slow Decomposition

The continuous Bonhoeffer–van der Pol (BVP for short) oscillator is transformed into a map-based BVP model by using the forward Euler scheme. At first, the bifurcations and chaos of the map-based BVP model are investigated when the step size varies as a bifurcation parameter. By using the fast-slow decomposition technique, a two-parameter bifurcation diagram is obtained to give insight into the effect of the step size on bifurcations and chaos of the map-based BVP model. The investigation shows that the period-doubling bifurcation is dependent on the step size, while the saddle-node bifurcation is independent of the step size. Second, when the fast–slow decomposition technique cannot be used, we rigorously prove that in the map-based BVP model there exists chaos in the sense of Marotto when the discrete step size varies as a bifurcation parameter. These results show that the discrete step sizes play a vital role between the continuous-time dynamical system and the corresponding discrete dynamical system. Much attention should be paid on the step size when a map-based neuron model is used as an alternative to a continuous neuron model.

Sign in / Sign up

Export Citation Format

Share Document