EN|RU
English version:
Journal of Applied and Industrial Mathematics, 2018, 12:2, 297-301

Volume 25, No 2, 2018, P. 54-61

UDC 519.8
V. K. Leontiev
On a partial order related to divisibility

Abstract:
We estimate the number of monotone discrete functions related to the divisibility of numbers.
Illustr. 1, bibliogr. 6.

Keywords: partial order, monotone function, antichain.

DOI: 10.17377/daio.2018.25.568

Vladimir K. Leontiev 1
1. Dorodnicyn Computing Centre of RAS,
40 Vavilov St., 119333 Moscow, Russia
e-mail: vkleontiev@yandex.ru

Received 2 March 2017
Revised 20 September 2017

References

[1] G. Hansel, Sur le nombre des fonctions booléennes monotones de n variables, C. R. Acad. Sci., Paris, Sér. B, 262, 1088–1090, 1966 [French]. Translated in Kiberneticheskii sbornik. Novaya seriya (Cybernetic Sbornik. New Series), Vol. 5, pp. 53–74, Mir, Moscow, 1968 [Russian].

[2] A. D. Korshunov, On the number of monotone Boolean functions, in Problemy kibernetiki (Problems of Cybernetics), Vol. 38, pp. 5–108, Nauka, Moscow, 1981 [Russian].

[3] V. K. Leontiev, Kombinatorika i informatsiya (Combinatorics and Information), Pt. 1, MFTI, Moscow, 2015 [Russian].

[4] K. A. Rybnikov, Vvedenie v kombinatornyi analiz (An Introduction to Combinatorial Analysis), MGU, Moscow, 1985 [Russian].

[5] R. P. Stanley, Enumerative Combinatorics, Vol. 1, Wadsworth Brooks/Cole Adv. Books Softw., Monterey, 1986. Translated under the title Perechislitel’naya kombinatorika, Mir, Moscow, 1990 [Russian].

[6] Schröder B. Ordered Sets: An Introduction with Connections from Combinatorics to Topology, Birkhäuser, Basel, 2016.
 © Sobolev Institute of Mathematics, 2015