The book `Fundamental Approach to Discrete Mathematics` is a required part of pursuing a computer science degree at most universities. …
For more than 35 years now, George B. Dantzig's Simplex-Method has been the most efficient mathematical tool for solving linear …
The rapidly expanding area of algebraic graph theory uses two different branches of algebra to explore various aspects of graph …
Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course …
This first volume of a two-volume work presents the basic theoretical principles, methods of analysis in obtaining the solutions of …
This book constitutes the thoroughly refereed proceedings of the 14th International Conference on Practice and Theory in Public Key Cryptography, …
Based on 20 years of teaching by the leading researcher in graph theory, this text offers a solid foundation on …
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet …
This weighty collection, containing 50 of what the Annotated Alice annotator and popular science journalist considers his best Scientific American …
In 1924 the firm of Julius Springer published the first volume of Methods of Mathematical Physics by Richard Courant and …
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In …
This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games …
Permutation patterns is a thriving area of combinatorics that relates to many other areas of mathematics, including graph theory, enumerative …
![A Combinatorial Introduction to the Representation Theory of Sn [expository notes]](https://s3.refhub.ir/images/thumb/A_Combinatorial_Introduction_to_the_Represent_15668.webp)
