Kategoria BISAC: Mathematics >> Combinatorics

Paul Turan, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfred Renyi Institute of Mathematics, the Janos Bolyai Mathematical Society and the Mathematical Institute of Eotvos Lorand University organized an international conference devoted to Paul Turan's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics.

The conference was held in Budapest, August 22-26, 2011. Some of the invited lectures reviewed different aspects...

Discrete mathematics is quickly becoming one of the most important areas of mathematical research, with applications to cryptography, linear programming, coding theory and the theory of computing. This book is aimed at undergraduate mathematics and computer science students interested in developing a feeling for what mathematics is all about, where mathematics can be helpful, and what kinds of questions mathematicians work on. The authors discuss a number of selected results and methods of discrete mathematics, mostly from the areas of combinatorics and graph theory, with a little number...

Includes a rich variety of exercises to accompany the exposition of Coxeter groups

Coxeter groups have already been exposited from algebraic and geometric perspectives, but this book will be presenting the combinatorial aspects of Coxeter groups

This volume offers a collection of non-trivial, unconventional problems that require deep insight and imagination to solve. They cover many topics, including number theory, algebra, combinatorics, geometry and analysis. The problems start as simple exercises and become more difficult as the reader progresses through the book to become challenging enough even for the experienced problem solver. The introductory problems focus on the basic methods and tools while the advanced problems aim to develop problem solving techniques and intuition as well as promote further research in the area....

Covering relations between three different areas of mathematics and theoretical computer science, this book explores how non-commutative (infinite) groups, which are typically studied in combinatorial group theory, can be used in public key cryptography.

These lectures emphasize the relation between the problem of enumerating complicated graphs and the related large deviations questions. Such questions are closely related with the asymptotic distribution of matrices.

This introductory textbook takes a problem-solving approach to number theory, situating each concept within the framework of an example or a problem for solving. Starting with the essentials, the text covers divisibility, unique factorization, modular arithmetic and the Chinese Remainder Theorem, Diophantine equations, binomial coefficients, Fermat and Mersenne primes and other special numbers, and special sequences. Included are sections on mathematical induction and the pigeonhole principle, as well as a discussion of other number systems. By emphasizing examples and applications the...