primitive element

• An algebraic extension L#47;K is called simple if L#61;K(#92;alpha) for some #92;alpha#92;inL. The element #92;alpha is called a primitive element for L#47;K. Every finite separable algebraic field extension is simple. Suppose that L#61;K(#92;alpha#95;1,#92;dots#92;alpha#95;r) is a finite separable extension and K#95;0#92;subseteqK is an infinite subset of K. Then there exists a primitive element #92;alpha of the form #92;textstyle#92;alpha#61;#92;sum#95;#123;i#61;1#125;ʳc#95;i#92;alpha#95;i with c#95;i#92;inK#95;0.2009, Henning Stichtenoth, Algebraic Function Fields and Codes, 2nd edition, Springer, page 330:

• Furthermore, if the irreducible polynomial has a primitive element α (where α=1) that is a root, then the polynomial is termed a primitive polynomial and corresponds to the polynomial for a maximal length feedback shift register.1996, J. J. Spilker, Jr. Chapter 3: GPS Signal Structure and Theoretical Performance, Bradford W. Parkinson, James J. Spilker (editors), Global Positioning System: Theory and Applications, Volume 1, AIAA, page 114, Likewise, α=α, etc., namely, the elements are all expressed as powers of α and because α=1, α is termed a primitive element of GF(2ⁿ). […]
• 2003, Soonhak Kwon, Chang Hoon Kim, Chun Pyu Hong, Efficient Exponentiation for a Class of Finite Fields GF(2ⁿ) Determined by Gauss Periods, Colin D. Walter, Çetin K. Koç, Christof Paar (editors), Cryptographic Hardware and Embedded Systems, CHES 2003: 5th International Workshop, Proceedings, Springer, LNCS 2779, page 228, Also in the case of a Gauss period of type (n,1), i.e. a type I optimal normal element, we find a primitive element in GF(2ⁿ) which is a sparse polynomial of a type I optimal normal element and we propose a fast exponentiation algorithm which is applicable for both software and hardware purposes.

• Let A be a prime number for which 2 is a primitive element. Then 2#123;A-1#125;-1 is divisible by A.1972, W. Wesley Peterson; E. J. Weldon, Jr., Error-correcting Codes, 2nd edition, The MIT Press, page 457:

• But suppose L'#92;inC#95;#92;nu(S#95;0) so that #92;operatorname#123;det#125;(L')#61;#92;eta'#92;pi#92;blacktriangleright 0 for some totally positive unit #92;eta' and so that L' is everywhere locally a primitive element of the #92;mathfrako-lattice R#95;#92;nu.1985, Revista Matemática Iberoamericana, Volume 1, Real Sociedad Matemática Española, page 111:

Of a coalgebra over an element g

• 2009, Masoud Khalkhali, Basic Noncommutative Geometry, European Mathematical Society, page 29, A primitive element of a Hopf algebra is an element h∈H such that Δh=1⊗h+h⊗1. It is easily seen that the bracket [x,y]:=xy-yx of two primitive elements is again a primitive element. It follows that primitive elements form a Lie algebra. For H=U(g) any element of g is primitive and in fact using the Poincaré-Birkhoff-Win theorem, one can show that the set of primitive elements of U(g) coincides with the Lie algebra g.

• In this paper we apply regression models and other pattern recognition techniques to the task of classifying primitive elements of a free group.2004, Dmitry Y. Bormotov, “Experimenting with Primitive Elements in F₂”, in Alexandre Borovik, Alexei G. Myasnikov, editors, Computational and Experimental Group Theory: AMS-ASL Joint Special Session, American Mathematical Society, page 215: