Some Number-Theoretic Combinatorial Problems
Matematičeskie zametki, Tome 86 (2009) no. 3, pp. 402-407
Voir la notice de l'article provenant de la source Math-Net.Ru
We present several expressions for generating functions arising in the solution of combinatorial problems related to graph theory and coding theory.
Keywords:
generating function, finite field, Möbius function, ring over $F_q$, irreducible polynomial, Hamiltonian cycle, Euler function.
Mots-clés : polynomial
Mots-clés : 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},
publisher = {mathdoc},
volume = {86},
number = {3},
year = {2009},
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/