Search Tips
Our search has the following Google-type functionality:
+ (addition symbol)
If you use '+' at the start of a word, that word will be present in the search results.
eg. Harry +Potter
Search results will contain 'Potter'.
- (minus symbol)
If you use '-' at the start of a word, that word will be absent in the search results.
eg. Harry -Potter
Search results will not contain 'Potter'.
AND
If you use 'AND' between 2 words, then both those words will be present in the search results.
eg. Harry AND Potter
Search results will contain both 'Harry' and 'Potter'.
NOTE: AND will only work with single words not phrases.
OR
If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.
eg. 'Harry OR Potter'
Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.
NOTE: OR will only work with single words not phrases.
NOT
If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).
eg. 'Harry NOT Potter'
Search results will not contain 'Potter'.
NOTE: NOT will only work with single words not phrases.
" " (double quotation marks)
If you use double quotation marks around words, those words will be present in that order.
eg. "Harry Potter"
Search results will contain 'Harry Potter', but not 'Potter Harry'.
NOTE: "" cannot be combined with AND, OR & NOT searches.
* (asterisk)
If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).
eg. 'Pot*er'
Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.
- Fiction & Literature
- Biography
- History & Archaeology
- Science & Medicine
- Philosophy & Religion
- Social Sciences & Law
- Music & Performing Arts
- Art & Architecture
- Travel & Lifestyle
- Health & Self-Help
- Business & Economics
- Computing & IT
- Reference
- Children's & Educational
- Science Fiction & Fantasy
- Languages & ESL
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.
By: Jason I. Brown
Imprint: CRC Press Inc
Country of Publication: United States
Dimensions: Height: 235mm, Width: 159mm, Spine: 33mm
Weight: 499g
ISBN: 9781466579415
ISBN 10: 1466579412
Series: Discrete Mathematics and Its Applications
Pages: 218
Publication Date: June 2013
Audience: College/higher education , College/higher education , Primary , Primary
Format: Hardback
Publisher's Status: Active
Introduction Sets Sequences Asymptotics Computational Complexity Discrete Structures-A Common Framework Isomorphism Substructures Properties, Parameters and Operations Representations and Models Graphs and Directed Graphs Graphs and Directed Graphs as Models Graphs and Other Branches of Mathematics Preorders and Partial Orders Finite Topologies and Preorders Representing Preorders and Partial Orders Hypergraphs Applying Hypergraphs Modeling Hypergraphs Complexes and Multicomplexes Representations of Complexes and Multicomplexes Applications of Complexes and Multicomplexes Research Problems Bibliography Selected Solutions Appendix A Set Theory Appendix B Matrix Theory and Linear Algebra Appendix C Abstract Algebra Appendix D Probability Appendix E Topology Appendix F Logic Index
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.
The book is a collection of examples, each of which shows either how discrete structures interact with each other or how discrete structures interact with other parts of mathematics. ... I am certain I will use some examples I found in this book when I teach combinatorics in the upcoming semester. -Miklos Bona, MAA Reviews, December 2013
