Filter
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Combinatorics and Complexity of Partition Functions

Price range: ₹7,329.00 through ₹10,248.00
Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems.
-20%
Quick View
Add to Wishlist

Combinatorics and Complexity of Partition Functions

Price range: ₹7,329.00 through ₹10,248.00
Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart
-20%
Quick View
Add to Wishlist
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Combinatorics of Coxeter Groups

Price range: ₹5,661.00 through ₹8,580.00
Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups
-20%
Quick View
Add to Wishlist

Combinatorics of Coxeter Groups

Price range: ₹5,661.00 through ₹8,580.00
Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Commutative Algebra: Proceedings of a Workshop held in Salvador, Brazil, Aug. 8-17, 1988

Original price was: ₹2,901.00.Current price is: ₹2,321.00.
The central theme of this volume is commutative algebra, with emphasis on special graded algebras, which are increasingly of interest in problems of algebraic geometry, combinatorics and computer algebra. Most of the papers have partly survey character, but are research-oriented, aiming at classification and structural results.
-20%
Quick View
Add to Wishlist

Commutative Algebra: Proceedings of a Workshop held in Salvador, Brazil, Aug. 8-17, 1988

Original price was: ₹2,901.00.Current price is: ₹2,321.00.
The central theme of this volume is commutative algebra, with emphasis on special graded algebras, which are increasingly of interest in problems of algebraic geometry, combinatorics and computer algebra. Most of the papers have partly survey character, but are research-oriented, aiming at classification and structural results.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Computing the Continuous Discretely

Original price was: ₹6,554.00.Current price is: ₹5,244.00.
This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems.
-20%
Quick View
Add to Wishlist

Computing the Continuous Discretely

Original price was: ₹6,554.00.Current price is: ₹5,244.00.
This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Counting Surfaces

Original price was: ₹13,851.00.Current price is: ₹11,082.00.
The problem of enumerating maps (a map is a set of polygonal 'countries' on a world of a certain topology, not necessarily the plane or the sphere) is an important problem in mathematics and physics, and it has many applications ranging from statistical physics, geometry, particle physics, telecommunications, biology, ... etc. This problem has been studied by many communities of researchers, mostly combinatorists, probabilists, and physicists. Since 1978, physicists have invented a method called 'matrix models' to address that problem, and many results have been obtained. Besides, another important problem in mathematics and physics (in particular string theory), is to count Riemann surfaces. Riemann surfaces of a given topology are parametrized by a finite number of real parameters (called moduli), and the moduli space is a finite dimensional compact manifold or orbifold of complicated topology. The number of Riemann surfaces is the volume of that moduli space. More generally, an important problem in algebraic geometry is to characterize the moduli spaces, by computing not only their volumes, but also other characteristic numbers called intersection numbers. Witten's conjecture (which was first proved by Kontsevich), was the assertion that Riemann surfaces can be obtained as limits of polygonal surfaces (maps), made of a very large number of very small polygons. In other words, the number of maps in a certain limit, should give the intersection numbers of moduli spaces. In this book, we show how that limit takes place. The goal of this book is to explain the 'matrix model' method, to show the main results obtained with it, and to compare it with methods used in combinatorics (bijective proofs, Tutte's equations), or algebraic geometry (Mirzakhani's recursions). The book intends to be self-contained and accessible to graduate students, and provides comprehensive proofs, several examples, and gives the general formula for the enumeration of maps on surfaces of any topology. In the end, the link with more general topics such as algebraic geometry, string theory, is discussed, and in particular a proof of the Witten-Kontsevich conjecture is provided.
-20%
Quick View
Add to Wishlist

Counting Surfaces

Original price was: ₹13,851.00.Current price is: ₹11,082.00.
The problem of enumerating maps (a map is a set of polygonal 'countries' on a world of a certain topology, not necessarily the plane or the sphere) is an important problem in mathematics and physics, and it has many applications ranging from statistical physics, geometry, particle physics, telecommunications, biology, ... etc. This problem has been studied by many communities of researchers, mostly combinatorists, probabilists, and physicists. Since 1978, physicists have invented a method called 'matrix models' to address that problem, and many results have been obtained. Besides, another important problem in mathematics and physics (in particular string theory), is to count Riemann surfaces. Riemann surfaces of a given topology are parametrized by a finite number of real parameters (called moduli), and the moduli space is a finite dimensional compact manifold or orbifold of complicated topology. The number of Riemann surfaces is the volume of that moduli space. More generally, an important problem in algebraic geometry is to characterize the moduli spaces, by computing not only their volumes, but also other characteristic numbers called intersection numbers. Witten's conjecture (which was first proved by Kontsevich), was the assertion that Riemann surfaces can be obtained as limits of polygonal surfaces (maps), made of a very large number of very small polygons. In other words, the number of maps in a certain limit, should give the intersection numbers of moduli spaces. In this book, we show how that limit takes place. The goal of this book is to explain the 'matrix model' method, to show the main results obtained with it, and to compare it with methods used in combinatorics (bijective proofs, Tutte's equations), or algebraic geometry (Mirzakhani's recursions). The book intends to be self-contained and accessible to graduate students, and provides comprehensive proofs, several examples, and gives the general formula for the enumeration of maps on surfaces of any topology. In the end, the link with more general topics such as algebraic geometry, string theory, is discussed, and in particular a proof of the Witten-Kontsevich conjecture is provided.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity

Original price was: ₹5,511.00.Current price is: ₹4,410.00.
Opening new directions in research in both discrete event dynamic systems as well as in stochastic control, this volume focuses on a wide class of control and of optimization problems over sequences of integer numbers. This is a counterpart of convex optimization in the setting of discrete optimization.
-20%
Quick View
Add to Wishlist

Discrete-Event Control of Stochastic Networks: Multimodularity and Regularity

Original price was: ₹5,511.00.Current price is: ₹4,410.00.
Opening new directions in research in both discrete event dynamic systems as well as in stochastic control, this volume focuses on a wide class of control and of optimization problems over sequences of integer numbers. This is a counterpart of convex optimization in the setting of discrete optimization.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Disjunctive Programming

Original price was: ₹13,851.00.Current price is: ₹11,082.00.
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.
-20%
Quick View
Add to Wishlist

Disjunctive Programming

Original price was: ₹13,851.00.Current price is: ₹11,082.00.
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010. The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization. Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.
Select optionsView cart
-20%
Quick View
Add to Wishlist
CompareCompare
Select optionsView cart

Ecole d’Ete de Probabilites de Saint-Flour XXI – 1991

Original price was: ₹4,986.00.Current price is: ₹3,989.00.
-20%
Quick View
Add to Wishlist

Ecole d’Ete de Probabilites de Saint-Flour XXI – 1991

Original price was: ₹4,986.00.Current price is: ₹3,989.00.
Select optionsView cart
Select the fields to be shown. Others will be hidden. Drag and drop to rearrange the order.
  • Image
  • SKU
  • Rating
  • Price
  • Stock
  • Availability
  • Add to cart
  • Description
  • Content
  • Weight
  • Dimensions
  • Additional information
Click outside to hide the comparison bar
Compare
Select an available coupon below
    Your cart is emptyReturn to Shop
    ×