اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدHomomesy in products of two chains
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
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.
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
We study maps on the set of permutations of n generated by the Renyi-Foata map intertwined with other dihedral symmetries (of a permutation considered as a 0-1 matrix). Iterating these maps leads to dynamical systems that in some cases exhibit intere
sting orbit structures, e.g., every orbit size being a power of two, and homomesic statistics (ones which have the same average over each orbit). In particular, the number of fixed points (aka 1-cycles) of a permutation appears to be homomesic with respect to three of these maps, even in one case where the orbit structures are far from nice. For the most interesting such Foatic action, we give a heap analysis and recursive structure that allows us to prove the fixed-point homomesy and orbit properties, but two other cases remain conjectural.
A clique minor in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The Hadwiger number h(G) is the maximum cardinality of a clique minor in G. This paper studies clique minors in the C
artesian product G*H. Our main result is a rough structural characterisation theorem for Cartesian products with bounded Hadwiger number. It implies that if the product of two sufficiently large graphs has bounded Hadwiger number then it is one of the following graphs: - a planar grid with a vortex of bounded width in the outerface, - a cylindrical grid with a vortex of bounded width in each of the two `big faces, or - a toroidal grid. Motivation for studying the Hadwiger number of a graph includes Hadwigers Conjecture, which states that the chromatic number chi(G) <= h(G). It is open whether Hadwigers Conjecture holds for every Cartesian product. We prove that if |V(H)|-1 >= chi(G) >= chi(H) then Hadwigers Conjecture holds for G*H. On the other hand, we prove that Hadwigers Conjecture holds for all Cartesian products if and only if it holds for all G * K_2. We then show that h(G * K_2) is tied to the treewidth of G. We also develop connections with pseudoachromatic colourings and connected dominating sets that imply near-tight bounds on the Hadwiger number of grid graphs (Cartesian products of paths) and Hamming graphs (Cartesian products of cliques).
It has been known for more than 40 years that there are posets with planar cover graphs and arbitrarily large dimension. Recently, Streib and Trotter proved that such posets must have large height. In fact, all known constructions of such posets have
two large disjoint chains with all points in one chain incomparable with all points in the other. Gutowski and Krawczyk conjectured that this feature is necessary. More formally, they conjectured that for every $kgeq 1$, there is a constant $d$ such that if $P$ is a poset with a planar cover graph and $P$ excludes $mathbf{k}+mathbf{k}$, then $dim(P)leq d$. We settle their conjecture in the affirmative. We also discuss possibilities of generalizing the result by relaxing the condition that the cover graph is planar.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
