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

Excedance numbers for permutations in complex reflection groups

229   0   0.0 ( 0 )
 نشر من قبل Toufik Mansour Dr.
 تاريخ النشر 2007
  مجال البحث
والبحث باللغة English




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

Recently, Bagno, Garber and Mansour studied a kind of excedance number on the complex reflection groups and computed its multidistribution with the number of fixed points on the set of involutions in these groups. In this note, we consider the similar problems in more general cases and make a correction of one result obtained by them.



قيم البحث

اقرأ أيضاً

V.F. Molchanov considered the Hilbert series for the space of invariant skew-symmetric tensors and dual tensors with polynomial coefficients under the action of a real reflection group, and speculated that it had a certain product formula involving t he exponents of the group. We show that Molchanovs speculation is false in general but holds for all coincidental complex reflection groups when appropriately modified using exponents and co-exponents. These are the irreducible well-generated (i.e., duality) reflection groups with exponents forming an arithmetic progression and include many real reflection groups and all non-real Shephard groups, e.g., the Shephard-Todd infinite family $G(d,1,n)$. We highlight consequences for the $q$-Narayana and $q$-Kirkman polynomials, giving simple product formulas for both, and give a $q$-analogue of the identity transforming the $h$-vector to the $f$-vector for the coincidental finite type cluster/Cambrian complexes of Fomin--Zelevinsky and Reading.
210 - Tongyuan Zhao , Yue Sun , 2021
A ballot permutation is a permutation {pi} such that in any prefix of {pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)}, which denot e the number of permutations of length n with d descents and j as the first letter. Besides, by a series of calculations with generatingfunctionology, we confirm a recent conjecture of Wang and Zhang for ballot permutations.
A notion of $t$-designs in the symmetric group on $n$ letters was introduced by Godsil in 1988. In particular $t$-transitive sets of permutations form a $t$-design. We derive special lower bounds for $t=1$ and $t=2$ by a power moment method. For gene ral $n,t$ we give a %linear programming lower bound . For $nge 4$ and $t=2,$ this bound is strong enough to show a lower bound on the size of such $t$-designs of $n(n-1)dots (n-t+1),$ which is best possible when sharply $t$-transitive sets of permutations exist. This shows, in particular, that tight $2$-designs do not exist.
68 - Orli Herscovici 2020
In this work we propose a combinatorial model that generalizes the standard definition of permutation. Our model generalizes the degenerate Eulerian polynomials and numbers of Carlitz from 1979 and provides missing combinatorial proofs for some relations on the degenerate Eulerian numbers.
The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $Gamma$ is the set of all fixing numbers of finite graphs with a utomorphism group $Gamma$. Several authors have studied the distinguishing number of a graph, the smallest number of labels needed to label $G$ so that the automorphism group of the labeled graph is trivial. The fixing number can be thought of as a variation of the distinguishing number in which every label may be used only once, and not every vertex need be labeled. We characterize the fixing sets of finite abelian groups, and investigate the fixing sets of symmetric groups.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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