Computing near rings on finite cyclic groups of order up to \(29\). (Q2844638)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6203049
Language Label Description Also known as
default for all languages
No label defined
    English
    Computing near rings on finite cyclic groups of order up to \(29\).
    scientific article; zbMATH DE number 6203049

      Statements

      0 references
      0 references
      29 August 2013
      0 references
      finite near-rings
      0 references
      finite cyclic groups
      0 references
      lower bounds
      0 references
      numbers of near-rings
      0 references
      algorithms
      0 references
      Computing near rings on finite cyclic groups of order up to \(29\). (English)
      0 references
      An algebraic system \((G,+,*)\) is called a (left) near-ring upon \((G,+)\), if \((G,+)\) is a group, \((G,*)\) is a semigroup, and \(a*b+a*c=a*(b+c)\), for each triple \((a,b,c)\) with components in \(G\). In an earlier joint paper [see C. R. Acad. Bulg. Sci. 63, No. 5, 645-650 (2010; Zbl 1216.16036)], the authors described all near-rings over cyclic groups of orders \(\leq 23\). The paper under review contains a description of all near-rings on cyclic groups of order \(r=24,\dots,29\). The description is obtained by using a new algorithm. The authors point out some of the advantages of this algorithm compared to the one used in their previous paper. They also find new lower bounds on the number of near-rings on a cyclic group of order \(n\).
      0 references

      Identifiers