Equivalence classes of polynomials over finite fields
Gary Mullen (1976)
Acta Arithmetica
Similarity:
Displaying similar documents to “Weak equivalence of functions over a finite field”
Equivalence classes of polynomials over finite fields
Shift-induced dynamical systems on partitions and compositions.
Hopkins, Brian, Jones, Michael A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumeration under group action
Gian-Carlo Rota, David A. Smith (1977)
Annali della Scuola Normale Superiore di Pisa - Classe di Scienze
Similarity:
Matrix equivalence over finite fields
Gary Mullen (1982)
Acta Arithmetica
Similarity:
Partitions of a graph into cycles containing a specified linear forest
Ryota Matsubara, Hajime Matsumura (2008)
Discussiones Mathematicae Graph Theory
Similarity:
In this note, we consider the partition of a graph into cycles containing a specified linear forest. Minimum degree and degree sum conditions are given, which are best possible.
A theorem concerning homologies in a compact space
W. Puckett (1938)
Fundamenta Mathematicae
Similarity:
Alternating cycles and realizations of a degree sequence
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Interchangeability of relevant cycles in graphs.
Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity: