|
Books > Science & Mathematics > Mathematics > Algebra
|
Not currently available
Boolean Representations of Simplicial Complexes and Matroids (Hardcover, 2015 ed.)
Loot Price: R1,684
Discovery Miles 16 840
You Save: R907
(35%)
|
|
|
Boolean Representations of Simplicial Complexes and Matroids (Hardcover, 2015 ed.)
Series: Springer Monographs in Mathematics
Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.
|
This self-contained monograph explores a new theory centered around
boolean representations of simplicial complexes leading to a new
class of complexes featuring matroids as central to the theory. The
book illustrates these new tools to study the classical theory of
matroids as well as their important geometric connections.
Moreover, many geometric and topological features of the theory of
matroids find their counterparts in this extended context. Graduate
students and researchers working in the areas of combinatorics,
geometry, topology, algebra and lattice theory will find this
monograph appealing due to the wide range of new problems raised by
the theory. Combinatorialists will find this extension of the
theory of matroids useful as it opens new lines of research within
and beyond matroids. The geometric features and
geometric/topological applications will appeal to geometers.
Topologists who desire to perform algebraic topology computations
will appreciate the algorithmic potential of boolean representable
complexes.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
