|
" Discrete structures and their interactions / "
Jason I. Brown
| Document Type
|
:
|
BL
|
| Record Number
|
:
|
667684
|
| Doc. No
|
:
|
dltt
|
| Main Entry
|
:
|
Brown, Jason I., (Ira),1961-
|
| Title & Author
|
:
|
Discrete structures and their interactions /\ Jason I. Brown
|
| Series Statement
|
:
|
Discrete mathematics and its applications
|
| Page. NO
|
:
|
xvii, 200 pages :: illustrations ;; 25 cm
|
| ISBN
|
:
|
9781466579415 (hardback)
|
|
|
:
|
: 1466579412 (hardback)
|
| Bibliographies/Indexes
|
:
|
Includes bibliographical references and index
|
| Abstract
|
:
|
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. Book jacket
|
| Subject
|
:
|
Graph theory-- Data processing
|
| Subject
|
:
|
Combinatorial analysis
|
| Subject
|
:
|
Computer algorithms
|
| Dewey Classification
|
:
|
512/.55
|
| LC Classification
|
:
|
QA166.245.B76 2013
|
| |