✦ LIBER ✦

Symmetric Functions, Formal Group Laws, and Lazard's Theorem

✍ Scribed by Cristian Lenart

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 303 KB
Volume: 134
Category: Article
ISSN: 0001-8708
DOI: 10.1006/aima.1997.1696

No coin nor oath required. For personal study only.

✦ Synopsis

Lazard's theorem is a central result in formal group theory; it states that the ring over which the universal formal group law is defined (known as the Lazard ring) is a polynomial algebra over the integers with infinitely many generators. This ring also shows up in algebraic topology as the complex cobordism ring. The main aim of this paper is to show that the polynomial structure of the Lazard ring follows from the polynomial structure of a certain subalgebra of symmetric functions with integer coefficients. The connection between symmetric functions and the Lazard ring is provided by a certain Hopf algebra map from symmetric functions to the covariant bialgebra of a formal group law. We study this map by deriving formulas for the images of certain symmetric functions; in passing, we use this map to prove some symmetric function and Catalan number identities. Based on the above results, we prove Lazard's theorem, and present an application to the construction of certain p-typical formal group laws over the integers. Combinatorial methods play a major role throughout this paper.

📜 SIMILAR VOLUMES

Symmetrical Functions and Macdonald′s Re

Symmetrical Functions and Macdonald′s Result for Top Connexion Coefficients in the Symmetrical Group

✍ I.P. Goulden; D.M. Jackson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 510 KB

In unpublished work, Macdonald gave an indirect proof that the connexion coefficients for certain symmetric functions coincide with the connexion coefficients of the class algebra of the symmetric group. We give a direct proof of this result and demonstrate the use of these functions in a number of

A Markov chain on the symmetric group an

A Markov chain on the symmetric group and Jack symmetric functions

✍ Phil Hanlon 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 872 KB

Hanlon, P., A Markov chain on the symmetric group and Jack symmetric functions, Discrete Mathematics 99 (1992) 123-140. Diaconis and Shahshahani studied a Markov chain Wf(l) whose states are the elements of the symmetric group S,. In W,(l), you move from a permutation n to any permutation of the for

Functions on tableaux and frames of the

Functions on tableaux and frames of the symmetric group

✍ Susan Schindler; R. Mirman 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 364 KB

Connection between the manne—Åberg theor

Connection between the manne—Åberg theorem and a sum rule derived in the framework of the green's-function formalism

✍ Dietmar Saddei; Hans-Joachim Freund; Georg Hohlneicher 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 259 KB

A sum rule for ionization potentkds. similar to the Marine-Xberg theorem, is derived in the fmmeliork of a many-body Green's\_function formaiism\_This sum rule is shown to be valid under main& t\\o conditions (3 the constant term and the aftiity poks of the seff-energ part tie to be neglected; (ii)

Representations of the symmetric group g

Representations of the symmetric group generated by projected spin functions: A graphical approach

✍ Sten Rettrup; Ruben Pauncz 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 507 KB

The representation matrices generated by the projected spin functions have some very interesting properties. All the matrix elements are integers and they are quite sparse. A very efficient algorithm is presented for the calculation of these representation matrices based on a graphical approach and

Minimal Factorizations of a Cycle and Ce

Minimal Factorizations of a Cycle and Central Multiplicative Functions on the Infinite Symmetric Group

✍ Philippe Biane 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 508 KB

We show that the number of factorizations \_=/ 1 } } } / r of a cycle of length n into a product of cycles of lengths a 1 , ..., a r , with r j=1 (a j &1)=n&1, is equal to n r&1 . This generalizes a well known result of J. Denes, concerning factorizations into a product of transpositions. We investi