Travis Herbranson ; Don Rawlings - A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials

dmtcs:2281 - Discrete Mathematics & Theoretical Computer Science, January 1, 2001, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) - https://doi.org/10.46298/dmtcs.2281
A Sequential Search Distribution: Proofreading, Russian Roulette, and the Incomplete q-Eulerian Polynomials

Authors: Travis Herbranson ; Don Rawlings

    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 simple and efficient formulas are obtained.From our main theorem, we further (1) deduce the inverse absorption distribution and (2) determine the expected number of times the survivor pulls the trigger in an n-player game of Russian roulette.


    Volume: DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
    Section: Proceedings
    Published on: January 1, 2001
    Imported on: November 21, 2016
    Keywords: California Polytechnic State University,San Luis Obispo,California 93407,[INFO] Computer Science [cs],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

    Share

    Consultation statistics

    This page has been seen 138 times.
    This article's PDF has been downloaded 76 times.