English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Polynomial invariants and reciprocity theorems for the Hopf monoid of hypergraphs and its sub-monoids