Latin Squares and Their Applications

Latin Squares and Their Applications

Author: A. Donald Keedwell

Publisher: Elsevier

Published: 2015-07-28

Total Pages: 443

ISBN-13: 0444635580

DOWNLOAD EBOOK

Latin Squares and Their Applications, Second edition offers a long-awaited update and reissue of this seminal account of the subject. The revision retains foundational, original material from the frequently-cited 1974 volume but is completely updated throughout. As with the earlier version, the author hopes to take the reader 'from the beginnings of the subject to the frontiers of research'. By omitting a few topics which are no longer of current interest, the book expands upon active and emerging areas. Also, the present state of knowledge regarding the 73 then-unsolved problems given at the end of the first edition is discussed and commented upon. In addition, a number of new unsolved problems are proposed. Using an engaging narrative style, this book provides thorough coverage of most parts of the subject, one of the oldest of all discrete mathematical structures and still one of the most relevant. However, in consequence of the huge expansion of the subject in the past 40 years, some topics have had to be omitted in order to keep the book of a reasonable length. Latin squares, or sets of mutually orthogonal latin squares (MOLS), encode the incidence structure of finite geometries; they prescribe the order in which to apply the different treatments in designing an experiment in order to permit effective statistical analysis of the results; they produce optimal density error-correcting codes; they encapsulate the structure of finite groups and of more general algebraic objects known as quasigroups. As regards more recreational aspects of the subject, latin squares provide the most effective and efficient designs for many kinds of games tournaments and they are the templates for Sudoku puzzles. Also, they provide a number of ways of constructing magic squares, both simple magic squares and also ones with additional properties. - Retains the organization and updated foundational material from the original edition - Explores current and emerging research topics - Includes the original 73 'Unsolved Problems' with the current state of knowledge regarding them, as well as new Unsolved Problems for further study


Latin Squares

Latin Squares

Author: József Dénes

Publisher: Elsevier

Published: 1991-01-24

Total Pages: 469

ISBN-13: 0080867863

DOWNLOAD EBOOK

In 1974 the editors of the present volume published a well-received book entitled ``Latin Squares and their Applications''. It included a list of 73 unsolved problems of which about 20 have been completely solved in the intervening period and about 10 more have been partially solved. The present work comprises six contributed chapters and also six further chapters written by the editors themselves. As well as discussing the advances which have been made in the subject matter of most of the chapters of the earlier book, this new book contains one chapter which deals with a subject (r-orthogonal latin squares) which did not exist when the earlier book was written.The success of the former book is shown by the two or three hundred published papers which deal with questions raised by it.


Discrete Mathematics Using Latin Squares

Discrete Mathematics Using Latin Squares

Author: Charles F. Laywine

Publisher: John Wiley & Sons

Published: 1998-09-17

Total Pages: 336

ISBN-13: 9780471240648

DOWNLOAD EBOOK

Over the past two decades, research in the theory of Latin Squares has been growing at a fast pace, and new significant developments have taken place. This book offers a unique approach to various areas of discrete mathematics through the use of Latin Squares.


Combinatorial Methods with Computer Applications

Combinatorial Methods with Computer Applications

Author: Jonathan L. Gross

Publisher: CRC Press

Published: 2016-04-19

Total Pages: 664

ISBN-13: 1584887443

DOWNLOAD EBOOK

This combinatorics text provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. It presents the computer and software algorithms in pseudo-code and incorporates definitions, theorems, proofs, examples, and nearly 300 illustrations as pedagogical elements of the exposition. Numerous problems, solutions, and hints reinforce basic skills and assist with creative problem solving. The author also offers a website with extensive graph theory informational resources as well as a computational engine to help with calculations for some of the exercises.


From Great Discoveries in Number Theory to Applications

From Great Discoveries in Number Theory to Applications

Author: Michal Křížek

Publisher: Springer Nature

Published: 2021-09-21

Total Pages: 342

ISBN-13: 3030838994

DOWNLOAD EBOOK

This book provides an overview of many interesting properties of natural numbers, demonstrating their applications in areas such as cryptography, geometry, astronomy, mechanics, computer science, and recreational mathematics. In particular, it presents the main ideas of error-detecting and error-correcting codes, digital signatures, hashing functions, generators of pseudorandom numbers, and the RSA method based on large prime numbers. A diverse array of topics is covered, from the properties and applications of prime numbers, some surprising connections between number theory and graph theory, pseudoprimes, Fibonacci and Lucas numbers, and the construction of Magic and Latin squares, to the mathematics behind Prague’s astronomical clock. Introducing a general mathematical audience to some of the basic ideas and algebraic methods connected with various types of natural numbers, the book will provide invaluable reading for amateurs and professionals alike.


Introduction to Combinatorics

Introduction to Combinatorics

Author: Walter D. Wallis

Publisher: CRC Press

Published: 2016-12-12

Total Pages: 424

ISBN-13: 1498777635

DOWNLOAD EBOOK

What Is Combinatorics Anyway? Broadly speaking, combinatorics is the branch of mathematics dealing with different ways of selecting objects from a set or arranging objects. It tries to answer two major kinds of questions, namely, counting questions: how many ways can a selection or arrangement be chosen with a particular set of properties; and structural questions: does there exist a selection or arrangement of objects with a particular set of properties? The authors have presented a text for students at all levels of preparation. For some, this will be the first course where the students see several real proofs. Others will have a good background in linear algebra, will have completed the calculus stream, and will have started abstract algebra. The text starts by briefly discussing several examples of typical combinatorial problems to give the reader a better idea of what the subject covers. The next chapters explore enumerative ideas and also probability. It then moves on to enumerative functions and the relations between them, and generating functions and recurrences., Important families of functions, or numbers and then theorems are presented. Brief introductions to computer algebra and group theory come next. Structures of particular interest in combinatorics: posets, graphs, codes, Latin squares, and experimental designs follow. The authors conclude with further discussion of the interaction between linear algebra and combinatorics. Features Two new chapters on probability and posets. Numerous new illustrations, exercises, and problems. More examples on current technology use A thorough focus on accuracy Three appendices: sets, induction and proof techniques, vectors and matrices, and biographies with historical notes, Flexible use of MapleTM and MathematicaTM


CRC Handbook of Combinatorial Designs

CRC Handbook of Combinatorial Designs

Author: Charles J. Colbourn

Publisher: CRC Press

Published: 2010-12-12

Total Pages: 778

ISBN-13: 9781420049954

DOWNLOAD EBOOK

From experimental design to cryptography, this comprehensive, easy-to-access reference contains literally all the facts you need on combinatorial designs. It includes constructions of designs, existence results, and properties of designs. Organized into six main parts, the CRC Handbook of Combinatorial Designs covers:


Combinatorics: A Very Short Introduction

Combinatorics: A Very Short Introduction

Author: Robin Wilson

Publisher: Oxford University Press

Published: 2016-04-28

Total Pages: 144

ISBN-13: 0191035254

DOWNLOAD EBOOK

How many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal's triangle? (it was not Pascal) Combinatorics, the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects, works to answer all these questions. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. In this Very Short Introduction Robin Wilson gives an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of colours needed to colour a map with different colours for neighbouring countries. ABOUT THE SERIES: The Very Short Introductions series from Oxford University Press contains hundreds of titles in almost every subject area. These pocket-sized books are the perfect way to get ahead in a new subject quickly. Our expert authors combine facts, analysis, perspective, new ideas, and enthusiasm to make interesting and challenging topics highly readable.


Orthogonal Arrays

Orthogonal Arrays

Author: A.S. Hedayat

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 433

ISBN-13: 1461214785

DOWNLOAD EBOOK

Orthogonal arrays have played a vital role in improving the quality of products manufactured throughout the world. This first book on the subject since its introduction more than fifty years ago serves as a key resource to this area of designing experiments. Most of the arrays obtained by the methods in this book are available electronically. Anyone running experiments - whether in a chemistry lab or a manufacturing plant, or in agricultural or medical research - will find this book useful.


Design Theory

Design Theory

Author: Charles C. Lindner

Publisher: CRC Press

Published: 2017-03-27

Total Pages: 265

ISBN-13: 135160645X

DOWNLOAD EBOOK

Design Theory, Second Edition presents some of the most important techniques used for constructing combinatorial designs. It augments the descriptions of the constructions with many figures to help students understand and enjoy this branch of mathematics. This edition now offers a thorough development of the embedding of Latin squares and combinatorial designs. It also presents some pure mathematical ideas, including connections between universal algebra and graph designs. The authors focus on several basic designs, including Steiner triple systems, Latin squares, and finite projective and affine planes. They produce these designs using flexible constructions and then add interesting properties that may be required, such as resolvability, embeddings, and orthogonality. The authors also construct more complicated structures, such as Steiner quadruple systems. By providing both classical and state-of-the-art construction techniques, this book enables students to produce many other types of designs.