"With its origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. The topics covered here usually arise in many branches of science and technology"

This unique text brings together into a single framework current research in the three areas of discrete calculus, complex networks, and algorithmic content extraction. Many example applications from several fields of computational science are provided.

This book provides an introduction to combinatorics, finite calculus, formal series, recurrences, and approximations of sums. Readers will find not only coverage of the basic elements of the subjects but also deep insights into a range of less common topics rarely considered within a single book, such as counting with occupancy constraints, a clear distinction between algebraic and analytical properties of formal power series, an introduction to discrete dynamical systems with a thorough description of Sarkovskii’s theorem, symbolic calculus, and a complete description of the Euler-Maclaurin formulas and their applications. Although several books touch on one or more of these aspects, precious few cover all of them. The authors, both pure mathematicians, have attempted to develop methods that will allow the student to formulate a given problem in a precise mathematical framework. The aim is to equip readers with a sound strategy for classifying and solving problems by pursuing a mathematically rigorous yet user-friendly approach. This is particularly useful in combinatorics, a field where, all too often, exercises are solved by means of ad hoc tricks. The book contains more than 400 examples and about 300 problems, and the reader will be able to find the proof of every result. To further assist students and teachers, important matters and comments are highlighted, and parts that can be omitted, at least during a first and perhaps second reading, are identified.

The book presents a systematic and compact treatment of the qualitative theory of half-lineardifferential equations. It contains the most updated and comprehensive material and represents the first attempt to present the results of the rapidly developing theory of half-linear differential equations in a unified form. The main topics covered by the book are oscillation and asymptotic theory and the theory of boundary value problems associated with half-linear equations, but the book also contains a treatment of related topics like PDE's with p-Laplacian, half-linear difference equations and various more general nonlinear differential equations.- The first complete treatment of the qualitative theory of half-linear differential equations.- Comparison of linear and half-linear theory.- Systematic approach to half-linear oscillation and asymptotic theory.- Comprehensive bibliography and index.- Useful as a reference book in the topic.

This book covers the basic elements of difference equations and the tools of difference and sum calculus necessary for studying and solv ing, primarily, ordinary linear difference equations. Examples from various fields are presented clearly in the first chapter, then discussed along with their detailed solutions in Chapters 2-7. The book is in tended mainly as a text for the beginning undergraduate course in difference equations, where the "operational sum calculus" of the di rect use of the discrete Fourier transforms for solving boundary value problems associated with difference equations represents an added new feature compared to other existing books on the subject at this introductory level. This means that in addition to the familiar meth ods of solving difference equations that are covered in Chapter 3, this book emphasizes the use of discrete transforms. It is an attempt to introduce the methods and mechanics of discrete transforms for solv ing ordinary difference equations. The treatment closely parallels what many students have already learned about using the opera tional (integral) calculus of Laplace and Fourier transforms to solve differential equations. As in the continuous case, discrete operational methods may not solve problems that are intractable by other meth ods, but they can facilitate the solution of a large class of discrete initial and boundary value problems. Such operational methods, or what we shall term "operational sum calculus," may be extended eas ily to solve partial difference equations associated with initial and/or boundary value problems.

Handbook of Discrete and Combinatorial Mathematics provides a comprehensive reference volume for mathematicians, computer scientists, engineers, as well as students and reference librarians. The material is presented so that key information can be located and used quickly and easily. Each chapter includes a glossary. Individual topics are covered in sections and subsections within chapters, each of which is organized into clearly identifiable parts: definitions, facts, and examples. Examples are provided to illustrate some of the key definitions, facts, and algorithms. Some curious and entertaining facts and puzzles are also included. Readers will also find an extensive collection of biographies. This second edition is a major revision. It includes extensive additions and updates. Since the first edition appeared in 1999, many new discoveries have been made and new areas have grown in importance, which are covered in this edition.

This book constitutes the refereed proceedings of the 9th International Conference on Machines, Computations, and Universality, MCU 2022, held in Debrecen, Hungary, in August/September 2022. The 10 revised full papers presented were carefully reviewed and selected from 18 submissions. MCU explores computation in the setting of various discrete models (Turing machines, register machines, cellular automata, tile assembly systems, rewriting systems, molecular computing models, neural models, concurrent systems, etc.) and analog and hybrid models (BSS machines, infinite time cellular automata, real machines, quantum computing).

Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they’ve learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author’s lively and friendly writing style is appealing to both instructors and students alike and encourages readers to learn. The book’s light-hearted approach to the subject is a guiding principle and helps students learn mathematical abstraction. Features: The book’s Try This! sections encourage students to construct components of discussed concepts, theorems, and proofs Provided sets of discovery problems and illustrative examples reinforce learning Bonus sections can be used by instructors as part of their regular curriculum, for projects, or for further study

This book fills a gap in the literature by introducing numerical techniques to solve problems of fractional calculus of variations (FCV). In most cases, finding the analytic solution to such problems is extremely difficult or even impossible, and numerical methods need to be used.The authors are well-known researchers in the area of FCV and the book contains some of their recent results, serving as a companion volume to Introduction to the Fractional Calculus of Variations by A B Malinowska and D F M Torres, where analytical methods are presented to solve FCV problems. After some preliminaries on the subject, different techniques are presented in detail with numerous examples to help the reader to better understand the methods. The techniques presented may be used not only to deal with FCV problems but also in other contexts of fractional calculus, such as fractional differential equations and fractional optimal control. It is suitable as an advanced book for graduate students in mathematics, physics and engineering, as well as for researchers interested in fractional calculus.

With contributions derived from presentations at an international conference, Non-Associative Algebra and Its Applications explores a wide range of topics focusing on Lie algebras, nonassociative rings and algebras, quasigroups, loops, and related systems as well as applications of nonassociative algebra to geometry, physics, and natural sciences.