Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Fundamental Algorithms for Permutation Groups

Name: Fundamental Algorithms for Permutation Groups
Brand: Springer, Berlin
SKU: 01565488
Price: 24469 HUF
Availability: InStock
Author: Gregory Butler
ISBN: 9783540549550

Gregory Butler

Language

English

Book Paperback

Libristo code: 01565488

Publishers Springer, Berlin, November 1990

This is the first-ever book on computational group theory.§It provides extensive and up-to-date cove... Full description

Libristo code: 01565488

163 b

24 469 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Ненасильственное общен&# Véronique Bronckart

Paperback

5 829 Ft

Kon-Tiki Jette Varmer

Paperback

6 175 Ft

Content-Management in Der Praxis Oliver Christ

Hardback

18 682 Ft

Velká kniha půstu Ruediger Dahlke

Paperback

4 777 Ft

Velké samolepky pro malé ruce Čísla

Paperback

1 218 Ft

POR UNA MANZANA NEUS CAAMAÑO CULUBRET

Hardback

4 720 Ft

This is the first-ever book on computational group theory.§It provides extensive and up-to-date coverage of the§fundamental algorithms for permutation groups with reference§to aspects of combinatorial group theory, soluble groups,§and p-groups where appropriate.§The book begins with a constructive introduction to group§theory and algorithms for computing with small groups,§followed by a gradual discussion of the basic ideas of Sims§for computing with very large permutation groups, and§concludes with algorithms that use group homomorphisms, as§in the computation of Sylowsubgroups. No background in§group theory is assumed.§The emphasis is on the details of the data structures and§implementation which makes the algorithms effective when§applied to realistic problems. The algorithms are developed§hand-in-hand with the theoretical and practical§justification.All algorithms are clearly described,§examples are given, exercises reinforce understanding, and§detailed bibliographical remarks explain the history and§context of the work.§Much of the later material on homomorphisms, Sylow§subgroups, and soluble permutation groups is new.