We consider an indefinite inner product on the algebra of rational functions over the complex numbers, and we obtain a coproduct, which is dual of the usual multiplication, that gives a structure of infinitesimal coalgebra on the rational functions. We also obtain a representation of the finite dual
On a Hopf Algebra in Graph Theory
β Scribed by Sergei K. Lando
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 230 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
β¦ Synopsis
We introduce and start the study of a bialgebra of graphs, which we call the 4-bialgebra, and of the dual bialgebra of 4-invariants. The 4-bialgebra is similar to the ring of graphs introduced by W. T. Tutte in 1946, but its structure is more complicated. The roots of the definition are in low dimensional topology, namely, in the recent theory of Vassiliev knot invariants. In particular, 4-invariants of graphs determine Vassiliev invariants of knots. The relation between the two notions is discussed.
π SIMILAR VOLUMES
Let A A be a Hopf algebra and β« be a bicovariant first order differential calculus over A A. It is known that there are three possibilities to construct a differential Hopf algebra β« n s β« m rJ that contains β« as its first order part. Corresponding to the three choices of the ideal J, we distinguish
In the context of finite-dimensional cocommutative Hopf algebras, we prove versions of various group cohomology results: the QuillenαVenkov theorem on detecting nilpotence in group cohomology, Chouinard's theorem on determining whether a kG-module is projective by restricting to elementary abelian p
The trace of powers of the square of the antipode s 2 of a finite-dimensional Hopf algebra A over a field k is studied. It is shown in many cases that the trace function vanishes on s 2m when s 2m = 1 A . Finer properties of the antipode are related to this phenomenon.  2002 Elsevier Science (USA)
A generalization of Nash-Williams' lemma is proved for the structure of \(m\)-uniform null ( \(m-k\) )-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tourn