Cycles, Eulerian digraphs and the Schönemann-Gauss theorem

DOI10.12775/TMNA.2020.058zbMath1505.11010OpenAlexW3205192483MaRDI QIDQ2156723

Heinrich Steinlein

Publication date: 20 July 2022

Published in: Topological Methods in Nonlinear Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.12775/tmna.2020.058

zbMATH Keywords

characteristic polynomialcongruenceEulerian digraph

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Congruences; primitive roots; residue systems (11A07) Eulerian and Hamiltonian graphs (05C45) Matrices, determinants in number theory (11C20)

Cites Work

• Generalizations of Arnold's version of Euler's theorem for matrices
• On congruences for the traces of powers of some matrices
• A Coloring Proof of a Generalisation of Fermat's Little Theorem
• Fermat's Little Theorem and Gauss Congruence: Matrix Versions and Cyclic Permutations
• Dold sequences, periodic points, and dynamics

This page was built for publication: Cycles, Eulerian digraphs and the Schönemann-Gauss theorem