We consider the well-known problem of how to arrange coins in a fountain and generalize it, by using combinatorial objects known as staircase polyominoes or p-histograms. We show how it is possible to obtain an asymptotic formula approximating the number of p-histograms of area n, as n --> infinity.
Fountains and histograms / MERLINI D.; R. SPRUGNOLI. - In: JOURNAL OF ALGORITHMS. - ISSN 0196-6774. - STAMPA. - 44:(2002), pp. 159-176. [10.1016/S0196-6774(02)00211-0]
Fountains and histograms
MERLINI, DONATELLA;SPRUGNOLI, RENZO
2002
Abstract
We consider the well-known problem of how to arrange coins in a fountain and generalize it, by using combinatorial objects known as staircase polyominoes or p-histograms. We show how it is possible to obtain an asymptotic formula approximating the number of p-histograms of area n, as n --> infinity.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
r14.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Tutti i diritti riservati
Dimensione
258.15 kB
Formato
Adobe PDF
|
258.15 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
