Some number-theoretic combinatorial problems

DOI10.1134/S0001434609090107zbMath1263.11113OpenAlexW2029727862MaRDI QIDQ1048581

V. K. Leont'ev

Publication date: 12 January 2010

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434609090107

zbMATH Keywords

Möbius functionfinite fieldgenerating functionHamiltonian cycleirreducible polynomialEuler functionpolynomial ring over \(F_q\)

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic theory of polynomial rings over finite fields (11T55)

Cites Work

• Unnamed Item
• When the cartesian product of directed cycles is Hamiltonian
• New constructions of optimal cyclically permutable constant weight codes

This page was built for publication: Some number-theoretic combinatorial problems