|
This article is cited in 1 scientific paper (total in 1 paper)
Some Number-Theoretic Combinatorial Problems
V. K. Leont'ev Dorodnitsyn Computing Centre of the Russian Academy of Sciences
Abstract:
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, polynomial, ring over $F_q$, irreducible polynomial, Hamiltonian cycle, Euler function.
Received: 07.04.2008 Revised: 14.01.2009
Citation:
V. K. Leont'ev, “Some Number-Theoretic Combinatorial Problems”, Mat. Zametki, 86:3 (2009), 402–407; Math. Notes, 86:3 (2009), 368–372
Linking options:
https://www.mathnet.ru/eng/mzm4737https://doi.org/10.4213/mzm4737 https://www.mathnet.ru/eng/mzm/v86/i3/p402
|
|