Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms…
"57" Result
Sort By:
Discrete Mathematics for Computer Science: An Example-Based Introduction is intended for a first- or second-year discrete mathematics course for computer science majors. It covers many important mathematical topics essential for future computer science majors, such as algorithms…
This volume includes articles spanning several research areas in number theory, such as arithmetic geometry, algebraic number theory, analytic number theory, and applications in cryptography and coding theory. Most of the articles are the results of collaborations started at the…
This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to unde…
This self-contained text presents state-of-the-art results on recurrent sequences and their applications in algebra, number theory, geometry of the complex plane and discrete mathematics. It is designed to appeal to a wide readership, ranging from scholars and academics, to unde…
1. Introduction -- 2. Let Me Count the Ways -- 3. Syntax Precedes Semantics -- 4. Fearful Symmetry -- 5. All that Glitters is not Gold -- 6. Heads I Win, Tails you Lose -- 7. Sums of the Powers of Successive Integers -- 8. As Simple as 2+ 2 = 1 -- 9. Hidden in Plain Sight -- 10.…
"The goal of this book is to showcase the beauty of mathematics as revealed in nine topics of discrete mathematics. In each chapter, properties are explored through a series of straightforward questions that terminate with results that lie at the doorstep of a field of study. Ea…
The goal of this book is to showcase the beauty of mathematics as revealed in nine topics of discrete mathematics. In each chapter, properties are explored through a series of straightforward questions that terminate with results that lie at the doorstep of a field of study. Eac…
This open access book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He-Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of fin…
This open access book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He-Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of fin…
This open access book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He-Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of fin…
This book is intended to be a useful contribution for the modern teaching of applied mathematics, educating Industrial Mathematicians that will meet the growing demand for such experts. It covers many applications where mathematics play a fundamental role, from biology, telecomm…
This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of com…
