Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics. Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more. Features · Presents algorithmic ideas in pseudo-code based on mathematical concepts and can be used with any computer mathematics system · Emphasizes the algorithmic aspects of problems without sacrificing mathematical rigor · Aims to be self-contained in its mathematical development · Ideal for a first course in algorithmic or computer algebra for advanced undergraduates or beginning graduate students

This book explores the rich history of community college math with a specific focus on gatekeeper math classes. Gatekeeper math classes include courses such as college algebra, introduction to statistics, and all developmental math classes. For community colleges, successful completion of these classes is imperative for student retention. This book presents a decade-by-decade analysis of the history of community college mathematics. The author employs a mix of conceptual, empirical, and quantitative research. The empirical research stems from interviews with 30 community college faculty members from seven community colleges. From the 1970s to the pandemic in the early 2020s, the book explores math curricula as well as trends, initiatives, teaching practices, and mandates that have impacted community college math. The positives and negatives of such trends, initiatives, and mandates are presented along with suggestions on how to apply such knowledge going forward. The author addresses the key questions: How can we build a future model for community college gatekeeper math classes that is both successful and sustainable? Additionally, how can we learn from the past and the present to build such a model? This book will be ideal for students in graduate programs focusing on community college leadership or developmental education leadership as well as all those hoping to improve success rates in community college mathematics programs.

Fifty years after it made the transition from mimeographed lecture notes to a published book, Armand Borel's Introduction aux groupes arithmétiques continues to be very important for the theory of arithmetic groups. In particular, Chapter III of the book remains the standard reference for fundamental results on reduction theory, which is crucial in the study of discrete subgroups of Lie groups and the corresponding homogeneous spaces. The review of the original French version in Mathematical Reviews observes that “the style is concise and the proofs (in later sections) are often demanding of the reader.” To make the translation more approachable, numerous footnotes provide helpful comments.

Taking on the cherished principle that community colleges should be open to all students with a high school education, Scherer and Anson argue that open access policies and lenient federal financial aid laws harm students and present the case for raising the minimum requirements for community college entry.