ترغب بنشر مسار تعليمي؟ اضغط هنا

A birational lifting of the Stanley-Thomas word on products of two chains

180   0   0.0 ( 0 )
 نشر من قبل Michael Joseph
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of periodicity, orbit structure, and invariants. One key property enjoyed by the rowmotion operator on certain finite partially-ordered sets is homomesy, where the average value of a statistic is the same for all orbits. To prove refin



قيم البحث

اقرأ أيضاً

114 - Gregg Musiker , Tom Roby 2018
Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivariantly on antichains) of a poset $ P$, which when iterated on special posets, has unexpectedly nice properties in terms of periodicity, cyclic sieving, and homomesy (statistics whose averages over each orbit are constant) [AST11, BW74, CF95, Pan09, PR13, RuSh12,RuWa15+,SW12, ThWi17, Yil17. In this context, rowmotion appears to be related to Auslander-Reiten translation on certain quivers, and birational rowmotion to $Y$-systems of type $A_m times A_n$ described in Zamolodchikov periodicity. We give a formula in terms of families of non-intersecting lattice paths for iterated actions of the birational rowmotion map on a product of two chains. This allows us to give a much simpler direct proof of the key fact that the period of this map on a product of chains of lengths $r$ and $s$ is $r+s+2$ (first proved by D.~Grinberg and the second author), as well as the first proof of the birational analogue of homomesy along files for such posets.
85 - Ricky X. F. Chen 2019
In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a formula of the number of pairs of long cycles whose product has $k$ cycles independently obtained by Zagier and Stanley relying on group characters, and was previously obtained by F{e}ray and Vassilieva by counting some colored permutations first and then relying on some algebraic computations in the ring of symmetric functions. Our approach here is simpler and combinatorial.
136 - James Propp , Tom Roby 2013
Many invertible actions $tau$ on a set ${mathcal{S}}$ of combinatorial objects, along with a natural statistic $f$ on ${mathcal{S}}$, exhibit the following property which we dub textbf{homomesy}: the average of $f$ over each $tau$-orbit in ${mathcal{ S}}$ is the same as the average of $f$ over the whole set ${mathcal{S}}$. This phenomenon was first noticed by Panyushev in 2007 in the context of the rowmotion action on the set of antichains of a root poset; Armstrong, Stump, and Thomas proved Panyushevs conjecture in 2011. We describe a theoretical framework for results of this kind that applies more broadly, giving examples in a variety of contexts. These include linear actions on vector spaces, sandpile dynamics, Suters action on certain subposets of Youngs Lattice, Lyness 5-cycles, promotion of rectangular semi-standard Young tableaux, and the rowmotion and promotion actions on certain posets. We give a detailed description of the latter situation for products of two chains.
111 - Ricky X. F. Chen 2019
In this paper, we first obtain some analogues of a formula of Zagier (1995) and Stanley (2011). For instance, we prove that the number of pairs of $n$-cycles whose product has $k$ cycles and has $m$ given elements contained in distinct cycles (or sep arated) is given by $$ frac{2 (n-1)! C_m(n+1,k)}{(n+m)(n+1-m)} $$ when $n-k$ is even, where $C_m(n,k)$ is the number of permutations of $n$ elements having $k$ cycles and separating $m$ given elements. As consequences, we obtain the formulas for certain separation probabilities due to Du and Stanley, answering a call of Stanley for simple combinatorial proofs. Furthermore, we obtain the expectation and variance of the number of fixed points in the product of two random $n$-cycles.
206 - Darij Grinberg , Tom Roby 2014
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 s tudied 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 prove that birational rowmotion has order p+q on the (p, q)-rectangle poset (i.e., on the product of a p-element chain with a q-element chain); we furthermore compute its orders on some triangle-shaped posets and on a class of posets which we call skeletal (this class includes all graded forests). In all cases mentioned, birational rowmotion turns out to have a finite (and explicitly computable) order, a property it does not exhibit for general finite posets (unlike classical rowmotion, which is a permutation of a finite set). Our proof in the case of the rectangle poset uses an idea introduced by Volkov (arXiv:hep-th/0606094) to prove the AA case of the Zamolodchikov periodicity conjecture; in fact, the finite order of birational rowmotion on many posets can be considered an analogue to Zamolodchikov periodicity. We comment on suspected, but so far enigmatic, connections to the theory of root posets. We also make a digression to study classical rowmotion on skeletal posets, since this case has seemingly been overlooked so far.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا