Non-p-generic and strongly nonbranching degree

DOI10.1007/BF02561545zbMath0817.11056MaRDI QIDQ4290666

Daqing Wan

Publication date: 8 August 1995

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

zbMATH Keywords

finite fieldpermutation polynomialeven prime powers

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Related Items (10)

Determination of a type of permutation trinomials over finite fields ⋮ Specific permutation polynomials over finite fields ⋮ New methods for generating permutation polynomials over finite fields ⋮ On polynomials of the form \(x^{r}f(x^{(q - 1)/l})\) ⋮ Determination of a type of permutation binomials over finite fields ⋮ Permutation polynomials of the form \(x^r f(x^{(q-1)/d)}\) and their group structure ⋮ A class of permutation binomials over finite fields ⋮ On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$ ⋮ Permutation binomials over finite fields ⋮ Permutation binomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The distribution of the generic recursively enumerable degrees
• The density of the nonbranching degrees
• The recursively enumerable degrees are dense
• Interpolation and embedding in the recursively enumerable degrees
• TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
• Lattice embeddings into the recursively enumerable degrees
• Branching Degrees above low Degrees

This page was built for publication: Non-p-generic and strongly nonbranching degree