P-Partitions and a Multi-Parameter Klyachko Idempotent

نویسندگان

  • Peter R. W. McNamara
  • Christophe Reutenauer
چکیده

Because they play a role in our understanding of the symmetric group algebra, Lie idempotents have received considerable attention. The Klyachko idempotent has attracted interest from combinatorialists, partly because its definition involves the major index of permutations. For the symmetric group Sn, we look at the symmetric group algebra with coefficients from the field of rational functions in n variables q1, . . . , qn. In this setting, we can define an n-parameter generalization of the Klyachko idempotent, and we show it is a Lie idempotent in the appropriate sense. Somewhat surprisingly, our proof that it is a Lie element emerges from Stanley’s theory of P -partitions.

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

ثبت نام

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

منابع مشابه

Tsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions

The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...

متن کامل

Hall basis of twisted Lie algebras

In this paper we define a minimal generating system for the free twisted Lie algebra. This gives a correct formulation and a proof to an old statement of Barratt. To this aim we use properties of the Lyndon words and of the Klyachko idempotent which generalize to twisted Hopf algebras some similar results well known in the classical case.

متن کامل

A combinatorial proof of Klyachko’s Theorem on Lie representations

Let L be a free Lie algebra of finite rank r over an arbitrary field K of characteristic 0, and let Ln denote the homogeneous component of degree n in L . Viewed as a module for the general linear group GL(r, K ), Ln is known to be semisimple with the isomorphism types of the simple summands indexed by partitions of n with at most r parts. Klyachko proved in 1974 that, for n > 6, almost all suc...

متن کامل

Post-Processing Partitions to Identify Domains of Modularity Optimization

We introduce the Convex Hull of Admissible Modularity Partitions (CHAMP) algorithm to prune and prioritize different network community structures identified across multiple runs of possibly various computational heuristics. Given a set of partitions, CHAMP identifies the domain of modularity optimization for each partition-i.e., the parameter-space domain where it has the largest modularity rel...

متن کامل

Sphere-separable partitions of multi-parameter elements

We show the optimality of sphere-separable partitions for problems where n vectors in d-dimensional space are to be partitioned into p categories to minimize a cost function which is dependent in the sum of the vectors in each category; the sum of the squares of their Euclidean norms; and the number of elements in each category.We further show that the number of these partitions is polynomial i...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Electr. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2005