IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v78y2008i17p2992-2996.html
   My bibliography  Save this article

Maximal probabilities of convolution powers of discrete uniform distributions

Author

Listed:
  • Mattner, Lutz
  • Roos, Bero

Abstract

We prove optimal constant over root n upper bounds for the maximal probabilities of nth convolution powers of discrete uniform distributions.

Suggested Citation

  • Mattner, Lutz & Roos, Bero, 2008. "Maximal probabilities of convolution powers of discrete uniform distributions," Statistics & Probability Letters, Elsevier, vol. 78(17), pages 2992-2996, December.
    • Handle: RePEc:eee:stapro:v:78:y:2008:i:17:p:2992-2996
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(08)00255-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kanter, Marek, 1976. "Probability inequalities for convex sets and multidimensional concentration functions," Journal of Multivariate Analysis, Elsevier, vol. 6(2), pages 222-236, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Denis Bouyssou & Thierry Marchant & Marc Pirlot, 2021. "The size of the maximum antichains in products of linear orders," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 648-659, October.
    2. Denis Bouyssou & Thierry Marchant & Marc Pirlot, 2021. "The size of the maximum antichains in products of linear orders," Post-Print hal-03047087, HAL.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:78:y:2008:i:17:p:2992-2996. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.