Discrete Structures and Their Interactions

1. Auflage 2019
ISBN: 978-0-367-37985-8
Verlag: CRC Press

Buch, Englisch, 218 Seiten, Format (B × H): 155 mm x 231 mm, Gewicht: 295 g

Discover the Connections between Different Structures and Fields

Discrete Structures and Their Interactions highlights the connections among various discrete structures, including graphs, directed graphs, hypergraphs, partial orders, finite topologies, and simplicial complexes. It also explores their relationships to classical areas of mathematics, such as linear and multilinear algebra, analysis, probability, logic, and topology.

The text introduces a number of discrete structures, such as hypergraphs, finite topologies, preorders, simplicial complexes, and order ideals of monomials, that most graduate students in combinatorics, and even some researchers in the field, seldom experience. The author explains how these structures have important applications in many areas inside and outside of combinatorics. He also discusses how to recognize valuable research connections through the structures.

Intended for graduate and upper-level undergraduate students in mathematics who have taken an initial course in discrete mathematics or graph theory, this book shows how discrete structures offer new insights into the classical fields of mathematics. It illustrates how to use discrete structures to represent the salient features and discover the underlying combinatorial principles of seemingly unrelated areas of mathematics.

Zielgruppe

Professional Practice & Development

Autoren/Hrsg.

Brown, Jason I

Fachgebiete

• Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
• Mathematik | Informatik EDV | Informatik Betriebssysteme

Inhaltsverzeichnis

Introduction. Discrete Structures—A Common Framework. Graphs and Directed Graphs. Preorders and Partial Orders. Hypergraphs. Complexes and Multicomplexes. Research Problems. Bibliography. Selected Solutions. Appendices. Index.

Über Autor(innen)

Jason I. Brown is a professor of mathematics at Dalhousie University. He received a Ph.D. from the University of Toronto and has written over 70 refereed articles. His research interests include graphs, hypergraphs, partial order, finite topologies, and simplicial complexes, with a focus on the applications of other fields of mathematics to discrete problems. His mathematical research that uncovered how the Beatles played the opening chord of "A Hard Day’s Night" was featured in various media, including NPR and BBC radio, Guitar Player Magazine, and the Wall Street Journal website.