Narrow your search

Library

LUCA School of Arts (11)

Odisee (11)

Thomas More Kempen (11)

Thomas More Mechelen (11)

UCLL (11)

VIVES (11)

VUB (11)

ULiège (10)

UCLouvain (4)

KU Leuven (2)

More...

Resource type

book (11)


Language

English (11)


Year
From To Submit

2018 (2)

2012 (1)

2003 (1)

1999 (1)

1993 (1)

More...
Listing 1 - 10 of 11 << page
of 2
>>
Sort by

Book
Permutation groups and cartesian decompositions
Authors: ---
ISBN: 131699905X 1139194003 110862023X 9781108620239 9781139194006 9780521675062 0521675065 Year: 2018 Publisher: Cambridge, United Kingdom

Loading...
Export citation

Choose an application

Bookmark

Abstract

Permutation groups, their fundamental theory and applications are discussed in this introductory book. It focuses on those groups that are most useful for studying symmetric structures such as graphs, codes and designs. Modern treatments of the O'Nan-Scott theory are presented not only for primitive permutation groups but also for the larger families of quasiprimitive and innately transitive groups, including several classes of infinite permutation groups. Their precision is sharpened by the introduction of a cartesian decomposition concept. This facilitates reduction arguments for primitive groups analogous to those, using orbits and partitions, that reduce problems about general permutation groups to primitive groups. The results are particularly powerful for finite groups, where the finite simple group classification is invoked. Applications are given in algebra and combinatorics to group actions that preserve cartesian product structures. Students and researchers with an interest in mathematical symmetry will find the book enjoyable and useful.

Oligomorphic permutation groups
Author:
ISBN: 1139881868 1107366542 1107371236 110736163X 1107370175 1299404308 1107364086 0511549806 9781107361638 9780511549809 0521388368 9780521388368 Year: 1990 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

The study of permutation groups has always been closely associated with that of highly symmetric structures. The objects considered here are countably infinite, but have only finitely many different substructures of any given finite size. They are precisely those structures which are determined by first-order logical axioms together with the assumption of countability. This book concerns such structures, their substructures and their automorphism groups. A wide range of techniques are used: group theory, combinatorics, Baire category and measure among them. The book arose from lectures given at a research symposium and retains their informal style, whilst including as well many recent results from a variety of sources. It concludes with exercises and unsolved research problems.

Permutation groups
Author:
ISBN: 0521653029 0521653789 9780521653787 9780521653022 9780511623677 0511623674 9781107362765 1107362768 131608759X 1107367670 1107368758 1299409164 110736521X Year: 1999 Volume: 45 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Permutation groups are one of the oldest topics in algebra. However, their study has recently been revolutionised by new developments, particularly the classification of finite simple groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that can deal with large permutation groups. This book gives a summary of these developments, including an introduction to relevant computer algebra systems, sketch proofs of major theorems, and many examples of applying the classification of finite simple groups. It is aimed at beginning graduate students and experts in other areas, and grew from a short course at the EIDMA institute in Eindhoven.

Ordered permutation groups
Author:
ISBN: 1139883844 1107365880 1107370612 1107360978 1107370272 1299403697 110736342X 0511721242 9781107360976 0521241901 9780521241908 9780511721243 9781139883849 9781107365889 9781107370616 9781107370272 9781299403697 9780511721243 Year: 1981 Publisher: Cambridge [Cambridgeshire] New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

As a result of the work of the nineteenth-century mathematician Arthur Cayley, algebraists and geometers have extensively studied permutation of sets. In the special case that the underlying set is linearly ordered, there is a natural subgroup to study, namely the set of permutations that preserves that order. In some senses. these are universal for automorphisms of models of theories. The purpose of this book is to make a thorough, comprehensive examination of these groups of permutations. After providing the initial background Professor Glass develops the general structure theory, emphasizing throughout the geometric and intuitive aspects of the subject. He includes many applications to infinite simple groups, ordered permutation groups and lattice-ordered groups. The streamlined approach will enable the beginning graduate student to reach the frontiers of the subject smoothly and quickly. Indeed much of the material included has never been available in book form before, so this account should also be useful as a reference work for professionals.


Book
The Mathieu groups
Author:
ISBN: 1108637523 1108555284 1108556795 9781108556798 9781108555289 9781108429788 1108429785 Year: 2018 Publisher: Cambridge New York, NY

Loading...
Export citation

Choose an application

Bookmark

Abstract

The Mathieu groups have many fascinating and unusual characteristics and have been studied at length since their discovery. This book provides a unique, geometric perspective on these groups. The amalgam method is explained and used to construct M24, enabling readers to learn the method through its application to a familiar example. The same method is then used to construct, among others, the octad graph, the Witt design and the Golay code. This book also provides a systematic account of 'small groups', and serves as a useful reference for the Mathieu groups. The material is presented in such a way that it guides the reader smoothly and intuitively through the process, leading to a deeper understanding of the topic.

Representations of solvable groups
Authors: ---
ISBN: 1139884581 1107366569 1107371252 1107361656 1107369665 1299404324 1107364108 0511525974 9781107361652 9780511525971 0521397391 9780521397391 Year: 1993 Volume: 185 Publisher: Cambridge Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Representation theory plays an important role in algebra, and in this book Manz and Wolf concentrate on that part of the theory which relates to solvable groups. The authors begin by studying modules over finite fields, which arise naturally as chief factors of solvable groups. The information obtained can then be applied to infinite modules, and in particular to character theory (ordinary and Brauer) of solvable groups. The authors include proofs of Brauer's height zero conjecture and the Alperin-McKay conjecture for solvable groups. Gluck's permutation lemma and Huppert's classification of solvable two-transive permutation groups, which are essentially results about finite modules of finite groups, play important roles in the applications and a new proof is given of the latter. Researchers into group theory, representation theory, or both, will find that this book has much to offer.

Permutation group algorithms
Author:
ISBN: 052166103X 9780521661034 0511066473 9780511066474 1107128404 1280417633 9786610417636 1139146165 0511169620 0511060165 0511308450 0511546548 0511068603 9780511546549 Year: 2003 Publisher: Cambridge Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

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. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.

Permutation groups and combinatorial structures
Authors: ---
ISBN: 113988378X 1107365821 1107370558 1107360919 1107369991 1299403638 1107363365 0511891911 0511600739 9781107360914 9780511891915 0521222877 9780521222877 9780511600739 Year: 1979 Publisher: Cambridge Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

The subject of this book is the action of permutation groups on sets associated with combinatorial structures. Each chapter deals with a particular structure: groups, geometries, designs, graphs and maps respectively. A unifying theme for the first four chapters is the construction of finite simple groups. In the fifth chapter, a theory of maps on orientable surfaces is developed within a combinatorial framework. This simplifies and extends the existing literature in the field. The book is designed both as a course text and as a reference book for advanced undergraduate and graduate students. A feature is the set of carefully constructed projects, intended to give the reader a deeper understanding of the subject.

Parallelisms of complete designs
Author:
ISBN: 1139883690 1107365759 1107370485 1107360846 1107368383 1299403565 1107363292 0511662106 9781107360846 9780511662102 0521211603 9780521211604 Year: 1976 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.


Book
Combinatorial group theory
Author:
ISBN: 1139884336 1107369703 110737104X 0511565879 1107366321 1107361419 1299404111 1107363861 9781107361416 9780511565878 0521341337 9780521341332 0521349362 9780521349369 Year: 1989 Publisher: Cambridge New York Cambridge University Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

In this book, developed from courses taught at the University of London, the author aims to show the value of using topological methods in combinatorial group theory. The topological material is given in terms of the fundamental groupoid, giving results and proofs that are both stronger and simpler than the traditional ones. Several chapters deal with covering spaces and complexes, an important method, which is then applied to yield the major Schreier and Kurosh subgroup theorems. The author presents a full account of Bass-Serre theory and discusses the word problem, in particular, its unsolvability and the Higman Embedding Theorem. Included for completeness are the relevant results of computability theory.

Listing 1 - 10 of 11 << page
of 2
>>
Sort by