Skip to main content
SpringerLink
Log in

Extremal Properties of Sums of Binomial Coefficients

  • Published:
Journal of Mathematical Sciences Aims and scope Submit manuscript

Abstract

Some extremal problems for the sums of binomial coefficients that arise in research on estimating the computational complexity of discrete optimization algorithms are examined. These extremal problems are solved using the theory of majorization and useful inequalities are introduced for the sums of binomial coefficients.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. N. N. Kanaeva, “A study of estimates of the efficiency of a local decomposition algorithm discrete optimization problems, ” Dinam. Sist., 15, 187–193 (1999), KFT, Simferopol.

    Google Scholar 

  2. A. B. Marshall andN. Alkin, Inequalities: Majorization Theory and Its Applications [Russian translation], Mir, Moscow (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Crimean Academy of Environmental Protection and Resort Construction, Ukraine

    O. A. Shcherbina & N. N. Kanaeva

Authors
  1. O. A. Shcherbina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. N. Kanaeva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shcherbina, O.A., Kanaeva, N.N. Extremal Properties of Sums of Binomial Coefficients. Journal of Mathematical Sciences 107, 4485–4490 (2001). https://doi.org/10.1023/A:1012537407986

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1012537407986

Keywords

Search

Navigation