Skip to main content
SpringerLink
Log in

Construction of numbering fungtionals on combina torial sets

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. I. Mudrov, “A numbering algorithm for combinations,” Zh. Vychisl. Mat. Mat. Fiz., No. 4, 776–778 (1965).

    Google Scholar 

  2. B. M. Zlotnik, “A numbering algorithm for permutations with a limited repetition of objects,” Kibernetika, No. 5, 100–102 (1971).

    Google Scholar 

  3. B. M. Zlotnik, “A numbering algorithm for permutations,” No. 3525-71, VINITI, Moscow (1971), pp. 1–4.

    Google Scholar 

  4. B. M. Zlotnik, “A numbering algorithm for the elements of a sign-alternating group,” Kibernetika, No. 1, 147–149 (1974).

    Google Scholar 

  5. B. M. Zlotnik, “A numbering algorithm for the partition of a number s into m parts,” Kibernetika, No. 3, 44–47 (1976).

    Google Scholar 

  6. H. J. Ryser, Combinatorial Mathematics, Carus Mathematical Monographs, No. 14, Mathematical Association of America (1963).

  7. A. Kaufman, Introduction to Applied Combinatorics [Russian translation], Mir, Moscow (1975).

    Google Scholar 

Download references

Authors
  1. A. G. Yuferov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 5, pp. 28–32, September–October, 1980.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yuferov, A.G. Construction of numbering fungtionals on combina torial sets. Cybern Syst Anal 16, 663–668 (1980). https://doi.org/10.1007/BF01078495

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01078495

Keywords

Search

Navigation