A Hopf algebra for counting cycles
From MaRDI portal
Publication:1709547
DOI10.1016/j.disc.2017.10.002zbMath1383.05173arXiv1607.00902OpenAlexW2460501136MaRDI QIDQ1709547
Pierre-Louis Giscard, Richard C. Wilson, Paul Rochet
Publication date: 5 April 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00902
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relations between connected and self-avoiding hikes in labelled complete digraphs
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Complexity of counting cycles using zeons
- A finite-difference sieve to count paths and cycles by length
- Finding and counting given length cycles
- Inclusion and exclusion algorithm for the Hamiltonian path problem
- The self-avoiding walk.
- On Dynkin and Klyachko idempotents in graded bialgebras
- The number of \(n\)-cycles in a graph
- Hopf algebras and identities in free partially commutative monoids
- Antipodes and incidence coalgebras
- Dynamic programming meets the principle of inclusion and exclusion
- Combinatorics on traces
- Determinants and Möbius functions in trace monoids
- Incidence Hopf algebras
- Immanantal invariants of graphs
- Higher Lie idempotents
- A general purpose algorithm for counting simple cycles and simple paths of any length
- Logarithmic derivatives and generalized Dynkin operators
- Zur Charakterisierung Liescher Elemente in freien Algebren
- On the structure of Hopf algebras
- Combinatorial problems of commutation and rearrangements
- Single-hook characters and hamiltonian circuits∗
- Finding All the Elementary Circuits of a Directed Graph
- Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs
- Determinant Sums for Undirected Hamiltonicity
- Transitive orientations, Möbius functions, and complete semi-Thue systems for free partially commutative monoids
This page was built for publication: A Hopf algebra for counting cycles
