Andrea Bedini et al 2008 J. Phys. A: Math. Theor. 41 205003 doi:10.1088/1751-8113/41/20/205003
Andrea Bedini, Sergio Caracciolo and Andrea Sportiello
Show affiliationsWe 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 also consider some applications, such as counting hyperforests in the k-uniform complete hypergraph and the one complete in hyperedges of all dimensions. Some general features of the asymptotic regimes for a large number of connected components are discussed.
05A15 Exact enumeration problems, generating functions (See also 33Cxx, 33Dxx)
Issue 20 (23 May 2008)
Received 11 February 2008
Published 24 April 2008
Andrea Bedini et al 2008 J. Phys. A: Math. Theor. 41 205003
Christian D Ott 2009 Class. Quantum Grav. 26 204015
I Halm et al 1998 Phys. Scr. 1998 31
ChiYung Yam et al 2008 Nanotechnology 19 495203
Cécile Monthus and Thomas Garel 2008 J. Phys. A: Math. Theor. 41 375005
I A Ivanov and A S Kheifets 2009 J. Phys. B: At. Mol. Opt. Phys. 42 145601
David H Bailey et al 2008 J. Phys. A: Math. Theor. 41 205203
Jun Zhang et al 2007 J. Phys.: Condens. Matter 19 256204
B G Logan et al 2008 J. Phys.: Conf. Ser. 112 032029
L D Faddeev and A Yu Volkov 2008 J. Phys. A: Math. Theor. 41 194008