Let 
be the infinite dimensional Grassmann algebra. In this study, we determine a subgroup of the automorphism group 
of the algebra which is of an importance in the description of the group . We give an infinite generating set for this subgroup and suggest an algorithm which shows how to express each automorphism as compositions of generating elements.
An algorithm for automorphisms of infinite dimensional Grassmann algebras
Akdoğan, Nazan
Full PDF
creative_2021_30_2_121_128Additional Information
| Author(s) | Akdoğan, Nazan |
|---|
Recently posted
-
Power Domination in Generalized Mycielskian of Cycles
-
Fixed point theorem for composition of multivalued and single-valued mappings in Banach spaces
-
Initial Value Problem for Hybrid Improved Conformable Fractional Differential Equations with Retardation and Anticipation
-
On a Subclass of Meromorphic Functions Defined by a Differential Operator on Hilbert Space
-
Countably Many Positive Symmetric Solutions For Sturm Liouville Type Boundary Conditions Of Second Order Iterative System
-
On the derived numbers of a real function
-
Some considerations about l'Hôpital-type rules for the monotonicity
-
On Minimum Second neighborhood Degree Energy of Graphs
-
Preserver Problems on Infinite Divisibility and Separability
-
A Note on Moritoh Transforms