Agrawal, Manindra ; Saxena, Nitin (2005) Automorphisms of finite rings and applications to complexity of problems Lecture Notes in Computer Science, 3404 . pp. 1-17. ISSN 0302-9743
|PDF - Author Version|
Official URL: http://www.springerlink.com/content/nqlbynm4523aam...
Related URL: http://dx.doi.org/10.1007/978-3-540-31856-9_1
In mathematics, automorphisms of algebraic structures play an important role. Automorphisms capture the symmetries inherent in the structures and many important results have been proved by analyzing the automorphism group of the structure. For example, Galois characterized degree five univariate polynomials ƒ over rationals whose roots can be expressed using radicals (using addition, subtraction, multiplication, division and taking roots) via the structure of automorphism group of the splitting field of ƒ. In computer science too, automorphisms have played a useful role in our understanding of the complexity of many algebraic problems. From a computer science perspective, perhaps the most important structure is that of finite rings. This is because a number of algebraic problems efficiently reduce to questions about automorphisms and isomorphisms of finite rings. In this paper, we collect several examples of this from the literature as well as providing some new and interesting connections.
|Source:||Copyright of this article belongs to Springer.|
|Deposited On:||26 May 2012 19:28|
|Last Modified:||26 May 2012 19:28|
Repository Staff Only: item control page