Integers
Integers

Author: Bruce Landman

Publisher: Walter de Gruyter GmbH & Co KG

Published: 2014-08-22

Total Pages: 1187

ISBN-13: 311036932X

DOWNLOAD EBOOK

"Integers" is a refereed online journal devoted to research in the area of combinatorial number theory. It publishes original research articles in combinatorics and number theory. Topics covered by the journal include additive number theory, multiplicative number theory, sequences and sets, extremal combinatorics, Ramsey theory, elementary number theory, classical combinatorial problems, hypergraphs, and probabilistic number theory. Integers also houses a combinatorial games section. This work presents all papers of the 2013 volume in book form.

LATIN 2012: Theoretical Informatics
LATIN 2012: Theoretical Informatics

Author: David Fernández-Baca

Publisher: Springer

Published: 2012-04-10

Total Pages: 685

ISBN-13: 3642293441

DOWNLOAD EBOOK

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.

Combinatorial Number Theory
Combinatorial Number Theory

Author: Bruce Landman

Publisher: Walter de Gruyter

Published: 2011-12-22

Total Pages: 501

ISBN-13: 3110925095

DOWNLOAD EBOOK

This carefully edited volume contains selected refereed papers based on lectures presented by many distinguished speakers at the "Integers Conference 2005", an international conference in combinatorial number theory. The conference was held in celebration of the 70th birthday of Ronald Graham, a leader in several fields of mathematics.

Lagerungen
Lagerungen

Author: László Fejes Tóth

Publisher: Springer Nature

Published: 2023-04-28

Total Pages: 454

ISBN-13: 3031218000

DOWNLOAD EBOOK

The publication of the first edition of Lagerungen in der Ebene, auf der Kugel und im Raum in 1953 marked the birth of discrete geometry. Since then, the book has had a profound and lasting influence on the development of the field. It included many open problems and conjectures, often accompanied by suggestions for their resolution. A good number of new results were surveyed by László Fejes Tóth in his Notes to the 2nd edition. The present version of Lagerungen makes this classic monograph available in English for the first time, with updated Notes, completed by extensive surveys of the state of the art. More precisely, this book consists of: a corrected English translation of the original Lagerungen, the revised and updated Notes on the original text, eight self-contained chapters surveying additional topics in detail. The English edition provides a comprehensive update to an enduring classic. Combining the lucid exposition of the original text with extensive new material, it will be a valuable resource for researchers in discrete geometry for decades to come.

STOC '05
STOC '05

Author: ACM Special Interest Group for Algorithms and Computation Theory

Publisher:

Published: 2005

Total Pages: 788

ISBN-13:

DOWNLOAD EBOOK

50 years of Combinatorics, Graph Theory, and Computing
50 years of Combinatorics, Graph Theory, and Computing

Author: Fan Chung

Publisher: CRC Press

Published: 2019-11-15

Total Pages: 410

ISBN-13: 1000752097

DOWNLOAD EBOOK

50 Years of Combinatorics, Graph Theory, and Computing advances research in discrete mathematics by providing current research surveys, each written by experts in their subjects. The book also celebrates outstanding mathematics from 50 years at the Southeastern International Conference on Combinatorics, Graph Theory & Computing (SEICCGTC). The conference is noted for the dissemination and stimulation of research, while fostering collaborations among mathematical scientists at all stages of their careers. The authors of the chapters highlight open questions. The sections of the book include: Combinatorics; Graph Theory; Combinatorial Matrix Theory; Designs, Geometry, Packing and Covering. Readers will discover the breadth and depth of the presentations at the SEICCGTC, as well as current research in combinatorics, graph theory and computer science. Features: Commemorates 50 years of the Southeastern International Conference on Combinatorics, Graph Theory & Computing with research surveys Surveys highlight open questions to inspire further research Chapters are written by experts in their fields Extensive bibliographies are provided at the end of each chapter

Coloring Mixed Hypergraphs: Theory, Algorithms and Applications
Coloring Mixed Hypergraphs: Theory, Algorithms and Applications

Author: Vitaly Ivanovich Voloshin

Publisher: American Mathematical Soc.

Published: 2002

Total Pages: 199

ISBN-13: 0821828126

DOWNLOAD EBOOK

The theory of graph coloring has existed for more than 150 years. Historically, graph coloring involved finding the minimum number of colors to be assigned to the vertices so that adjacent vertices would have different colors. From this modest beginning, the theory has become central in discrete mathematics with many contemporary generalizations and applications. Generalization of graph coloring-type problems to mixed hypergraphs brings many new dimensions to the theory ofcolorings. A main feature of this book is that in the case of hypergraphs, there exist problems on both the minimum and the maximum number of colors. This feature pervades the theory, methods, algorithms, and applications of mixed hypergraph coloring. The book has broad appeal. It will be of interest to bothpure and applied mathematicians, particularly those in the areas of discrete mathematics, combinatorial optimization, operations research, computer science, software engineering, molecular biology, and related businesses and industries. It also makes a nice supplementary text for courses in graph theory and discrete mathematics. This is especially useful for students in combinatorics and optimization. Since the area is new, students will have the chance at this stage to obtain results that maybecome classic in the future.

An Invitation to Combinatorics
An Invitation to Combinatorics

Author: Shahriar Shahriari

Publisher: Cambridge University Press

Published: 2021-07-22

Total Pages: 636

ISBN-13: 1108756425

DOWNLOAD EBOOK

Active student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author – an award-winning teacher – writes in a conversational style, keeping the reader in mind on every page. Students will stay motivated through glimpses into current research trends and open problems as well as the history and global origins of the subject. All essential topics are covered, including Ramsey theory, enumerative combinatorics including Stirling numbers, partitions of integers, the inclusion-exclusion principle, generating functions, introductory graph theory, and partially ordered sets. Some significant results are presented as sets of guided problems, leading readers to discover them on their own. More than 140 problems have complete solutions and over 250 have hints in the back, making this book ideal for self-study. Ideal for a one semester upper undergraduate course, prerequisites include the calculus sequence and familiarity with proofs.