Variations of the Primitive Normal Basis Theorem

Galois theory and the normal basis theorem

Generalizations of the Normal Basis Theorem of Finite Fields

We present a combinatorial characterization of sets of integers (rO,rl, ... ,TII-d, with OSri~"_2, " such that a'O,({1, ... ,a'·-1 fonn a basis of GF(q") over GF(q) for some ae GF'(q"). We use this characterization to prove the following generalization of the nonnal basis theorem fpr finite -fields of characteristic two: Let Ao.Al; ... ,A.,.-1 be integers in the range~<q, with at most one A.; e...

Generalizations of the Primitive Element Theorem

In this paper we gemeralize the primitive element theorem to the generation of separable algebras over fields and rings. We prove that any finitely generated separable algebra over an infinite field is generated by two elements and if the algebra is commutative it can be generated by one element. We then derive similar results for finitely generated separable algebras over semilocal rings. A) P...

A Representation Theorem for Primitive Recursive Algorithms

We formalize the algorithms computing primitive recursive (PR) functions as the abstract state machines (ASMs) whose running length is computable by a PR function. Then we show that there exists a programming language (implementing only PR functions) by which it is possible to implement any one of the previously defined algorithms for the PR functions in such a way that their complexity is pres...

Zel’manov’s Theorem for Primitive Jordan–banach Algebras

In fact, if X is any vector space on which the primitive Banach algebra A acts faithfully and irreducibly, then X can be converted in a Banach space in such a way that the requirements in Theorem 0 are satisfied and even the inclusion A9BL(X ) is contractive. Roughly speaking, the aim of this paper is to prove the appropriate Jordan variant of Theorem 0. The notion of primitiveness for Jordan a...