The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “On generalized Redei functions.”

Permutation binomials.

Small, Charles (1990)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Quasi-permutation polynomials

Vichian Laohakosol, Suphawan Janphaisaeng (2010)

Czechoslovak Mathematical Journal

Similarity:

A quasi-permutation polynomial is a polynomial which is a bijection from one subset of a finite field onto another with the same number of elements. This is a natural generalization of the familiar permutation polynomials. Basic properties of quasi-permutation polynomials are derived. General criteria for a quasi-permutation polynomial extending the well-known Hermite's criterion for permutation polynomials as well as a number of other criteria depending on the permuted domain and range...

Some Algebraic Properties of Polynomial Rings

Christoph Schwarzweller, Artur Korniłowicz (2016)

Formalized Mathematics

Similarity:

In this article we extend the algebraic theory of polynomial rings, formalized in Mizar [1], based on [2], [3]. After introducing constant and monic polynomials we present the canonical embedding of R into R[X] and deal with both unit and irreducible elements. We also define polynomial GCDs and show that for fields F and irreducible polynomials p the field F[X]/ is isomorphic to the field of polynomials with degree smaller than the one of p.

On a decomposition of polynomials in several variables

Andrzej Schinzel (2002)

Journal de théorie des nombres de Bordeaux

Similarity:

One considers representation of a polynomial in several variables as the sum of values of univariate polynomials taken at linear combinations of the variables.

Local polynomials are polynomials

C. Fong, G. Lumer, E. Nordgren, H. Radjavi, P. Rosenthal (1995)

Studia Mathematica

Similarity:

We prove that a function f is a polynomial if G◦f is a polynomial for every bounded linear functional G. We also show that an operator-valued function is a polynomial if it is locally a polynomial.