Symbolic computation of moments of sampling distributions
| dc.creator | Di Nardo, E. | |
| dc.creator | Guarino, G. | |
| dc.creator | Senato, D. | |
| dc.date | 2008-06-01 | |
| dc.date.accessioned | 2026-07-07T09:42:07Z | |
| dc.date.available | 2026-07-07T09:42:07Z | |
| dc.description | By means of the notion of umbrae indexed by multisets, a general method to express estimators and their products in terms of power sums is derived. A connection between the notion of multiset and integer partition leads immediately to a way to speed up the procedures. Comparisons of computational times with known procedures show how this approach turns out to be more efficient in eliminating much unnecessary computation. | |
| dc.description | 21 pages, 7 tables | |
| dc.identifier | https://arxiv.org/abs/0806.0129 | |
| dc.identifier | http://arxiv.org/abs/0806.0129 | |
| dc.identifier | Computational Statistics and Data Analysis (2008) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162069 | |
| dc.subject | Computation | |
| dc.subject | Combinatorics | |
| dc.subject | Statistics Theory | |
| dc.subject | 05A40, 65C60, 62H12, 68W30 | |
| dc.title | Symbolic computation of moments of sampling distributions | |
| dc.type | text |