Equivalence classes of polynomials over finite fields

Gary Mullen

Loading [MathJax]/extensions/MathZoom.js

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Equivalence classes of polynomials over finite fields”

A Contribution to the Theory of Permutations

Josef Kaucký (1971)

Matematický časopis

Similarity:

The set of rational cycles for the 3x+1 problem

Jeffrey Lagarias (1990)

Acta Arithmetica

Similarity:

Weak equivalence of functions over a finite field

Gary Mullen (1979)

Acta Arithmetica

Similarity:

Exotic Collatz cycles

John L. Simons (2008)

Acta Arithmetica

Similarity:

Polynomial cycles in certain rings of rationals

Władysław Narkiewicz (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

It is shown that the methods established in [HKN3] can be effectively used to study polynomial cycles in certain rings. We shall consider the rings $𝐙 [\frac{1}{N}]$ and shall describe polynomial cycles in the case when $N$ is either odd or twice a prime.

Interchangeability of relevant cycles in graphs.

Gleiss, Petra M., Leydold, Josef, Stadler, Peter F. (2000)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Reconstructing permutations from cycle minors.

Monks, Maria (2009)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

General solution of the functional equation φ[f(x)]=G(x,φ(x))

M. Kuczma (1961)

Annales Polonici Mathematici

Similarity:

Concerning the homological structure of the functional space

Karol Borsuk (1952)

Fundamenta Mathematicae

Similarity: