A Statistic on Involutions

نویسندگان

  • RAJENDRA S. DEODHAR
  • MURALI K. SRINIVASAN
چکیده

We define a statistic, called weight, on involutions and consider two applications in which this statistic arises. Let I (n)denote the set of all involutions on [n](= {1, 2, . . . , n}) and let F(2n)denote the set of all fixed point free involutions on [2n]. For an involution δ, let |δ| denote the number of 2-cycles in δ. Let [n]q = 1+q+· · ·+qn−1 and let (k)q denote the q-binomial coefficient. There is a statistic wt on I (n) such that the following results are true. (i) We have the expansion ( n k ) q = ∑ δ∈I (n) (q − 1)|δ|qwt(δ) ( n − 2|δ| k − |δ| )

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The descent statistic on involutions is not log -

We establish a combinatorial connection between the sequence (in,k) counting the involutions on n letters with k descents and the sequence (an,k) enumerating the semistandard Young tableaux on n cells with k symbols. This allows us to show that the sequences (in,k) are not log-concave for some values of n, hence answering a conjecture due to F. Brenti.

متن کامل

A weight statistic and partial order on products of m-cycles

R. S. Deodhar and M. K. Srinivasan defined a weight statistic on the set of involutions in the symmetric group and proved several results about the properties of this weight. These results include a recursion for a weight generating function, that the weight provides a grading for the set of fixed-point free involutions under a partial order related to the Bruhat partial order, and that this gr...

متن کامل

The Cycle Descent Statistic on Permutations

In this paper we study the cycle descent statistic on permutations. Several involutions on permutations and derangements are constructed. Moreover, we construct a bijection between negative cycle descent permutations and Callan perfect matchings.

متن کامل

The descent statistic on involutions is not log-concave

We establish a combinatorial connection between the sequence (in,k) counting the involutions on n letters with k descents and the sequence (an,k) enumerating the semistandard Young tableaux on n cells with k symbols. This allows us to show that the sequences (in,k) are not log-concave for some values of n, hence answering a conjecture due to F. Brenti.

متن کامل

Permutation statistics on involutions

In this paper we look at polynomials arising from statistics on the classes of involutions, In, and involutions with no fixed points, Jn, in the symmetric group. Our results are motivated by F. Brenti’s conjecture [3] which states that the Eulerian distribution of In is logconcave. Symmetry of the generating functions is shown for the statistics d, maj and the joint distribution (d, maj). We sh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001