Akos Seress - Böcker

Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. T...

Läs mer »

Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th...

Läs mer »

This volume is the proceedings of a conference on Finite Geometries, Groups, and Computation that took place on September 4-9, 2004, at Pingree Park, Colorado (a campus of Colorado State University). Not accidentally, the conference coincided with...

Läs mer »

Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th...

Läs mer »

This volume is the proceedings of a conference on Finite Geometries, Groups, and Computation that took place on September 4-9, 2004, at Pingree Park, Colorado (a campus of Colorado State University). Not accidentally, the conference coincided with...

Läs mer »