Hyperforests on the complete hypergraph by Grassmann integral representation
From MaRDI portal
Abstract: We study the generating function of rooted and unrooted hyperforests in a general complete hypergraph with n vertices by using a novel Grassmann representation of their generating functions. We show that this new approach encodes the known results about the exponential generating functions for the different number of vertices. We consider also some applications as counting hyperforests in the k-uniform complete hypergraph and the one complete in hyperedges of all dimensions. Some general feature of the asymptotic regimes for large number of connected components is discussed.
Recommendations
Cited in
(8)- On the number of hyperforests
- Phase transition in the spanning-hyperforest model on complete hypergraphs
- Random spanning forests and hyperbolic symmetry
- Recognizable series on hypergraphs
- Spanning forests and \(\mathrm{OSP}(N|2M)\)-invariant \(\sigma\)-models
- Grassmann integral representation for spanning hyperforests
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- Spanning forests on random planar lattices
This page was built for publication: Hyperforests on the complete hypergraph by Grassmann integral representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503769)
