Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorics is a subject of increasing importance, owing to its links with computer science, statistics and algebra. This is a textbook aimed at second-year undergraduates to beginning graduates. It stresses common techniques (such as generating functions and recursive construction) which underlie the great variety of subject matter and also stresses the fact that a constructive or algorithmic proof is more valuable than an existence proof. The book is divided into two parts, the second at a higher level and with a wider range than the first. Historical notes are included which give a wider perspective on the subject. More advanced topics are given as projects and there are a number of exercises, some with solutions given.

Combinatorial analysis --- Analyse combinatoire --- Combinatorial analysis. --- Combinatorics --- Algebra --- Mathematical analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Combinatorial designs and configurations --- Permutation groups --- Parallels (Geometry) --- Combinatorial designs and configurations. --- Parallels (Geometry). --- Permutation groups. --- Mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Permutation groups --- Permutation groups. --- Groupes de permutations --- Substitution groups --- Group theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Combinatorial designs and configurations. --- Permutation groups. --- Parallels (Geometry) --- Configurations and designs, Combinatorial --- Designs and configurations, Combinatorial --- Combinatorial analysis --- Geometry --- Geometry, Non-Euclidean --- Substitution groups --- Group theory --- Foundations

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)