Our search has the following Google-type functionality:

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'.*

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'.*

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.

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.

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.

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.

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'.*

- Sort Results By

An effective blend of carefully explained theory and practical applications, this text imparts the fundamentals of both information... [more]

Written for graduate students in mathematics or non-specialist mathematicians who wish to learn the basics about some of the... [more]

Combines elementary methods with analytic methods of modular functions to study the representation of integers as sums of... [more]

An update of the most accessible introductory number theory text available, this edition presents a mathematically rigorous... [more]

The eight articles in this book provide a valuable survey of the present state of knowledge in combinatorics. Written by leading... [more]

This book surveys the state-of-the-art in combinatorial game theory, that is games not involving chance or hidden information.... [more]

The author continues his outstanding scholarly attempt to bring together all significant mathematical constants in one place.... [more]

Geometric Data Analysis designates the approach of Multivariate Statistics that conceptualizes the set of observations as... [more]

The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and... [more]

For over fifty years, Ron Graham has been able to illuminate the common threads connecting different areas in discrete mathematics.... [more]

This engaging book unifies mathematical and computational properties of finite sets of points in the plane using forbidden... [more]

The theory of permutation groups has a wide range of applications including combinatorics, graph theory, computer science,... [more]

Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave... [more]

The Handbook of Geometric Constraint Systems Principles is an entry point to the currently used principal mathematical and... [more]

This manual contains solutions to odd-numbered Section Exercises, selected Chapter Review Exercises, odd-numbered Discussion... [more]

Multilayer networks has become a central topic in Network Science. The book presents a comprehensive account of this emerging... [more]

For over fifty years, Ron Graham has been able to illuminate the common threads connecting different areas in discrete mathematics.... [more]

This engaging book unifies mathematical and computational properties of finite sets of points in the plane using forbidden... [more]

Additive Combinatorics: A Menu of Research Problems is the first book of its kind to provide readers with an opportunity to... [more]

This book gets to the heart of the combinatorics that binds together quantum field theory and probability with a unified framework... [more]

Graph-Theoretical Matrices in Chemistry presents a systematic survey of graph-theoretical matrices and highlights their potential... [more]

This detailed two-volume reference on the Steenrod algebra and its various applications presents more than thirty years of... [more]

The Rogers--Ramanujan identities are a pair of infinite series-infinite product identities that were first discovered in 1894.... [more]

The nine articles in this book represent a timely snapshot of the state of the art in the different areas of combinatorics.... [more]

An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the connections with other... [more]