Lavoisier S.A.S.
14 rue de Provigny
94236 Cachan cedex
FRANCE

Heures d'ouverture 08h30-12h30/13h30-17h30
Tél.: +33 (0)1 47 40 67 00
Fax: +33 (0)1 47 40 67 02


Url canonique : www.lavoisier.fr/livre/informatique/discrete-structures-and-their-interactions/descriptif_4276521
Url courte ou permalien : www.lavoisier.fr/livre/notice.asp?ouvrage=4276521

Discrete Structures and Their Interactions

Langue : Anglais

Auteur :

Couverture de l’ouvrage Discrete Structures and Their Interactions

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.

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.

Professional Practice & Development

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.

Ces ouvrages sont susceptibles de vous intéresser


Monomial Algebras
220,72 €

Finite Geometries
129,87 €