Geodesic
Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

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 give a combinatorial proof that the number of pyramids of size $m$, i.e., consisting of $m$ pieces, equals $\binom{am-1}{m-1}$ for each $a \geq 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 equals $\sqrt{\frac{\pi}{2} a(a-1)m}$. 
@article{DMTCS_2010_special_258_a30,
     author = {Durhuus, Bergfinnur and Eilers, S{\o}ren},
     title = {Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2794},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2794/}
}
TY  - JOUR
AU  - Durhuus, Bergfinnur
AU  - Eilers, Søren
TI  - Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2794/
DO  - 10.46298/dmtcs.2794
LA  - en
ID  - DMTCS_2010_special_258_a30
ER  - 
%0 Journal Article
%A Durhuus, Bergfinnur
%A Eilers, Søren
%T Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2794/
%R 10.46298/dmtcs.2794
%G en
%F DMTCS_2010_special_258_a30
Durhuus, Bergfinnur; Eilers, Søren. Combinatorial aspects of pyramids of one-dimensional pieces of fixed integer length. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2794. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2794/

Cité par Sources :