Symbolic moment calculus. I: Foundations and permutation pattern statistics

DOI10.1007/S00026-004-0226-2MaRDI QIDQ1890407zbMATH OpenOpenAlexFDO

Authors Doron Zeilberger

Publication date 3 January 2005

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-004-0226-2

zbMATH Keywords

automated combinatoricsrestricted permutationsWilf equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

The article presents a methodology for using computer algebra systems to derive higher moments of interesting combinatorial random variables and applies it to pattern statistics of permutations.

Recommendations

• Calculation of moments of combinatorial statistics of symmetrical dependent random variables
• On the asymptotic statistics of the number of occurrences of multiple permutation patterns
• Symbolic computation of moments of sampling distributions
• Stable characters from permutation patterns
• Permutations, moments, measures

Cited in

(9)

• Symbolic computation of moments of sampling distributions
• Some combinatorial results first found using computer algebra
• Stable characters from permutation patterns
• An experimental mathematics approach to the area statistic of parking functions
• Positivity of permutation pattern character polynomials
• Using nonlinear difference equations to study Quicksort algorithms
• Calculation of moments of combinatorial statistics of symmetrical dependent random variables
• Moments of the one-shuffle no-feedback card guessing game
• Moments of permutation statistics and central limit theorems

Describes a project that uses

Uses Software

• SMCper

This page was built for publication: Symbolic moment calculus. I: Foundations and permutation pattern statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1890407)