Jocelyn Quaintance

This book is an introduction to discrete mathematics with a strong emphasis on formal reasoning. Beginning with the fundamentals of propositional and predicate logic, it develops proof techniques through deduction trees, truth tables, and formal semantics. The first chapter is devoted entirely to logical reasoning, providing a foundation for the rest of the text, which covers standard topics such as sets, functions, relations, induction, and recursion, as well as more advanced material like number theory, graph theory, and discrete probability. Highlights of this book include an initial chapter that provides a gentle introduction to basic logic, including proof trees and templates, written from the perspective of a master logician. For the more advanced audience, another chapter provides a deeper look into basic logic by providing details on Gentzen-style deduction trees, first-order theories, the simply-typed ?-calculus, and Kripke models for intuitionistic logic. Other highlights include the inclusion-exclusion principle, the Möbius inversion formula, the RSA cryptosystem, and a thorough discussion on network flow problems, including the Max-Flow Min-Cut theorem and the Ford and Fulkerson algorithm. Each chapter concludes with a detailed summary and a comprehensive set of problems, making the book especially suitable for undergraduate students in mathematics and theoretical computer science.

This book is an introduction to discrete mathematics with a strong emphasis on formal reasoning. Beginning with the fundamentals of propositional and predicate logic, it develops proof techniques through deduction trees, truth tables, and formal semantics. The first chapter is devoted entirely to logical reasoning, providing a foundation for the rest of the text, which covers standard topics such as sets, functions, relations, induction, and recursion, as well as more advanced material like number theory, graph theory, and discrete probability. Highlights of this book include an initial chapter that provides a gentle introduction to basic logic, including proof trees and templates, written from the perspective of a master logician. For the more advanced audience, another chapter provides a deeper look into basic logic by providing details on Gentzen-style deduction trees, first-order theories, the simply-typed ?-calculus, and Kripke models for intuitionistic logic. Other highlights include the inclusion-exclusion principle, the Möbius inversion formula, the RSA cryptosystem, and a thorough discussion on network flow problems, including the Max-Flow Min-Cut theorem and the Ford and Fulkerson algorithm. Each chapter concludes with a detailed summary and a comprehensive set of problems, making the book especially suitable for undergraduate students in mathematics and theoretical computer science.

This book presents the theory of harmonic analysis for noncommutative compact groups. If G is a commutative locally compact group, there is a well-understood theory of harmonic analysis as discussed in Aspects of Harmonic Analysis on Locally Compact Abelian Groups. If G is not commutative, things are a lot tougher. In the special case of a compact group, there is a deep interplay between analysis and representation theory which was first discovered by Hermann Weyl and refined by Andre Weil. This book presents these seminal results of Weyl and Weil. Starting with the basics of representations theory, it presents the famous Peter-Weyl theorems and discusses Fourier analysis on compact groups. This book also introduces the reader to induced representations of locally compact groups, induced representations of G-bundles, and the theory of Gelfand pairs. A special feature is the chapter on equivariant convolutional neural networks (CNNs), a chapter which shows how many of the abstract concepts of representations, analysis on compact groups, Peter-Weyl theorems, Fourier transform, induced representations are used to tackle very practical, modern-day problems.

The Fourier transform is a 'tool' used in engineering and computer vision to model periodic phenomena. Starting with the basics of measure theory and integration, this book delves into the harmonic analysis of locally compact abelian groups. It provides an in-depth tour of the beautiful theory of the Fourier transform based on the results of Gelfand, Pontrjagin, and Andre Weil in a manner accessible to an undergraduate student who has taken linear algebra and introductory real analysis. Highlights of this book include the Bochner integral, the Haar measure, Radon functionals, the theory of Fourier analysis on the circle, and the theory of the discrete Fourier transform. After studying this book, the reader will have the preparation necessary for understanding the Peter-Weyl theorems for complete, separable Hilbert algebras, a key theoretical concept used in the construction of Gelfand pairs and equivariant convolutional neural networks.

For more than thirty years the senior author has been trying to learn algebraic geometry. In the process he discovered that many of the classic textbooks in algebraic geometry require substantial knowledge of cohomology, homological algebra, and sheaf theory. In an attempt to demystify these abstract concepts and facilitate understanding for a new generation of mathematicians, he along with co-author wrote this book for an audience who is familiar with basic concepts of linear and abstract algebra, but who never has had any exposure to the algebraic geometry or homological algebra. As such this book consists of two parts. The first part gives a crash-course on the homological and cohomological aspects of algebraic topology, with a bias in favor of cohomology. The second part is devoted to presheaves, sheaves, Cech cohomology, derived functors, sheaf cohomology, and spectral sequences. All important concepts are intuitively motivated and the associated proofs of the quintessential theorems are presented in detail rarely found in the standard texts.

This textbook explores advanced topics in differential geometry, chosen for their particular relevance to modern geometry processing. Analytic and algebraic perspectives augment core topics, with the authors taking care to motivate each new concept. Whether working toward theoretical or applied questions, readers will appreciate this accessible exploration of the mathematical concepts behind many modern applications. Beginning with an in-depth study of tensors and differential forms, the authors go on to explore a selection of topics that showcase these tools. An analytic theme unites the early chapters, which cover distributions, integration on manifolds and Lie groups, spherical harmonics, and operators on Riemannian manifolds. An exploration of bundles follows, from definitions to connections and curvature in vector bundles, culminating in a glimpse of Pontrjagin and Chern classes. The final chapter on Clifford algebras and Clifford groups draws the book to an algebraic conclusion, which can be seen as a generalized viewpoint of the quaternions. Differential Geometry and Lie Groups: A Second Course captures the mathematical theory needed for advanced study in differential geometry with a view to furthering geometry processing capabilities. Suited to classroom use or independent study, the text will appeal to students and professionals alike. A first course in differential geometry is assumed; the authors’ companion volume Differential Geometry and Lie Groups: A Computational Perspective provides the ideal preparation.

This textbook offers an introduction to differential geometry designed for readers interested in modern geometry processing. Working from basic undergraduate prerequisites, the authors develop manifold theory and Lie groups from scratch; fundamental topics in Riemannian geometry follow, culminating in the theory that underpins manifold optimization techniques. Students and professionals working in computer vision, robotics, and machine learning will appreciate this pathway into the mathematical concepts behind many modern applications. Starting with the matrix exponential, the text begins with an introduction to Lie groups and group actions. Manifolds, tangent spaces, and cotangent spaces follow; a chapter on the construction of manifolds from gluing data is particularly relevant to the reconstruction of surfaces from 3D meshes. Vector fields and basic point-set topology bridge into the second part of the book, which focuses on Riemannian geometry. Chapters on Riemannian manifolds encompass Riemannian metrics, geodesics, and curvature. Topics that follow include submersions, curvature on Lie groups, and the Log-Euclidean framework. The final chapter highlights naturally reductive homogeneous manifolds and symmetric spaces, revealing the machinery needed to generalize important optimization techniques to Riemannian manifolds. Exercises are included throughout, along with optional sections that delve into more theoretical topics. Differential Geometry and Lie Groups: A Computational Perspective offers a uniquely accessible perspective on differential geometry for those interested in the theory behind modern computing applications. Equally suited to classroom use or independent study, the text will appeal to students and professionals alike; only a background in calculus and linear algebra is assumed. Readers looking to continue on to more advanced topics will appreciate the authors’ companion volume Differential Geometry and Lie Groups: A Second Course.

This textbook explores advanced topics in differential geometry, chosen for their particular relevance to modern geometry processing. Analytic and algebraic perspectives augment core topics, with the authors taking care to motivate each new concept. Whether working toward theoretical or applied questions, readers will appreciate this accessible exploration of the mathematical concepts behind many modern applications. Beginning with an in-depth study of tensors and differential forms, the authors go on to explore a selection of topics that showcase these tools. An analytic theme unites the early chapters, which cover distributions, integration on manifolds and Lie groups, spherical harmonics, and operators on Riemannian manifolds. An exploration of bundles follows, from definitions to connections and curvature in vector bundles, culminating in a glimpse of Pontrjagin and Chern classes. The final chapter on Clifford algebras and Clifford groups draws the book to an algebraic conclusion, which can be seen as a generalized viewpoint of the quaternions. Differential Geometry and Lie Groups: A Second Course captures the mathematical theory needed for advanced study in differential geometry with a view to furthering geometry processing capabilities. Suited to classroom use or independent study, the text will appeal to students and professionals alike. A first course in differential geometry is assumed; the authors’ companion volume Differential Geometry and Lie Groups: A Computational Perspective provides the ideal preparation.

This textbook offers an introduction to differential geometry designed for readers interested in modern geometry processing. Working from basic undergraduate prerequisites, the authors develop manifold theory and Lie groups from scratch; fundamental topics in Riemannian geometry follow, culminating in the theory that underpins manifold optimization techniques. Students and professionals working in computer vision, robotics, and machine learning will appreciate this pathway into the mathematical concepts behind many modern applications. Starting with the matrix exponential, the text begins with an introduction to Lie groups and group actions. Manifolds, tangent spaces, and cotangent spaces follow; a chapter on the construction of manifolds from gluing data is particularly relevant to the reconstruction of surfaces from 3D meshes. Vector fields and basic point-set topology bridge into the second part of the book, which focuses on Riemannian geometry. Chapters on Riemannian manifolds encompass Riemannian metrics, geodesics, and curvature. Topics that follow include submersions, curvature on Lie groups, and the Log-Euclidean framework. The final chapter highlights naturally reductive homogeneous manifolds and symmetric spaces, revealing the machinery needed to generalize important optimization techniques to Riemannian manifolds. Exercises are included throughout, along with optional sections that delve into more theoretical topics. Differential Geometry and Lie Groups: A Computational Perspective offers a uniquely accessible perspective on differential geometry for those interested in the theory behind modern computing applications. Equally suited to classroom use or independent study, the text will appeal to students and professionals alike; only a background in calculus and linear algebra is assumed. Readers looking to continue on to more advanced topics will appreciate the authors’ companion volume Differential Geometry and Lie Groups: A Second Course.

Volume 2 applies the linear algebra concepts presented in Volume 1 to optimization problems which frequently occur throughout machine learning. This book blends theory with practice by not only carefully discussing the mathematical under pinnings of each optimization technique but by applying these techniques to linear programming, support vector machines (SVM), principal component analysis (PCA), and ridge regression. Volume 2 begins by discussing preliminary concepts of optimization theory such as metric spaces, derivatives, and the Lagrange multiplier technique for finding extrema of real valued functions. The focus then shifts to the special case of optimizing a linear function over a region determined by affine constraints, namely linear programming. Highlights include careful derivations and applications of the simplex algorithm, the dual-simplex algorithm, and the primal-dual algorithm. The theoretical heart of this book is the mathematically rigorous presentation of various nonlinear optimization methods, including but not limited to gradient decent, the Karush-Kuhn-Tucker (KKT) conditions, Lagrangian duality, alternating direction method of multipliers (ADMM), and the kernel method. These methods are carefully applied to hard margin SVM, soft margin SVM, kernel PCA, ridge regression, lasso regression, and elastic-net regression. Matlab programs implementing these methods are included.

This book provides the mathematical fundamentals of linear algebra to practicers in computer vision, machine learning, robotics, applied mathematics, and electrical engineering. By only assuming a knowledge of calculus, the authors develop, in a rigorous yet down to earth manner, the mathematical theory behind concepts such as: vectors spaces, bases, linear maps, duality, Hermitian spaces, the spectral theorems, SVD, and the primary decomposition theorem. At all times, pertinent real-world applications are provided. This book includes the mathematical explanations for the tools used which we believe that is adequate for computer scientists, engineers and mathematicians who really want to do serious research and make significant contributions in their respective fields.

This book provides the mathematical fundamentals of linear algebra to practicers in computer vision, machine learning, robotics, applied mathematics, and electrical engineering. By only assuming a knowledge of calculus, the authors develop, in a rigorous yet down to earth manner, the mathematical theory behind concepts such as: vectors spaces, bases, linear maps, duality, Hermitian spaces, the spectral theorems, SVD, and the primary decomposition theorem. At all times, pertinent real-world applications are provided. This book includes the mathematical explanations for the tools used which we believe that is adequate for computer scientists, engineers and mathematicians who really want to do serious research and make significant contributions in their respective fields.

This book is a unique work which provides an in-depth exploration into the mathematical expertise, philosophy, and knowledge of H W Gould. It is written in a style that is accessible to the reader with basic mathematical knowledge, and yet contains material that will be of interest to the specialist in enumerative combinatorics. This book begins with exposition on the combinatorial and algebraic techniques that Professor Gould uses for proving binomial identities. These techniques are then applied to develop formulas which relate Stirling numbers of the second kind to Stirling numbers of the first kind. Professor Gould's techniques also provide connections between both types of Stirling numbers and Bernoulli numbers. Professor Gould believes his research success comes from his intuition on how to discover combinatorial identities. This book will appeal to a wide audience and may be used either as lecture notes for a beginning graduate level combinatorics class, or as a research supplement for the specialist in enumerative combinatorics.