Combinatorial and arithmetic identities based on formal group laws

1987 ◽  
pp. 17-34 ◽  
Author(s):  
Andrew Baker
Keyword(s):  
Formal Group ◽  
Formal Group Laws

scholarly journals Quantum Cobordisms and Formal Group Laws

2007 ◽  
pp. 155-171 ◽  
Author(s):  
Tom Coates ◽  
Alexander Givental
Keyword(s):  
Formal Group ◽  
Formal Group Laws

Appendix 2 Formal Group Laws

1986 ◽  
pp. 354-379
Keyword(s):  
Formal Group ◽  
Formal Group Laws

Addition Theorems, Formal Group Laws and Integrable Systems

2010 ◽  
Author(s):  
V. M. Buchstaber ◽  
E. Yu. Bunkova ◽  
Piotr Kielanowski ◽  
Victor Buchstaber ◽  
Anatol Odzijewicz ◽  
...  
Keyword(s):  
Integrable Systems ◽  
Formal Group ◽  
Addition Theorems ◽  
Formal Group Laws

Coefficient rings of formal group laws

2015 ◽  
Vol 206 (11) ◽  
pp. 1524-1563 ◽  
Author(s):  
V M Buchstaber ◽  
A V Ustinov
Keyword(s):  
Formal Group ◽  
Formal Group Laws

scholarly journals Formal Group Laws and Chromatic Symmetric Functions of Hypergraphs

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Jair Taylor
Keyword(s):  
Power Series ◽  
Symmetric Functions ◽  
Formal Group ◽  
Combinatorial Interpretation ◽  
Recursive Structure ◽  
Combinatorial Objects ◽  
Formal Group Law ◽  
International Audience ◽  
Formal Group Laws ◽  
Group Law

International audience If $f(x)$ is an invertible power series we may form the symmetric function $f(f^{-1}(x_1)+f^{-1}(x_2)+...)$ which is called a formal group law. We give a number of examples of power series $f(x)$ that are ordinary generating functions for combinatorial objects with a recursive structure, each of which is associated with a certain hypergraph. In each case, we show that the corresponding formal group law is the sum of the chromatic symmetric functions of these hypergraphs by finding a combinatorial interpretation for $f^{-1}(x)$. We conjecture that the chromatic symmetric functions arising in this way are Schur-positive. Si $f(x)$ est une série entière inversible, nous pouvons former la fonction symétrique $f(f^{-1}(x_1)+f^{-1}(x_2)+...)$ que nous appelons une loi de groupe formel. Nous donnons plusieurs exemples de séries entières $f(x)$ qui sont séries génératrices ordinaires pour des objets combinatoires avec une structure récursive, chacune desquelles est associée à un certain hypergraphe. Dans chaque cas, nous donnons une interprétation combinatoire à $f^{-1}(x)$, ce qui nous permet de montrer que la loi de groupe formel correspondante est la somme des fonctions symétriques chromatiques de ces hypergraphes. Nous conjecturons que les fonctions symétriques chromatiques apparaissant de cette manière sont Schur-positives.

scholarly journals Equivariant formal group laws and complex oriented cohomology theories

2001 ◽  
Vol 3 (2) ◽  
pp. 225-263 ◽  
Author(s):  
J. P. C. Greenlees
Keyword(s):  
Formal Group ◽  
Oriented Cohomology ◽  
Formal Group Laws
Sign in / Sign up

Export Citation Format

Share Document