An Hopf algebra for counting simple cycles - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2017

An Hopf algebra for counting simple cycles


Simple cycles, also known as self-avoiding polygons, are cycles on graphs which are not allowed to visit any vertex more than once. We present an exact formula for enumerating the simple cycles of any length on any directed graph involving a sum over its induced subgraphs. This result stems from an Hopf algebra, which we construct explicitly, and which provides further means of counting simple cycles. Finally, we obtain a more general theorem asserting that any Lie idempotent can be used to enumerate simple cycles.
Fichier principal
Vignette du fichier
PXperm_V7.pdf (444.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01341208 , version 1 (04-07-2016)
hal-01341208 , version 2 (27-02-2017)



Pierre-Louis C Giscard, Paul Rochet, Richard C Wilson. An Hopf algebra for counting simple cycles. 2017. ⟨hal-01341208v2⟩
201 View
207 Download



Gmail Facebook X LinkedIn More