4. Basics from Algebra: Groups, Rings, and Fields

Group theory is main topic modern algebra and group is also useful in many other fields. In this paper we show a special type relationship between group theory and number theory. In this paper will give type group of rational functions with coefficients as Fibonacci number with respect composition of mapping operation. We also show that is not only a group but also a cyclic group. In this represent a special relation between properties of group and rational functions with Fibonacci numbers coefficients. In this paper we gave a special type of recurrence relation sequence of rational functions with coefficients as Fibonacci numbers and also we proved the collection of all such rational function form a cyclic group with respect to the composition of function operation. In this represent a special relation between properties of group and rational functions with Fibonacci numbers coefficients. In this paper we gave a special type of recurrence relation sequence of rational functions with coefficients as Fibonacci numbers and also we proved the collection of all such rational function form a cyclic group with respect to the composition of function operation.

Summary form only given. About two years ago Bourgain, Katz and Tao (2004) proved the following theorem, essentially stating that in every finite field, a set which does not grow much when we add all pairs of elements, and when we multiply all pairs of elements, must be very close to a subfield. Theorem 1: (Bourgain et al., 2004) For every /spl epsi/ > 0 there exists a /spl delta/ > 0 such that the following holds. Let F be any field with no subfield of size /spl ges/ |F|/sup /spl epsi//. For every set A /spl sube/ F, with |F|/sup /spl epsi// |A|/sup 1 + /spl delta// or the product set |A /spl times/ A| > |A|/sup 1 + /spl delta//. This theorem revealed its fundamental nature quickly. Shortly afterwards it has found many diverse applications, including in number theory, group theory, combinatorial geometry, and the explicit construction of extractors and Ramsey graphs, mostly described in the references below. In my talk I plan to explain some of the applications, as well as to sketch the main ideas of the proof of the sum-product theorem.

In this chapter we state (mostly without proof) some basic facts from the theory of groups. We have included only those facts from the general theory that we shall have occasion to use later — the treatment is by no means exhaustive. We refer to any standard textbook on Group Theory for more detailed accounts of the subject in general and for the contents of this chapter in particular. Some of the best are Hall (1959), Suzuki (1982, 1986), Rotman (1995), Robinson (1995) and Luthar & Passi (1996).

Strongly regular graphs (SRGs) provide a fertile area of exploration in algebraic combinatorics, integrating techniques in graph theory, linear algebra, group theory, finite fields, finite geometry, and number theory. Of particular interest are those SRGs with a large automorphism group. If an automorphism group acts regularly (sharply transitively) on the vertices of the graph, then we may identify the graph with a subset of the group, a partial difference set (PDS), which allows us to apply techniques from group theory to examine the graph. Much of the work over the past four decades has concentrated on abelian PDSs using the powerful techniques of character theory. However, little work has been done on nonabelian PDSs. In this paper we point out the existence of genuinely nonabelian PDSs, that is, PDSs for parameter sets where a nonabelian group is the only possible regular automorphism group. We include methods for demonstrating that abelian PDSs are not possible for a particular set of parameters or for a particular SRG. Four infinite families of genuinely nonabelian PDSs are described, two of which—one arising from triangular graphs and one arising from Krein covers of complete graphs constructed by Godsil—are new. We also include a new nonabelian PDS found by computer search and present some possible future directions of research.

In this paper, we study generalized Reed-Solomon codes (GRS codes) over commutative and noncommutative rings, we show that the classical Welch-Berlekamp and Guruswami-Sudan decoding algorithms still hold in this context, and we investigate their complexities. Under some hypothesis, the study of noncommutative GRS codes over finite rings leads to the fact that GRS codes over commutative rings have better parameters than their noncommutative counterparts. Also, GRS codes over finite fields have better parameters than their commutative rings counterparts. But we also show that given a unique decoding algorithm for a GRS code over a finite field, there exists a unique decoding algorithm for a GRS code over a truncated power series ring with a better asymptotic complexity. Moreover, we generalize a lifting decoding scheme to obtain new unique and list decoding algorithms designed to work when the base ring is, for example, a Galois ring or a truncated power series ring or the ring of square matrices over the latter ring.

Resolutions of determinantal ideals: The submaximal minors

This second, revised and substantially extended edition of Approximations and Endomorphism Algebras of Modules reflects both the depth and the width of recent developments in the area since the first edition appeared in 2006. The new division of the monograph into two volumes roughly corresponds to its two central topics, approximation theory (Volume 1) and realization theorems for modules (Volume 2). It is a widely accepted fact that the category of all modules over a general associative ring is too complex to admit classification. Unless the ring is of finite representation type we must limit attempts at classification to some restricted subcategories of modules. The wild character of the category of all modules, or of one of its subcategories C, is often indicated by the presence of a realization theorem, that is, by the fact that any reasonable algebra is isomorphic to the endomorphism algebra of a module from C. This results in the existence of pathological direct sum decompositions, and these are generally viewed as obstacles to classification. In order to overcome this problem, the approximation theory of modules has been developed. The idea here is to select suitable subcategories C whose modules can be classified, and then to approximate arbitrary modules by those from C. These approximations are neither unique nor functorial in general, but there is a rich supply available appropriate to the requirements of various particular applications. The authors bring the two theories together. The first volume, Approximations, sets the scene in Part I by introducing the main classes of modules relevant here: the S-complete, pure-injective, Mittag-Leffler, and slender modules. Parts II and III of the first volume develop the key methods of approximation theory. Some of the recent applications to the structure of modules are also presented here, notably for tilting, cotilting, Baer, and Mittag-Leffler modules. In the second volume, Predictions, further basic instruments are introduced: the prediction principles, and their applications to proving realization theorems. Moreover, tools are developed there for answering problems motivated in algebraic topology. The authors concentrate on the impossibility of classification for modules over general rings. The wild character of many categories C of modules is documented here by the realization theorems that represent critical R-algebras over commutative rings R as endomorphism algebras of modules from C. The monograph starts from basic facts and gradually develops the theory towards its present frontiers. It is suitable both for graduate students interested in algebra and for experts in module and representation theory.

On the computational complexity of the theory of Abelian groups

This thesis presents some contributions in additive combinatorics and arithmetic Ramsey theory. More specifically, it deals with the interaction between combinatorics, number theory and additive combinatorics. This area saw a great improvement with the Szemerédi Regularity Lemma and some of the results that followed. The Regularity Lemma and its consequences have become a widely used tool in graph theory, combinatorics and number theory. Furthermore, its language and point of view has deeply changed the face of additive number theory, a fact universally acknowledged by the Abel award given to Szemerédi in 2012. One of the main reasons for the prize has been Szemerédi's theorem, a result regarding the existence of arbitrarily long arithmetic progressions in dense sets of the integers, the proof of which uses the Regularity Lemma in a key step. One of the earlier consequences of the Regularity Lemma was the Removal Lemma for graphs that was used by Ruzsa and Szemerédi to show Roth theorem, regarding the existence of 3-term arithmetic progressions in dense sets of the integers, in a combinatorial way. The Removal Lemma states that in any graph K with few copies of a subgraph, say a triangle, we can remove few edges from K so that the result contains no copy of the subgraph. This has become a key tool in the applications of the so-called Regularity Method, which has extensive literature in combinatorics, graph theory, number theory and computer science. In 2005 Green introduced a regularity lemma for Abelian groups as well as an algebraic removal lemma. The removal lemma for groups states that, for a given finite Abelian group G, if there are o(|G|^3) solution to x+y+z+t=0 with the variables taking values in S, a subset of G, then we can remove o(|G|) elements from S to make the set S solution-free. The main contributions of this work corresponds to extensions of the removal lemma for groups to either more general contexts, like non-necessary Abelian finite groups, or to linear systems of equations for finite Abelian groups. The main goal is to give a comprehensive and more general framework for many results in additive number theory like Szemerédi Theorem. In particular, we show that the removal lemma for groups by Green can be extended to non-necessary Abelian finite groups. Moreover, we prove a removal lemma for linear systems on finite fields: for every e>0 there exists a d>0 such that if A is a (k x m) linear system of equations with coefficients in a finite field F and the number of solutions to Ax=b, where each variable takes values from a subset Si in F is less than d times |F| raised to m-k, then by removing less than e|F| elements in each Si we can make the resulting sets solution-free, thus solving a conjecture by Green to that respect. Even more, if A is an integer linear system, G is a finite Abelian group, and the determinantal of A and |G| are coprime, then a similar statement holds. Let us mention that the last result allows us to characterize those linear systems where any set S with size proportional to G has a nontrivial solution in S, provided |G| is large enough. This extends the validity of Szmerédi's theorem to finite Abelian groups. These extensions of the removal lemma have been used in arithmetic Ramsey theory to obtain counting results for the number of monochromatic solutions of linear systems. The main result from a work by Frankl, Graham and Rödl in '88 states that the number of monochromatic solutions of regular systems in integer intervals is in fact a positive proportion of the total number of solutions. We give analogous results for solutions in Abelian groups with bounded exponent, for which the main tool in the torsion-free case cannot be applied. Density versions of these counting results are also obtained, in this case with a full characterization.

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases in Ding et al. (IEEE Trans Inform Theory 57(12), 8000–8006, 2011); Ma et al. (IEEE Trans Inform Theory 57(1):397–402, 2011); Wang et al. (Trans Inf Theory 58(12):7253–7259, 2012); and Xiong (Finite Fields Appl 18(5):933–945, 2012). In this paper we use the method developed in Xiong (Finite Fields Appl 18(5):933–945, 2012) to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums. The problem of finding the weight distribution is transformed into a problem of evaluating certain character sums over finite fields, which turns out to be associated with counting the number of points on some elliptic curves over finite fields. We also treat the special case that the characteristic of the finite field is 2.

Digital time was defined KSR-PP [2] with three two-digit positions as h2h1 : m2m1 : s2s1. It was identified with appropriate restricted place values on the hours (H), minutes (M) and seconds (S) shown to be 86400-element cyclic Time Group, TG. Here it is shown to be a finite time field, TF. A palindromic sequence of 119-elements and its sub-sequences are shown to be consequences of TF .

This thesis shows that the Zorn vector matrix construction which Paige used to construct simple nonassociative Moufang loops over finite fields can, in fact, be done over any commutative ring with the proper adjustments. The resulting loops are still Moufang, but no longer simple in general. Given a commutative ring and an ideal of that ring, the loop constructed over that ring can be decomposed into two pieces. In this way, it is shown that the loop constructed over Z/4Z shares some structure with the Paige loop constructed over the finite field Z/2Z. An in depth study of the loop constructed over Z/4Z follows including significant portions of the subloop lattice and a variety of structural results.

The group theory, as one of the cornerstones of the modern algebra, has a profound historical trajectory that reflects the evolution of the mathematical thought. This comprehensive paper analyses the historical development of the group theory and provides an overview of the interconnectedness of the several key theorems in the group theory: The Lagranges Theorem, the Fermats Little Theorem and the Eulers Theorem. This paper begins by establishing the modern group-theoretical framework within the Lagranges Theorem on the link between the order of groups and that of its subgroups. Then, an extension onto other related theorems are provided. In all, this paper is highly interlinking among the ideas in group theory. Ultimately, this study not only demonstrates the beauty of mathematical interconnections but also highlights their continuing relevance for the modern applications, showing how the classical results remain relevant to guide contemporary explorations in algebra, number theory, and related disciplines.

In this chapter we study the basic notions from mathematics and computer science that we will be using throughout the book. Its purpose is not to give a comprehensive account of these concepts but, rather, to study them from the point of view of their applications to cryptography, emphasizing the algorithmic aspects. For this task we will be using Maple as a tool to implement the relevant algorithms and to experiment with them. Bearing in mind these premises, we include here the required concepts and results from probability, complexity theory and modular arithmetic, including quadratic residues and modular square roots, and we also give a brief introduction to the relevant aspects of group theory and finite fields. Thus, for readers already familiar with these subjects, this chapter will hopefully serve as a refresher of the topics mentioned in the Preface (with the exception of linear algebra which is not included here) and, at the same time, as an introduction to the use of Maple to explore the algorithms discussed. Even for readers not familiar with these subjects we hope that sufficient information is included here to allow them to profitably read the rest of the book. We include proofs of most of the algorithmic and mathematical results mentioned, with pointers to the literature for the reader who wishes to go deeper on these topics and, at the same time, we will be introducing here a great deal of the notation used throughout the book.

Classical groups over finite fields, including symplectic groups, unitary groups and orthogonal groups, are finite simple groups of crucial importance. The structure and order of classical groups are the basic problems in group theory. Geometry of classical groups has been found extremely useful in many fields, such as combinatorial mathematics, coding and cryptographic theory. In this paper, a class of quasi-classical groups are introduced, which partially generalize the concepts of symplectic groups and orthogonal groups. We determine the structure and order of quasi-classical groups. As an application, we discuss the relationship between quasi-classical groups and self-dual normal bases over finite fields.