Vector Partitions, Visible Points and Ramanujan Functions offers a novel theory of Vector Partitions, though very much grounded in the long-established work of others, that could be developed as an extension to the existing theory of Integer Partitions. The book is suitable for graduate students in physics, applied mathematics, number theory and computational mathematics. It takes the reader up to research level, presenting new results alongside known classical results from integer partitions and areas of vector and multipartite partition theory. It also sets forth new directions for research for the more advanced reader. Above all, the intention of the book is to bring new inspiration to others who study mathematics and related areas. It is hoped that some new ideas will be launched to add value and insight into many of the classical and new theories surrounding partitions. The book is an appreciation of the many gifted authors of research into partitions over the past century and before, in the hope that more may come of this for future generations. Features Provides a step-by-step guide through the known literature on Integer and Vector Partitions, and a focus on the not so well-known Visible Point Vector identities Serves as a reference for graduate students and researchers in physics, applied mathematics, number theory and computational mathematics Offers a variety of practical examples as well as sets of exercises suitable for students and researchers Geoffrey B. Campbell completed his PhD at Australian National University in 1998 under the esteemed physicist Professor Rodney Baxter. His affiliation with the Australian National University Mathematical Sciences Institute has continued for over 30 years. Within that time frame, Geoffrey also served eight years as an Honorary Research Fellow at LaTrobe University Mathematics and Statistics Department in Melbourne. Currently he writes ongoing articles for the Australian Mathematical Society Gazette. Within the international scope, Geoffrey currently serves as a PhD external committee member for a mathematics graduate student at Washington State University in America. Geoffrey has built a career within Australian Commonwealth and State government departments, including as an Advisor at the Department of Prime Minister and Cabinet; as Analyst Researcher for a Royal Commission. Geoffrey specializes in complex data, machine learning including data analytics. He is also a published poet in Australian anthologies and literary magazines.

"Vector Partitions, Visible Points and Ramanujan Functions offers a novel theory of Vector Partitions, though very much grounded in the long-established work of others, that could be developed as an extension to the existing theory of Integer Partitions. The book is suitable for graduate students in physics, applied mathematics, number theory and computational mathematics. It takes the reader up to research level, presenting new results alongside known classical results from integer partitions and areas of vector and multipartite partition theory. It also sets forth new directions for research for the more advanced reader. Above all, the intention of the book is to bring new inspiration to others who study mathematics and related areas. It is hoped that some new ideas will be launched to add value and insight into many of the classical and new theories surrounding partitions. The book is an appreciation of the many gifted authors of research into partitions over the past century and before, in the hope that more may come of this for future generations"--

This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device. The topics include a friendly invitation to Ehrhart’s theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler–Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more. With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume? Reviews of the first edition: “You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics.” — MAA Reviews “The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate rial, exercises, open problems and an extensive bibliography.” — Zentralblatt MATH “This beautiful book presents, at a level suitable for advanced undergraduates, a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.” — Mathematical Reviews “Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robins have written the perfect text for such a course.” — CHOICE

Combinatorial reciprocity is a very interesting phenomenon, which can be described as follows: A polynomial, whose values at positive integers count combinatorial objects of some sort, may give the number of combinatorial objects of a different sort when evaluated at negative integers (and suitably normalized). Such combinatorial reciprocity theorems occur in connections with graphs, partially ordered sets, polyhedra, and more. Using the combinatorial reciprocity theorems as a leitmotif, this book unfolds central ideas and techniques in enumerative and geometric combinatorics. Written in a friendly writing style, this is an accessible graduate textbook with almost 300 exercises, numerous illustrations, and pointers to the research literature. Topics include concise introductions to partially ordered sets, polyhedral geometry, and rational generating functions, followed by highly original chapters on subdivisions, geometric realizations of partially ordered sets, and hyperplane arrangements.

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Aimed at graduate students and researchers in enumerative combinatorics, this book is the first to treat the analytic aspects of combinatorial enumeration from a multivariate perspective.