Some new lower bounds for the number of near-rings on finite cyclic groups.

MaRDI QIDQ3565760zbMATH OpenFDO

Authors A. K. Rahnev, Angel Golev

Publication date 7 June 2010

zbMATH Keywords

lower boundsheuristic algorithmsfinite cyclic groupsfinite near-ringsnumbers of near-rings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Near-rings (16Y30) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Recommendations

• scientific article; zbMATH DE number 3944083
• Computing near rings on finite cyclic groups of order up to \(29\).
• scientific article; zbMATH DE number 3959710
• Computing near rings on finite cyclic groups.
• Computing classes of isomorphic near-rings on cyclic groups of order up to 23.

Cited in

(8)

• DISTRIBUTED SOFTWARE SYSTEM FOR TESTING NEAR-RINGS HYPOTHESES AND NEW CONSTRUCTIONS FOR NEAR-RINGS ON FINITE CYCLIC GROUPS
• Computing near rings on finite cyclic groups.
• scientific article; zbMATH DE number 2223019 (Why is no real title available?)
• Computing near rings on finite cyclic groups of order up to \(29\).
• scientific article; zbMATH DE number 3944083 (Why is no real title available?)
• scientific article; zbMATH DE number 3959710 (Why is no real title available?)
• On computer generation of small order near-rings.
• Computing classes of isomorphic near-rings on cyclic groups of order up to 23.

This page was built for publication: Some new lower bounds for the number of near-rings on finite cyclic groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565760)