A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials
The distribution for the number of searches needed to find k of n lost objects is expressed in terms of a refinement of the q-Eulerian polynomials, for which formulae are developed involving homogeneous symmetric polynomials. In the case when k=n and the find probability remains constant, relatively...
Main Authors: | Travis Herbranson, Don Rawlings |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2281/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Tilings of a Domain on a Hexagon Mesh with Balanced 3-Tiles
by: Gilles Radenne
Published: (2001-01-01) -
The Many Faces of Alternating-Sign Matrices
by: James Propp
Published: (2001-01-01) -
Tiling the Line with Triples
by: Aaron Meyerowitz
Published: (2001-01-01) -
An n-Dimensional Generalization of the Rhombus Tiling
by: Joakim Linde, et al.
Published: (2001-01-01)