Discrete Structures and Their Interactions

Regular price €80.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Jason I. Brown
advanced undergraduate mathematics
Age Group_Uncategorized
Age Group_Uncategorized
algebraic topology
And Simplicial Complexes
Author_Jason I. Brown
automatic-update
Buchberger's Algorithm
Buchberger’s Algorithm
Category1=Non-Fiction
Category=PBD
Chromatic Number
Chromatic Polynomial
Clique Complex
Combinatorial Principles Of Mathematics
combinatorics research
Connections Among Discrete Structures
Connections Between Different Fields Of Mathematics
COP=United Kingdom
Critical Pair
Delivery_Pre-order
Directed Graph
Directed Graphs
discrete mathematics applications
Discrete Structures
Discrete Structures And Classical Mathematics
Edge Set
eq_isMigrated=2
eq_nobargain
Fano Plane
Finite Projective Plane
finite set theory
Finite Topologies
Fixed Point Property
Graphs
Hasse Diagram
Hypergraphs
Independent Set
Interval Partition
Introduction To Discrete Structures
Kneser Graph
Language_English
Log Concave
mathematical logic
MMT
Multilinear Algebra
PA=Temporarily unavailable
Partial Order
Partial Orders
Price_€50 to €100
probability structures
PS=Active
Series Parallel Graphs
softlaunch
Stanley Reisner Ring
Topological Spaces
Vertex Set
Vice Versa

Product details

  • ISBN 9780367379858
  • Weight: 410g
  • Dimensions: 156 x 234mm
  • Publication Date: 19 Jun 2019
  • Publisher: Taylor & Francis Ltd
  • Publication City/Country: GB
  • Product Form: Paperback
  • Language: English
Secure checkout Fast Shipping Easy returns

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.

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.

More from this author