Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length

Details Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length

2009-02-13

arxiv.org/abs/0902.2274v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of pyramids of one-dimensional pieces of arbitrary fixed integer length will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-357166