For a finite-dimensional representation V of a group G we introduce and study the notion of a Lie element in the group algebra k[G]. The set L(V) \subset k[G] of Lie elements is a Lie algebra and a G-module acting on the original representation V.
Lie elements often exhibit nice combinatorial properties. Thus, for G = S_n and V, a permutation representation, we prove a formula for the characteristic polynomial of a Lie element similar to the classical matrix-tree theorem.
The incidence category $\C_{\F}$ of a family $\F$ of colored posets closed under disjoint unions and the operation of taking convex sub-posets was introduced by the author in \cite{Sz}, where the Ringel-Hall algebra $\H_{\F}$ of $\C_{\F}$ was also defined. We show that if the Hasse diagrams underlying $\F$ are rooted trees, then the subspace $\n_{\F}$ of primitive elements of $\H_{\F}$ carries a pre-Lie structure, defined over $\mathbb{Z}$, and with positive structure constants. We give several examples of $\n_{\F}$, including the nilpotent subalgebras of $\mathfrak{sl}_n$, $L \mathfrak{gl}_n$…
The pre-Lie operad can be realized as a space T of labelled rooted trees. A result of F. Chapoton shows that the pre-Lie operad is a free twisted Lie algebra. That is, the S-module T is obtained as the plethysm of the S-module Lie with an S-module F. In the context of species, we construct an explicit basis of F. This allows us to give a new proof of Chapoton's results. Moreover it permits us to show that F forms a sub nonsymmetric operad of the pre-Lie operad T.
The free tracial post-Lie-Rinehart algebra of planar aromatic trees for the design of divergence-free Lie-group methods
Univ Rennes, INRIA (Research team MINGuS), IRMAR (CNRS UMR 6625) and ENS Rennes（雷恩大学、法国国家信息与自动化研究所（MINGuS研究团队）、法国国家科学研究中心IRMAR（UMR 6625）和雷恩高等师范学院）；Department of Mathematics and Statistics, UiT – The Arctic University of Norway（特罗姆瑟北极大学数学与统计系）
The aim of this paper is to bring together the three objects in the title. Recall that, given a Lie algebra $\mathfrak{g}$, the Eulerian idempotent is a canonical projection from the enveloping algebra $U(\mathfrak{g})$ to $\mathfrak{g}$. The Baker-Campbell-Hausdorff product and the Magnus expansion can both be expressed in terms of the Eulerian idempotent, which makes it interesting to establish explicit formulas for the latter. We show how to reduce the computation of the Eulerian idempotent to the computation of a logarithm in a certain pre-Lie algebra of planar, binary, rooted trees. The p…
Given a representation V of a group G, there are two natural ways of defining a representation of the group algebra k[G] in the external power V^{\wedge m}. The set L(V) of elements of k[G] for which these two ways give the same result is a Lie algebra and a representation of G. For the case when G is a symmetric group and V = C^n, a permutation representation, these spaces L(C^n) are naturally embedded into one another. We describe L(C^n) for small n and formulate some questions and conjectures. This is a note on research in progress.
We compute the expansion of the Catalan family of Lie idempotents introduced in [Menous et al., Adv. Applied Math. 51 (2013), 177-22] on the PBW basis of the Lie module. It is found that the coefficient of a tree depends only on its number of left and right internal edges. In particular, the Catalan idempotents belong to a preLie algebra based on naked binary trees, of which we identify several Lie and preLie subalgebras.
We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the two incidence matrices that capture the graph's topology. We also point out how this result can be used to calculate principal eigenvectors of the Laplacian matrices.
We develop a canonical pairing between trees and graphs, which passes to their quotients by Jacobi identities. This pairing is an effective and simple tool for understanding the Lie and Poisson operads, providing canonical duals. In the course of showing that this pairing is perfect we reprove some standard facts about the modules Lie(n), establishing standard bases as well as giving a new means to reduce to those bases. We then move on to define duals to free Lie algebras and to develop product, coproduct and operad structures. We give a brief account here to be built on in a number of differ…
We study some algebraic and combinatorial features of two algebras that arise as quotients of Temperley-Lieb algebras of type $\tilde{C}$, namely, the two-boundary Temperley-Lieb algebra and the symplectic blob algebra. We provide a monomial basis for both algebras. The elements of these bases are parameterized by certain subsets of fully commutative elements. We enumerate these elements according to their affine length.
We introduce a new basis of the Temperley-Lieb algebra. It is defined using a bijection between noncrossing partitions and fully commutative elements together with a basis introduced by Zinno, which is obtained by mapping the simple elements of the Birman-Ko-Lee braid monoid to the Temperley-Lieb algebra. The combinatorics of the new basis involve the Bruhat order restricted to noncrossing partitions. As an application we can derive properties of the coefficients of the base change matrix between Zinno's basis and the well-known diagram or Kazhdan-Lusztig basis of the Temperley-Lieb algebra. I…
The perturbation expansion of the solution of a fixed point equation or of an ordinary differential equation may be expressed as a power series in the perturbation parameter. The terms in this series are indexed by rooted trees and depend on a parameter in the equation in a way determined by the structure of the tree. Power series of this form may be considered more generally; there are two interesting and useful group structures on these series, corresponding to operations of composition and substitution. The composition operation defines the Butcher group, an infinite dimensional group that …
In the first part of this letter it will be shown that the post-Lie Magnus expansion can be interpreted as a crossed morphism between two (local) Lie group. The second part will be devoted to present two combinatorial methods, both based on special tubings on planar trees, to compute the coefficients of this remarkable formal series.
Integration of polynomials over the classical groups of unitary, orthogonal and symplectic matrices can be reduced to basic building blocks known as Weingarten functions. We present an elementary derivation of these functions.
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille completions of partial orders. We then define constructions of \emph{tree completions} that extend any tree to a minimal one satisfying the respective completeness property.
A coplactic class in the symmetric group S_n consists of all permutations in S_n with a given Schensted Q-symbol, and may be described in terms of local relations introduced by Knuth. Any Lie element in the group algebra of S_n which is constant on coplactic classes is already constant on descent classes. As a consequence, the intersection of the Lie convolution algebra introduced by Patras and Reutenauer and the coplactic algebra introduced by Poirier and Reutenauer is the Solomon descent algebra.
Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.
W. Magnus introduced a particular differential equation characterizing the logarithm of the solution of linear initial value problems for linear operators. The recursive solution of this differential equation leads to a peculiar Lie series, which is known as Magnus expansion, and involves Bernoulli numbers, iterated Lie brackets and integrals. This paper aims at obtaining further insights into the fine structure of the Magnus expansion. By using basic combinatorics on planar rooted trees we prove a closed formula for the Magnus expansion in the context of free dendriform algebra. From this, by…
Combining Stein's method with heat kernel techniques, we show that the trace of the jth power of an element of U(n,C), USp(n,C) or SO(n,R) has a normal limit with error term of order j/n. In contrast to previous works, here j may be growing with n. The technique should prove useful in the study of the value distribution of approximate eigenfunctions of Laplacians.
Using combinatorial techniques, we answer two questions about simple classical Lie groups. Define $N(G,m)$ to be the number of conjugacy classes of elements of finite order $m$ in a Lie group $G$, and $N(G,m,s)$ to be the number of such classes whose elements have $s$ distinct eigenvalues or conjugate pairs of eigenvalues. What is $N(G,m)$ for $G$ a unitary, orthogonal, or symplectic group? What is $N(G,m,s)$ for these groups? For some cases, the first question was answered a few decades ago via group-theoretic techniques. It appears that the second question has not been asked before; here it …
