The Hopf monoid of hypergraphs and its sub-monoids: basic invariant and reciprocity theorem

From MaRDI portal
Publication:2294101

DOI10.37236/8740zbMATH Open1434.05100arXiv1806.08546OpenAlexW2901299270MaRDI QIDQ2294101FDOQ2294101


Authors: J.-C. Aval, Theo Karaboghossian, Adrian Tanasa Edit this on Wikidata


Publication date: 10 February 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In arXiv:1709.07504 Ardila and Aguiar give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on hypergraphs. We give a combinatorial interpretation of this invariant on negative integers which leads to a reciprocity theorem on hypergraphs. Finally, we use this invariant to recover well-known invariants on other combinatorial objects (graphs, simplicial complexes, building sets etc) as well as the associated reciprocity theorems.


Full work available at URL: https://arxiv.org/abs/1806.08546

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (10)





This page was built for publication: The Hopf monoid of hypergraphs and its sub-monoids: basic invariant and reciprocity theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294101)