This article is cited 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.

UDC: 519.11

Received: 07.04.2008
Revised: 14.01.2009

DOI: 10.4213/mzm4737

 English version: Mathematical Notes, 2009, 86:3, 368–372

Bibliographic databases:

• 
• 
• 
•