Charles J. Colbourn – författare

The 19 surveys and research papers collected in this study were presented at the 25th Annual Iranian Conference in Tehran. Keynote papers by Richard Guy and Andreas Dress on combinatorics, combinatorial games, molecular biology and tilings are complemented by invited survey papers on combinatorial design theory and graph theory. Contributed papers covering graphs, designs, and related combinatorics are also included. The problem session at the conference posed interesting open questions, and these are included in the book.

On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty­ fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Islamic Republic of Iran. Its sponsors in~ eluded the Iranian Mathematical Society, and the Department of Mathematical Sciences at Sharif University of Technology. Among the keynote speakers were Professor Dr. Andreas Dress and Professor Richard K. Guy. Their plenary lec~ tures on combinatorial themes were complemented by invited and contributed lectures in a Combinatorics Session. This book is a collection of refereed papers, submitted primarily by the participants after the conference. The topics covered are diverse, spanning a wide range of combinatorics and al~ lied areas in discrete mathematics. Perhaps the strength and variety of the pa~ pers here serve as the best indications that combinatorics is advancing quickly, and that the Iranian mathematics community contains very active contributors. We hope that you find the papers mathematically stimulating, and look forward to a long and productive growth of combinatorial mathematics in Iran.

Continuing in the bestselling, informative tradition of the first edition, the Handbook of Combinatorial Designs, Second Edition remains the only resource to contain all of the most important results and tables in the field of combinatorial design. This handbook covers the constructions, properties, and applications of designs as well as existence results.Over 30% longer than the first edition, the book builds upon the groundwork of its predecessor while retaining the original contributors' expertise. The first part contains a brief introduction and history of the subject. The following parts focus on four main classes of combinatorial designs: balanced incomplete block designs, orthogonal arrays and Latin squares, pairwise balanced designs, and Hadamard and orthogonal designs. Closely connected to the preceding sections, the next part surveys 65 additional classes of designs, such as balanced ternary, factorial, graphical, Howell, quasi-symmetric, and spherical. The final part presents mathematical and computational background related to design theory.New to the Second EditionAn introductory part that provides a general overview and a historical perspective of the area New chapters on the history of design theory, various codes, bent functions, and numerous types of designs Fully updated tables, including BIBDs, MOLS, PBDs, and Hadamard matrices Nearly 2,200 references in a single bibliographic sectionMeeting the need for up-to-date and accessible tabular and reference information, this handbook provides the tools to understand combinatorial design theory and applications that span the entire discipline.The author maintains a website with more information.

This book constitutes the refereed post-conference proceedings of the 30th International Workshop on Combinatorial Algorithms, IWOCA 2019, held in Pisa, Italy, in July 2019. The 36 regular papers presented in this volume were carefully reviewed and selected from 73 submissions. They cover diverse areas of combinatorical algorithms, complexity theory, graph theory and combinatorics, combinatorial optimization, cryptography and information security, algorithms on strings and graphs, graph drawing and labelling, computational algebra and geometry, computational biology, probabilistic and randomized algorithms, algorithms for big data analytics, and new paradigms of computation.

This volume records and disseminates selected papers from the Stinson66 conference, including surveys, prospectives, and papers presenting original and current research. It contains four accessible surveys of topics in combinatorial designs and related topics, ranging from a tutorial survey of connections to classical group theory, to surveys of "hot topics" in current research. It also contains a prospective paper identifying topics for future research efforts, co-authored by one of the elder statesmen of the field, Alex Rosa. Finally, the research papers examine topics ranging from pure mathematics to applied work in computing, networking, communications, and cryptography.For students and newcomers to these topics, the volume provides accessible survey material that does not have onerous prerequisites. The breadth of topics reflects the vibrancy of the field in a way that can be appreciated by all researchers. The papers present important advances on theory and applications,which also benefit advanced researchers.

It contains four accessible surveys of topics in combinatorial designs and related topics, ranging from a tutorial survey of connections to classical group theory, to surveys of "hot topics" in current research.

This volume develops the depth and breadth of the mathematics underlying the construction and analysis of Hadamard matrices, and their use in the construction of combinatorial designs. At the same time, it pursues current research in their numerous applications in security and cryptography, quantum information, and communications. Bridges among diverse mathematical threads and extensive applications make this an invaluable source for understanding both the current state of the art and future directions.​​The existence of Hadamard matrices remains one of the most challenging open questions in combinatorics. Substantial progress on their existence has resulted from advances in algebraic design theory using deep connections with linear algebra, abstract algebra, finite geometry, number theory, and combinatorics. Hadamard matrices arise in a very diverse set of applications.  Starting with applications in experimental design theory and the theory of error-correcting codes, they have found unexpected and important applications in cryptography, quantum information theory, communications, and networking.