Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length
From MaRDI portal
Publication:6212752
arXiv0902.2274MaRDI QIDQ6212752FDOQ6212752
Authors: B. Durhuus, Søren Eilers 
Publication date: 13 February 2009
Abstract: We consider pyramids made of one-dimensional pieces of fixed integer length a and which may have pairwise overlaps of integer length from 1 to a. We prove that the number of pyramids of size m, i.e. consisting of m pieces, equals (am-1,m-1) for each a >= 2. This generalises a well known result for a = 2. A bijective correspondence between so-called right (or left) pyramids and a-ary trees is pointed out, and it is shown that asymptotically the average width of pyramids is proportional to the square root of the size.
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Exact enumeration problems, generating functions (05A15)
This page was built for publication: Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6212752)
