Defined as solutions of linear differential or difference equations with polynomial coefficients, D-finite functions play an important role in various areas of mathematics. This book is a comprehensive introduction to the theory of these functions with a special emphasis on computer algebra algorithms for computing with them: algorithms for detecting relations from given data, for evaluating D-finite functions, for executing closure properties, for obtaining various kinds of “explicit” expressions, for factoring operators, and for definite and indefinite symbolic summation and integration are explained in detail. The book comes “with batteries included” in the sense that it requires no background in computer algebra as the relevant facts from this area are summarized in the beginning. This makes the book accessible to a wide range of readers, from mathematics students who plan to work themselves on D-finite functions to researchers who want to apply the theory to their own work. Hundreds of exercises invite the reader to apply the techniques in the book and explore further aspects of the theory on their own. Solutions to all exercises are given in the appendix. When algorithms for D-finite functions came up in the early 1990s, computer proofs were met with a certain skepticism. Fortunately, these times are over and computer algebra has become a standard tool for many mathematicians. Yet, this powerful machinery is still not as widely known as it deserves. This book helps to spread the word that certain tasks can be safely delegated to a computer algebra system, and also what the limitations of these techniques are.

An introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.

Discrete structures model a vast array of objects ranging from DNA sequences to internet networks. The theory of generating functions provides an algebraic framework for discrete structures to be enumerated using mathematical tools. This book is the result of 25 years of work developing analytic machinery to recover asymptotics of multivariate sequences from their generating functions, using multivariate methods that rely on a combination of analytic, algebraic, and topological tools. The resulting theory of analytic combinatorics in several variables is put to use in diverse applications from mathematics, combinatorics, computer science, and the natural sciences. This new edition is even more accessible to graduate students, with many more exercises, computational examples with Sage worksheets to illustrate the main results, updated background material, additional illustrations, and a new chapter providing a conceptual overview.

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 computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

The problem of counting the number of self-avoiding polygons on a square grid, - therbytheirperimeterortheirenclosedarea,is aproblemthatis soeasytostate that, at ?rst sight, it seems surprising that it hasn’t been solved. It is however perhaps the simplest member of a large class of such problems that have resisted all attempts at their exact solution. These are all problems that are easy to state and look as if they should be solvable. They include percolation, in its various forms, the Ising model of ferromagnetism, polyomino enumeration, Potts models and many others. These models are of intrinsic interest to mathematicians and mathematical physicists, but can also be applied to many other areas, including economics, the social sciences, the biological sciences and even to traf?c models. It is the widespread applicab- ity of these models to interesting phenomena that makes them so deserving of our attention. Here however we restrict our attention to the mathematical aspects. Here we are concerned with collecting together most of what is known about polygons, and the closely related problems of polyominoes. We describe what is known, taking care to distinguish between what has been proved, and what is c- tainlytrue,but has notbeenproved. Theearlierchaptersfocusonwhatis knownand on why the problems have not been solved, culminating in a proof of unsolvability, in a certain sense. The next chapters describe a range of numerical and theoretical methods and tools for extracting as much information about the problem as possible, in some cases permittingexactconjecturesto be made.

This book constitutes the refereed proceedings of the 8th International Conference on Mathematical Aspects of Computer and Information Sciences, MACIS 2019, held in Gebze, Turkey, in November 2019. The 22 revised papers and 14 short papers presented were carefully reviewed and selected from 66 submissions. The papers are organized in the following topical sections: algorithms and foundation; security and cryptography; combinatorics, codes, designs and graphs; data modeling and machine learning; tools and software track.

Considers methodological aspects related to design and implementation of symbolic computation systems. This volume describes the proposed treatment of mathematical objects, via techniques for method abstraction, structures classification, and exact representation, the programming methodology which supports the design and implementation issues.

These proceedings of the 18th International Conference on Difference Equations and Applications cover a number of different aspects of difference equations and discrete dynamical systems, as well as the interplay between difference equations and dynamical systems. The conference was organized by the Department of Mathematics at the Universitat Autònoma de Barcelona (UAB) under the auspices of the International Society of Difference Equations (ISDE) and held in Barcelona (Catalonia, Spain) in July 2012. Its purpose was to bring together experts and novices in these fields to discuss the latest developments. The book gathers contributions in the field of combinatorial and topological dynamics, complex dynamics, applications of difference equations to biology, chaotic linear dynamics, economic dynamics and control and asymptotic behavior, and periodicity of difference equations. As such it is of interest to researchers and scientists engaged in the theory and applications of difference equations and discrete dynamical systems.

Over the past several years, significant advances have been made in developing the discontinuous Galerkin finite element method for applications in fluid flow and heat transfer. Certain unique features of the method have made it attractive as an alternative for other popular methods such as finite volume and finite elements in thermal fluids engineering analyses. This book is written as an introductory textbook on the discontinuous finite element method for senior undergraduate and graduate students in the area of thermal science and fluid dynamics. It also can be used as a reference book for researchers and engineers who intend to use the method for research in computational fluid dynamics and heat transfer. A good portion of this book has been used in a course for computational fluid dynamics and heat transfer for senior undergraduate and first year graduate students. It also has been used by some graduate students for self-study of the basics of discontinuous finite elements. This monograph assumes that readers have a basic understanding of thermodynamics, fluid mechanics and heat transfer and some background in numerical analysis. Knowledge of continuous finite elements is not necessary but will be helpful. The book covers the application of the method for the simulation of both macroscopic and micro/nanoscale fluid flow and heat transfer phenomena.

This volume contains a selection of papers on modern operator theory and its applications, arising from a joint workshop on linear one-dimensional singular integral equations. The book is of interest to a wide audience in the mathematical and engineering sciences.