In 1949, Wever observed that the degree d of an invariant Lie polynomial must be a multiple of the number q of generators of the free Lie algebra. He also found that there are no invariant Lie polynomials in the following cases: q = 2, d = 4; q = 3, d = 6; d = q ≥ 3. Wever gave a formula for the number of invariants for q = 2 in the natural representation of sl(2). In 1958, Burrow extended Wevers formula to q > 1 and d = mq where m > 1. In the present thesis, we concentrate on finding invariant Lie polynomials (simply called Lie invariants) in the natural representations of sl(2) and sl(3), and in the adjoint representation of sl(2). We first review the method to construct the Hall basis of the free Lie algebra and the way to transform arbitrary Lie words into linear combinations of Hall words. To find the Lie invariants, we need to find the nullspace of an integer matrix, and for this we use the Hermite normal form. After that, we review the generalized Witt dimension formula which can be used to compute the number of primitive Lie invariants of a given degree. Secondly, we recall the result of Bremner on Lie invariants of degree ≤ 10 in the natural representation of sl(2). We extend these results to compute the Lie invariants of degree 12 and 14. This is the first original contribution in the present thesis. Thirdly, we compute the Lie invariants in the adjoint representation of sl(2) up to degree 8. This is the second original contribution in the present thesis. Fourthly, we consider the natural representation of sl(3). This is a 3-dimensional natural representation of an 8-dimensional Lie algebra. Due to the huge number of Hall words in each degree and the limitation of computer hardware, we compute the Lie invariants only up to degree 12. Finally, we discuss possible directions for extending the results. Because there are infinitely many different simple finite dimensional Lie algebras and each of them has infinitely many distinct irreducible representations, it is an open-ended problem.

In 1949, Wever observed that the degree d of an invariant Lie polynomial must be a multiple of the number q of generators of the free Lie algebra. He also found that there are no invariant Lie polynomials in the following cases: q = 2, d = 4; q = 3, d = 6; d = q ≥ 3. Wever gave a formula for the number of invariants for q = 2 in the natural representation of sl(2). In 1958, Burrow extended Wevers formula to q > 1 and d = mq where m > 1. In the present thesis, we concentrate on finding invariant Lie polynomials (simply called Lie invariants) in the natural representations of sl(2) and sl(3), and in the adjoint representation of sl(2). We first review the method to construct the Hall basis of the free Lie algebra and the way to transform arbitrary Lie words into linear combinations of Hall words. To find the Lie invariants, we need to find the nullspace of an integer matrix, and for this we use the Hermite normal form. After that, we review the generalized Witt dimension formula which can be used to compute the number of primitive Lie invariants of a given degree. Secondly, we recall the result of Bremner on Lie invariants of degree ≤ 10 in the natural representation of sl(2). We extend these results to compute the Lie invariants of degree 12 and 14. This is the first original contribution in the present thesis. Thirdly, we compute the Lie invariants in the adjoint representation of sl(2) up to degree 8. This is the second original contribution in the present thesis. Fourthly, we consider the natural representation of sl(3). This is a 3-dimensional natural representation of an 8-dimensional Lie algebra. Due to the huge number of Hall words in each degree and the limitation of computer hardware, we compute the Lie invariants only up to degree 12. Finally, we discuss possible directions for extending the results. Because there are infinitely many different simple finite dimensional Lie algebras and each of them has infinitely many distinct irreducible representations, it is an open-ended problem.

No description available.

La combinatoire a permis de résoudre certains problèmes en Mathématiques, en Physique et en Informatique, en retour celles-ci inspirent des questions nouvelles à la combinatoire. Ce mémoire de thèse intitulé "Combinatoire et algorithme des factorisations tangentes à l'identité" regroupe plusieurs travaux sur la combinatoire des déformations du produit de Shuffle. L'objectif de cette thèse est d'écrire des factorisations dont le terme principal est l'identité à travers l'utilisation d'outils portant principalement sur la combinatoire des mots (ordres, graduation etc.). Dans le cas classique, soit F une algèbre libre. En raison du fait que F est une algèbre enveloppante, on a une factorisation exacte de l'identité de End(F) = F*⨶F comme un produit infini d'exponentielles (End(F) étant muni du produit de Shuffle sur la gauche et de la concaténation sur la droite, une représentation fidèle du produit de convolution). La procédure est la suivante : premièrement on commence avec une base de Poincaré-Birkhoff-Witt, deuxièmement on calcule la famille des formes coordonnées et alors les propriétés (combinatoires) non triviales de ces familles en dualité donne la factorisation. Si on part de l'autre côté, l'écriture pour le même produit ne donne exactement l'identité que sous des conditions très restrictives que nous précisons ici. Dans de nombreux autres cas (déformés), la construction explicite des paires de bases en dualité nécessite une étude combinatoire et algorithmique que nous fournissons dans ce mémoire. / Combinatorics has solved many problems in Mathematics, Physics and Computer Science, in return these domains inspire new questions to combinatorics. This memoir entitled "Combinatorics and algorithmics of factorization tangent to indentity includes several works on the combinatorial deformations of the shuffle product. The aim of this thesis is to write factorizations wich principal term is the identity through the use of tools relating mainly to combinatorics on the words (orderings, grading etc). In the classical case, let F be the free algebra. Due to the fact that F is an enveloping algebra, one has an exact factorization of the identity of End(F) = F⨶F as an infinite product of exponentials (End(F) being endowed with the shuffle product on the left and the concatenation on the right, a faithful representation of the convolution product) as follows : first on begins with a PBW basis, second one computes the family of coordinate forms and then non-trivial (combinatorial) properties of theses families in duality gives the factorization. Starting from the other side and writing the same product does give exactly identity only under very restrictive conditions that we clarify here. In many other (deformed) cases, the explicit construction of pairs of bases in duality requires combinatorial and algorithmic studies that we provide in this memoir.