Kategoria BISAC: Mathematics >> Discrete Mathematics

The fourth volume of Rudolf Ahlswede's lectures on Information Theory is focused on Combinatorics. Ahlswede was originally motivated to study combinatorial aspects of Information Theory via zero-error codes: in this case the structure of the coding problems usually drastically changes from probabilistic to combinatorial. The best example is Shannon's zero error capacity, where independent sets in graphs have to be examined. The extension to multiple access channels leads to the Zarankiewicz problem.

A code can be regarded combinatorially as a hypergraph; and many coding theorems can...

This book presents the first comprehensive overview of various verifiable computing techniques, which allow the computation of a function on outsourced data to be delegated to a server. It provides a brief description of all the approaches and highlights the properties each solution achieves. Further, it analyzes the level of security provided, how efficient the verification process is, who can act as a verifier and check the correctness of the result, which function class the verifiable computing scheme supports, and whether privacy with respect to t he input and/or output data is...

Combinatorics, Second Edition is a well-rounded, general introduction to the subjects of enumerative, bijective, and algebraic combinatorics. The textbook emphasizes bijective proofs, which provide elegant solutions to counting problems by setting up one-to-one correspondences between two sets of combinatorial objects. The author has written the textbook to be accessible to readers without any prior background in abstract algebra or combinatorics.

Part I of the second edition develops an array of mathematical tools to solve counting problems: basic counting rules,...

Mathematica by Example, Fifth Edition is an essential desk reference for the beginning Mathematica user, providing step-by-step instructions on achieving results from this powerful software tool. The book fully accounts for the dramatic changes to functionality and visualization capabilities in the most recent version of Mathematica (10.4). It accommodates the full array of new extensions in the types of data and problems that Mathematica can immediately handle, including cloud services and systems, geographic and geometric computation, dynamic visualization, interactive...

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session.

50 Years of Integer...