Mots-clés : Möbius function, polynomial
@article{MZM_2009_86_3_a9,
author = {V. K. Leont'ev},
title = {Some {Number-Theoretic} {Combinatorial} {Problems}},
journal = {Matemati\v{c}eskie zametki},
pages = {402--407},
year = {2009},
volume = {86},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2009_86_3_a9/}
}
V. K. Leont'ev. Some Number-Theoretic Combinatorial Problems. Matematičeskie zametki, Tome 86 (2009) no. 3, pp. 402-407. http://geodesic.mathdoc.fr/item/MZM_2009_86_3_a9/
[1] O. Moreno, Z. Zhang, P. V. Kumar, V. A. Zinoviev, “New constructions of optimal cyclically permutable constant weight codes”, IEEE Trans. Inform. Theory, 41:2 (1995), 448–455 | MR | Zbl
[2] W. T. Trotter, P. Erdős, “When the Cartesian product of directed cycles is Hamiltonian”, J. Graph Theory, 2:2 (1978), 137–142 | MR | Zbl
[3] R. Lidl, G. Niderrait, Konechnye polya, T. 1, 2, Mir, M., 1988 | MR | MR | Zbl
[4] V. K. Leontev, “O nekotorykh zadachakh, svyazannykh v polinomami nad konechnym polem”, Trudy IV Mezhdunarodnoi nauchnoi konferentsii “Diskretnye modeli v teorii upravlyayuschikh sistem”, MGU, M., 2000, 60–61
[5] V. K. Leontev, “Gamiltonovy tsikly v toricheskoi reshetke”, Dokl. RAN, 395:5 (2004), 590–591 | MR | Zbl
[6] A. A. Evdokimov, “Numeratsiya podmnozhestv konechnogo mnozhestva”, Metody diskretn. analiza, 34 (1980), 8–26 | MR | Zbl