Efficient Algorithms for Abelian Group Isomorphism and Related Problems

Author(s):  
T. Kavitha
2017 ◽  
Vol 27 (08) ◽  
pp. 1073-1085 ◽  
Author(s):  
Ali Rejali ◽  
Meisam Soleimani Malekan

Giving a condition for the amenability of groups, Rosenblatt and Willis first introduced the concept of configuration. From the beginning of the theory, the question whether the concept of configuration equivalence coincides with the concept of group isomorphism was posed. We negatively answer this question by introducing two non-isomorphic, solvable and hence amenable groups which are configuration equivalent. Also, we will prove this conjecture, due to Rosenblatt and Willis, whether the configuration equivalent groups include the free non-Abelian group of the same rank or not. We show that two-sided equivalent groups have same class numbers.


2011 ◽  
Vol 03 (04) ◽  
pp. 537-552 ◽  
Author(s):  
GREGORY KARAGIORGOS ◽  
DIMITRIOS POULAKIS

In this paper we consider the problem of computation of a basis for an abelian group G with N elements such that the prime factorization of N is known. We present two deterministic algorithms for this task and a deterministic algorithm in case where a generating system for G is given.


Author(s):  
Ngarap Im Manik ◽  
Don Tasman

This design of a computer software is a development and continuation of the software made on the previous research (2009/2010). However, this further research developed and expanded the scopes of testing more on the Siclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, Factor Ring, Sub Ring and Polynomial Ring; developed on the OSP (Open Source Program)-based. The software was developed using the OSP-based language programming, such Java, so it is open and free to use for its users. This research succeeded to develop an open source software of Java program that can be used for testing specific mathematical Groups, such Ciclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, and Rings, Commutative Ring, Division Ring, Ideal Sub Ring, Ring Homomorphism, Ring Epimorphism and Fields. By the results, the software developed was able to test as same as the results from manual testing.


2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.


Author(s):  
Toshihiro AKAGI ◽  
Tetsuya ARAKI ◽  
Shin-ichi NAKANO

Sign in / Sign up

Export Citation Format

Share Document