Search

Robert A. Rankin, one of the world's foremost authorities on modular forms and a founding editor of The Ramanujan Journal, died on January 27, 2001, at the age of 85. Rankin had broad interests and contributed fundamental papers in a wide variety of areas within number theory, geometry, analysis, and algebra. To commemorate Rankin's life and work, the editors have collected together 25 papers by several eminent mathematicians reflecting Rankin's extensive range of interests within number theory. Many of these papers reflect Rankin's primary focus in modular forms. It is the editors'fervent hope that mathematicians will be stimulated by these papers and gain a greater appreciation for Rankin's contributions to mathematics. This volume would be an inspiration to students and researchers in the areas of number theory and modular forms.

This book contains select papers on rings, monoids and module theory which are presented at the 3rd International Conference on Mathematics and Statistics (AUS-ICMS 2020) held at the American University of Sharjah, United Arab Emirates, from 6–9 February 2020. This conference was held in honour of the work of the distinguished algebraist Daniel D. Anderson. Many participants and colleagues from around the world felt it appropriate to acknowledge his broad and sweeping contributions to research in algebra by writing an edited volume in his honor. The topics covered are, inevitably, a cross-section of the vast expansion of modern algebra. The book is divided into two sections—surveys and recent research developments—with each section hopefully offering symbiotic utility to the reader. The book contains a balanced mix of survey papers, which will enable expert and non-expert alike to get a good overview of developments across a range of areas of algebra. The book is expected to be of interest to both beginning graduate students and experienced researchers.

The book is a reproduction of a course of lectures delivered by the author in 1983-84 which appeared in the Brandeis Lecture Notes series. The aim of this course was to give an introduction to the series of papers by concentrating on the case of the full linear group. In recent years, there has been great progress in standard monomial theory due to the work of Peter Littelmann. The author's lectures (reproduced in this book) remain an excellent introduction to standard monomial theory. Standard monomial theory deals with the construction of nice bases of finite dimensional irreducible representations of semi-simple algebraic groups or, in geometric terms, nice bases of coordinate rings of flag varieties (and their Schubert subvarieties) associated with these groups. Besides its intrinsic interest, standard monomial theory has applications to the study of the geometry of Schubert varieties. Standard monomial theory has its origin in the work of Hodge, giving basesof the coordinate rings of the Grassmannian and its Schubert subvarieties by “standard monomials”. In its modern form, standard monomial theory was developed by the author in a series of papers written in collaboration with V. Lakshmibai and C. Musili. In the second edition of the book, conjectures of a standard monomial theory for a general semi-simple (simply-connected) algebraic group, due to Lakshmibai, have been added as an appendix, and the bibliography has been revised.

This volume contains one invited lecture which was presented by the 1994 Fields Medal­ ist Professor E. Zelmanov and twelve other papers which were presented at the Third International Conference on Algebra and Their Related Topics at Chang Jung Christian University, Tainan, Republic of China, during the period June 26-July 1, 200l. All papers in this volume have been refereed by an international referee board and we would like to express our deepest thanks to all the referees who were so helpful and punctual in submitting their reports. Thanks are also due to the Promotion and Research Center of National Science Council of Republic of China and the Chang Jung Christian University for their generous financial support of this conference. The spirit of this conference is a continuation of the last two International Tainan­ Moscow Algebra Workshop on Algebras and Their Related Topics which were held in the mid-90's of the last century. The purpose of this very conference was to give a clear picture of the recent development and research in the fields of different kinds of algebras both in Taiwan and in the rest ofthe world, especially say, Russia'Europe, North America and South America. Thus, we were hoping to enhance the possibility of future cooperation in research work among the algebraists ofthe five continents. Here we would like to point out that this algebra gathering will constantly be held in the future in the southern part of Taiwan.

As the interaction of mathematics and theoretical physics continues to intensify, the theories developed in mathematics are being applied to physics, and conversely. This book centers around the theory of primitive forms which currently plays an active and key role in topological field theory (theoretical physics), but was originally developed as a mathematical notion to define a'good period mapping'for a family of analytic structures. The invited papers in this volume are expository in nature by participants of the Taniguchi Symposium on'Topological Field Theory, Primitive Forms and Related Topics'and the RIMS Symposium bearing the same title, both held in Kyoto. The papers reflect the broad research of some of the world's leading mathematical physicists, and should serve as an excellent resource for researchers as well as graduate students of both disciplines.

This book contains 33 papers from among the 41 papers presented at the Eighth International Conference on Fibonacci Numbers and Their Applications which was held at the Rochester Institute of Technology, Rochester, New York, from June 22 to June 26, 1998. These papers have been selected after a careful review by well known referees in the field, and they range from elementary number theory to probability and statistics. The Fibonacci numbers and recurrence relations are their unifying bond. It is anticipated that this book, like its seven predecessors, will be useful to research workers and graduate students interested in the Fibonacci numbers and their applications. June 1, 1999 The Editor F. T. Howard Mathematics and Computer Science Wake Forest University Box 7388 Reynolda Station Winston-Salem, NC USA xvii THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Anderson, Peter G., Chairman Horadam, A. F. (Australia), Co-Chair Arpaya, Pasqual Philippou, A. N. (Cyprus), Co-Chair Biles, John Bergum, G. E. (U. S. A.) Orr, Richard Filipponi, P. (Italy) Radziszowski, Stanislaw Harborth, H. (Germany) Rich, Nelson Horibe, Y. (Japan) Howard, F. (U. S. A.) Johnson, M. (U. S. A.) Kiss, P. (Hungary) Phillips, G. M. (Scotland) Turner, J. (New Zealand) Waddill, M. E. (U. S. A.) xix LIST OF CONTRIBUTORS TO THE CONFERENCE AGRATINI, OCTAVIAN,'Unusual Equations in Study.'•ANDO, SHIRO, (coauthor Daihachiro Sato),'On the Generalized Binomial Coefficients Defined by Strong Divisibility Sequences.'•ANATASSOVA, VASSIA K., (coauthor J. C.

Andrzej Schinzel, born in 1937, is a leading number theorist whose work has a lasting impact on modern mathematics. He is the author of over 200 research articles in various branches of arithmetics, including elementary, analytic and algebraic number theory. He has also been, for nearly 40 years, the editor of Acta Arithmetica, the first international journal devoted exclusively to number theory. These Selecta contain Schinzel's most important articles published between 1955 and 2006. The arrangement is by topic, with each major category introduced by an expert's comment. Many of the hundred selected papers deal with arithmetical and algebraic properties of polynomials in one or several variables, but there are also articles on Euler's totient function, the favorite subject of Schinzel's early research, on prime numbers (including the famous paper with Sierpiński on the Hypothesis “H”), algebraic number theory, diophantine equations, analytical number theory and geometry of numbers. Volume II concludes with some papers from outside number theory, as well as a list of unsolved problems and unproved conjectures, taken from the work of Schinzel.

Sparse polynomial approximation is an important tool for approximating high-dimensional functions from limited samples – a task commonly arising in computational science and engineering. Yet, it lacks a complete theory. There is a well-developed theory of best s-term polynomial approximation, which asserts exponential or algebraic rates of convergence for holomorphic functions. There are also increasingly mature methods such as (weighted) ℓ1-minimization for practically computing such approximations. However, whether these methods achieve the rates of the best s-term approximation is not fully understood. Moreover, these methods are not algorithms per se, since they involve exact minimizers of nonlinear optimization problems. This paper closes these gaps by affirmatively answering the following question: are there robust, efficient algorithms for computing sparse polynomial approximations to finite- or infinite-dimensional, holomorphic and Hilbert-valued functions from limited samples that achieve the same rates as the best s-term approximation? We do so by introducing algorithms with exponential or algebraic convergence rates that are also robust to sampling, algorithmic and physical discretization errors. Our results involve several developments of existing techniques, including a new restarted primal-dual iteration for solving weighted ℓ1-minimization problems in Hilbert spaces. Our theory is supplemented by numerical experiments demonstrating the efficacy of these algorithms.

This book gathers, in a beautifully structured way, recent findings on chain conditions in commutative algebra that were previously only available in papers. The majority of chapters are self-contained, and all include detailed proofs, a wealth of examples and solved exercises, and a complete reference list. The topics covered include S-Noetherian, S-Artinian, Nonnil-Noetherian, and Strongly Hopfian properties on commutative rings and their transfer to extensions such as polynomial and power series rings, and more. Though primarily intended for readers with a background in commutative rings, modules, polynomials and power series extension rings, the book can also be used as a reference guide to support graduate-level algebra courses, or as a starting point for further research.

This proceedings volume gathers selected, revised papers presented at the 51st Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2020), held at Florida Atlantic University in Boca Raton, USA, on March 9-13, 2020. The SEICCGTC is broadly considered to be a trendsetter for other conferences around the world – many of the ideas and themes first discussed at it have subsequently been explored at other conferences and symposia.The conference has been held annually since 1970, in Baton Rouge, Louisiana and Boca Raton, Florida. Over the years, it has grown to become the major annual conference in its fields, and plays a major role in disseminating results and in fostering collaborative work.This volume is intended for the community of pure and applied mathematicians, in academia, industry and government, working in combinatorics and graph theory, as well as related areas of computer science and the interactionsamong these fields.

This book contains 28 research articles from among the 49 papers and abstracts presented at the Tenth International Conference on Fibonacci Numbers and Their Applications. These articles have been selected after a careful review by expert referees, and they range over many areas of mathematics. The Fibonacci numbers and recurrence relations are their unifying bond. We note that the article'Fibonacci, Vern and Dan', which follows the Introduction to this volume, is not a research paper. It is a personal reminiscence by Marjorie Bicknell-Johnson, a longtime member of the Fibonacci Association. The editor believes it will be of interest to all readers. It is anticipated that this book, like the eight predecessors, will be useful to research workers and students at all levels who are interested in the Fibonacci numbers and their applications. March 16, 2003 The Editor Fredric T. Howard Mathematics Department Wake Forest University Box 7388 Reynolda Station Winston-Salem, NC 27109 xxi THE ORGANIZING COMMITTEES LOCAL COMMITTEE INTERNATIONAL COMMITTEE Calvin Long, Chairman A. F. Horadam (Australia), Co-Chair Terry Crites A. N. Philippou (Cyprus), Co-Chair Steven Wilson A. Adelberg (U. S. A.) C. Cooper (U. S. A.) Jeff Rushal H. Harborth (Germany) Y. Horibe (Japan) M. Bicknell-Johnson (U. S. A.) P. Kiss (Hungary) J. Lahr (Luxembourg) G. M. Phillips (Scotland) J.'Thrner (New Zealand) xxiii xxiv LIST OF CONTRlBUTORS TO THE CONFERENCE • ADELBERG, ARNOLD,'Universal Bernoulli Polynomials and p-adic Congruences.'•AGRATINI, OCTAVIAN,'A Generalization of Durrmeyer-Type Polynomials.'BENJAMIN, ART,'Mathemagics.

On August 6, 2002,a paper with the title “PRIMES is in P”, by M. Agrawal, N. Kayal, and N. Saxena, appeared on the website of the Indian Institute of Technology at Kanpur, India. In this paper it was shown that the “primality problem”hasa“deterministic algorithm” that runs in “polynomial time”. Finding out whether a given number n is a prime or not is a problem that was formulated in ancient times, and has caught the interest of mathema- ciansagainandagainfor centuries. Onlyinthe 20thcentury,with theadvent of cryptographic systems that actually used large prime numbers, did it turn out to be of practical importance to be able to distinguish prime numbers and composite numbers of signi?cant size. Readily, algorithms were provided that solved the problem very e?ciently and satisfactorily for all practical purposes, and provably enjoyed a time bound polynomial in the number of digits needed to write down the input number n. The only drawback of these algorithms is that they use “randomization” — that means the computer that carries out the algorithm performs random experiments, and there is a slight chance that the outcome might be wrong, or that the running time might not be polynomial. To?nd an algorithmthat gets by without rand- ness, solves the problem error-free, and has polynomial running time had been an eminent open problem in complexity theory for decades when the paper by Agrawal, Kayal, and Saxena hit the web.

Systems of polynomial equations can be used to model an astonishing variety of phenomena. This book explores the geometry and algebra of such systems and includes numerous applications. The book begins with elimination theory from Newton to the twenty-first century and then discusses the interaction between algebraic geometry and numerical computations, a subject now called numerical algebraic geometry. The final three chapters discuss applications to geometric modeling, rigidity theory, and chemical reaction networks in detail. Each chapter ends with a section written by a leading expert. Examples in the book include oil wells, HIV infection, phylogenetic models, four-bar mechanisms, border rank, font design, Stewart-Gough platforms, rigidity of edge graphs, Gaussian graphical models, geometric constraint systems, and enzymatic cascades. The reader will encounter geometric objects such as Bézier patches, Cayley-Menger varieties, and toric varieties; and algebraic objects such as resultants, Rees algebras, approximation complexes, matroids, and toric ideals. Two important subthemes that appear in multiple chapters are toric varieties and algebraic statistics. The book also discusses the history of elimination theory, including its near elimination in the middle of the twentieth century. The main goal is to inspire the reader to learn about the topics covered in the book. With this in mind, the book has an extensive bibliography containing over 350 books and papers.

From July 31 through August 3,1997, the Pennsylvania State University hosted the Topics in Number Theory Conference. The conference was organized by Ken Ono and myself. By writing the preface, I am afforded the opportunity to express my gratitude to Ken for beng the inspiring and driving force behind the whole conference. Without his energy, enthusiasm and skill the entire event would never have occurred. We are extremely grateful to the sponsors of the conference: The National Sci­ ence Foundation, The Penn State Conference Center and the Penn State Depart­ ment of Mathematics. The object in this conference was to provide a variety of presentations giving a current picture of recent, significant work in number theory. There were eight plenary lectures: H. Darmon (McGill University),'Non-vanishing of L-functions and their derivatives modulo p.'A. Granville (University of Georgia),'Mean values of multiplicative functions.'C. Pomerance (University of Georgia),'Recent results in primality testing.'C. Skinner (Princeton University),'Deformations of Galois representations.'R. Stanley (Massachusetts Institute of Technology),'Some interesting hyperplane arrangements.'F. Rodriguez Villegas (Princeton University),'Modular Mahler measures.'T. Wooley (University of Michigan),'Diophantine problems in many variables: The role of additive number theory.'D. Zeilberger (Temple University),'Reverse engineering in combinatorics and number theory.'The papers in this volume provide an accurate picture of many of the topics presented at the conference including contributions from four of the plenary lectures.

One of the great successes of twentieth century mathematics has been the remarkable qualitative understanding of rational and integral points on curves, gleaned in part through the theorems of Mordell, Weil, Siegel, and Faltings. It has become clear that the study of rational and integral points has deep connections to other branches of mathematics: complex algebraic geometry, Galois and étale cohomology, transcendence theory and diophantine approximation, harmonic analysis, automorphic forms, and analytic number theory. This text, which focuses on higher dimensional varieties, provides precisely such an interdisciplinary view of the subject. It is a digest of research and survey papers by leading specialists; the book documents current knowledge in higher-dimensional arithmetic and gives indications for future research. It will be valuable not only to practitioners in the field, but to a wide audience of mathematicians and graduate students with an interest in arithmetic geometry.

View the abstract.

This book explores determinantal ideals of square matrices from the perspective of commutative algebra, with a particular emphasis on linear matrices. Its content has been extensively tested in several lectures given on various occasions, typically to audiences composed of commutative algebraists, algebraic geometers, and singularity theorists.Traditionally, texts on this topic showcase determinantal rings as the main actors, emphasizing their properties as algebras. This book follows a different path, exploring the role of the ideal theory of minors in various situations—highlighting the use of Fitting ideals, for example. Topics include an introduction to the subject, explaining matrices and their ideals of minors, as well as classical and recent bounds for codimension. This is followed by examples of algebraic varieties defined by such ideals. The book also explores properties of matrices that impact their ideals of minors, such as the 1-generic property, explicitly presenting a criterion by Eisenbud. Additionally, the authors address the problem of the degeneration of generic matrices and their ideals of minors, along with applications to the dual varieties of some of the ideals.Primarily intended for graduate students and scholars in the areas of commutative algebra, algebraic geometry, and singularity theory, the book can also be used in advanced seminars and as a source of aid. It is suitable for beginner graduate students who have completed a first course in commutative algebra.

This book provides a comprehensive and user-friendly exploration of the tremendous recent developments that reveal the connections between real algebraic geometry and optimization, two subjects that were usually taught separately until the beginning of the 21st century. Real algebraic geometry studies the solutions of polynomial equations and polynomial inequalities over the real numbers. Real algebraic problems arise in many applications, including science and engineering, computer vision, robotics, and game theory. Optimization is concerned with minimizing or maximizing a given objective function over a feasible set. Presenting key ideas from classical and modern concepts in real algebraic geometry, this book develops related convex optimization techniques for polynomial optimization. The connection to optimization invites a computational view on real algebraic geometry and opens doors to applications. Intended as an introduction for students of mathematics or related fields at an advanced undergraduate or graduate level, this book serves as a valuable resource for researchers and practitioners. Each chapter is complemented by a collection of beneficial exercises, notes on references, and further reading. As a prerequisite, only some undergraduate algebra is required.

This textbook provides an introduction to fundamental concepts of algebra at upper undergraduate to graduate level, covering the theory of rings, fields and modules, as well as the representation theory of finite groups.Throughout the book, the exposition relies on universal constructions, making systematic use of quotients and category theory — whose language is introduced in the first chapter. The book is divided into four parts. Parts I and II cover foundations of rings and modules, field theory and generalities on finite group representations, insisting on rings of polynomials and their ideals. Part III culminates in the structure theory of finitely generated modules over Dedekind domains and its applications to abelian groups, linear maps, and foundations of algebraic number theory. Part IV is an extensive study of linear representations of finite groups over fields of characteristic zero, including graded representations and graded characters as well as a final chapter on the Drinfeld–Lusztig double of a group algebra, appearing for the first time in a textbook at this level.Based on over twenty years of teaching various aspects of algebra, mainly at the École Normale Supérieure (Paris) and at Peking University, the book reflects the audiences of the author's courses. In particular, foundations of abstract algebra, like linear algebra and elementary group theory, are assumed of the reader. Each of the of four parts can be used for a course — with a little ad hoc complement on the language of categories. Thanks to its rich choice of topics, the book can also serve students as a reference throughout their studies, from undergraduate to advanced graduate level.

Many applications, including computer vision, computer arithmetic, deep learning, entanglement in quantum information, graph theory and energy networks, can be successfully tackled within the framework of polynomial optimization, an emerging field with growing research efforts in the last two decades. One key advantage of these techniques is their ability to model a wide range of problems using optimization formulations. Polynomial optimization heavily relies on the moment-sums of squares (moment-SOS) approach proposed by Lasserre, which provides certificates for positive polynomials. On the practical side, however, there is'no free lunch'and such optimization methods usually encompass severe scalability issues. Fortunately, for many applications, including the ones formerly mentioned, we can look at the problem in the eyes and exploit the inherent data structure arising from the cost and constraints describing the problem.This book presents several research efforts to resolve this scientific challenge with important computational implications. It provides the development of alternative optimization schemes that scale well in terms of computational complexity, at least in some identified class of problems. It also features a unified modeling framework to handle a wide range of applications involving both commutative and noncommutative variables, and to solve concretely large-scale instances. Readers will find a practical section dedicated to the use of available open-source software libraries.This interdisciplinary monograph is essential reading for students, researchers and professionals interested in solving optimization problems with polynomial input data.

This book is a concrete introduction to abstract algebra and number theory. Starting from the basics, it develops the rich parallels between the integers and polynomials, covering topics such as Unique Factorization, arithmetic over quadratic number fields, the RSA encryption scheme, and finite fields. In addition to introducing students to the rigorous foundations of mathematical proofs, the authors cover several specialized topics, giving proofs of the Fundamental Theorem of Algebra, the transcendentality of $e$, and Quadratic Reciprocity Law. The book is aimed at incoming undergraduate students with a strong passion for mathematics.

This book is aimed to undergraduate STEM majors and to researchers using ordinary differential equations. It covers a wide range of STEM-oriented differential equation problems that can be solved using computational power series methods. Many examples are illustrated with figures and each chapter ends with discovery/research questions most of which are accessible to undergraduate students, and almost all of which may be extended to graduate level research. Methodologies implemented may also be useful for researchers to solve their differential equations analytically or numerically. The textbook can be used as supplementary for undergraduate coursework, graduate research, and for independent study.

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution.This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question.This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in theseproofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

Working out solutions to polynomial equations is a mathematical problem that dates from antiquity. Galois developed a theory in which the obstacle to solving a polynomial equation is an associated collection of symmetries. Obtaining a root requires'breaking'that symmetry. When the degree of an equation is at least five, Galois Theory established that there is no formula for the solutions like those found in lower degree cases. However, this negative result doesn't mean that the practice of equation-solving ends. In a recent breakthrough, Doyle and McMullen devised a solution to the fifth-degree equation that uses geometry, algebra, and dynamics to exploit icosahedral symmetry.Polynomials, Dynamics, and Choice: The Price We Pay for Symmetry is organized in two parts, the first of which develops an account of polynomial symmetry that relies on considerations of algebra and geometry. The second explores beyond polynomials to spaces consisting of choices ranging from mundane decisions to evolutionary algorithms that search for optimal outcomes. The two algorithms in Part I provide frameworks that capture structural issues that can arise in deliberative settings. While decision-making has been approached in mathematical terms, the novelty here is in the use of equation-solving algorithms to illuminate such problems.Features Treats the topic—familiar to many—of solving polynomial equations in a way that's dramatically different from what they saw in school Accessible to a general audience with limited mathematical background Abundant diagrams and graphics.

This book uses algebraic tools to study the elementary properties of classes of fields and related algorithmic problems. The first part covers foundational material on infinite Galois theory, profinite groups, algebraic function fields in one variable and plane curves. It provides complete and elementary proofs of the Chebotarev density theorem and the Riemann hypothesis for function fields, together with material on ultraproducts, decision procedures, the elementary theory of algebraically closed fields, undecidability and nonstandard model theory, including a nonstandard proof of Hilbert's irreducibility theorem. The focus then turns to the study of pseudo algebraically closed (PAC) fields, related structures and associated decidability and undecidability results. PAC fields (fields K with the property that every absolutely irreducible variety over K has a rational point) first arose in the elementary theory of finite fields and have deep connections with number theory.Thisfourth edition substantially extends, updates and clarifies the previous editions of this celebrated book, and includes a new chapter on Hilbertian subfields of Galois extensions. Almost every chapter concludes with a set of exercises and bibliographical notes. An appendix presents a selection of open research problems. Drawing from a wide literature at the interface of logic and arithmetic, this detailed and self-contained text can serve both as a textbook for graduate courses and as an invaluable reference for seasoned researchers.

This volume gives an up-to-date review of the subject Integration in Finite Terms. The book collects four significant texts together with an extensive bibliography and commentaries discussing these works and their impact. These texts, either out of print or never published before, are fundamental to the subject of the book. Applications in combinatorics and physics have aroused a renewed interest in this well-developed area devoted to finding solutions of differential equations and, in particular, antiderivatives, expressible in terms of classes of elementary and special functions.

The Tutte Polynomial touches on nearly every area of combinatorics as well as many other fields, including statistical mechanics, coding theory, and DNA sequencing. It is one of the most studied graph polynomials.Handbook of the Tutte Polynomial and Related Topics is the first handbook published on the Tutte Polynomial. It consists of thirty-four chapters written by experts in the field, which collectively offer a concise overview of the polynomial's many properties and applications. Each chapter covers a different aspect of the Tutte polynomial and contains the central results and references for its topic. The chapters are organized into six parts. Part I describes the fundamental properties of the Tutte polynomial, providing an overview of the Tutte polynomial and the necessary background for the rest of the handbook. Part II is concerned with questions of computation, complexity, and approximation for the Tutte polynomial; Part III covers a selection of related graph polynomials; Part IV discusses a range of applications of the Tutte polynomial to mathematics, physics, and biology; Part V includes various extensions and generalizations of the Tutte polynomial; and Part VI provides a history of the development of the Tutte polynomial.Features Written in an accessible style for non-experts, yet extensive enough for experts Serves as a comprehensive and accessible introduction to the theory of graph polynomials for researchers in mathematics, physics, and computer science Provides an extensive reference volume for the evaluations, theorems, and properties of the Tutte polynomial and related graph, matroid, and knot invariants Offers broad coverage, touching on the wide range of applications of the Tutte polynomial and its various specializations

This book provides an introduction to fundamental methods and techniques of algebra over ordered fields. It is a revised and updated translation of the classic textbook Einführung in die reelle Algebra. Beginning with the basics of ordered fields and their real closures, the book proceeds to discuss methods for counting the number of real roots of polynomials. Followed by a thorough introduction to Krull valuations, this culminates in Artin's solution of Hilbert's 17th Problem. Next, the fundamental concept of the real spectrum of a commutative ring is introduced with applications. The final chapter gives a brief overview of important developments in real algebra and geometry—as far as they are directly related to the contents of the earlier chapters—since the publication of the original German edition. Real Algebra is aimed at advanced undergraduate and beginning graduate students who have a good grounding in linear algebra, field theory and ring theory. It also provides a carefully written reference for specialists in real algebra, real algebraic geometry and related fields.

The interface between Physics and Mathematics has been increasingly spotlighted by the discovery of algebraic, geometric, and topological properties in physical phenomena. A profound example is the relation of noncommutative geometry, arising from algebras in mathematics, to the so-called quantum groups in the physical viewpoint. Two apparently unrelated puzzles — the solubility of some lattice models in statistical mechanics and the integrability of differential equations for special problems — are encoded in a common algebraic condition, the Yang-Baxter equation. This backdrop motivates the subject of this book, which reveals Knot Theory as a highly intuitive formalism that is intimately connected to Quantum Field Theory and serves as a basis to String Theory.This book presents a didactic approach to knots, braids, links, and polynomial invariants which are powerful and developing techniques that rise up to the challenges in String Theory, Quantum Field Theory, and Statistical Physics. It introduces readers to Knot Theory and its applications through formal and practical (computational) methods, with clarity, completeness, and minimal demand of requisite knowledge on the subject. As a result, advanced undergraduates in Physics, Mathematics, or Engineering, will find this book an excellent and self-contained guide to the algebraic, geometric, and topological tools for advanced studies in theoretical physics and mathematics.

New mathematical research in arithmetic dynamicsIn The Arithmetic of Polynomial Dynamical Pairs, Charles Favre and Thomas Gauthier present new mathematical research in the field of arithmetic dynamics. Specifically, the authors study one-dimensional algebraic families of pairs given by a polynomial with a marked point. Combining tools from arithmetic geometry and holomorphic dynamics, they prove an “unlikely intersection” statement for such pairs, thereby demonstrating strong rigidity features for them. They further describe one-dimensional families in the moduli space of polynomials containing infinitely many postcritically finite parameters, proving the dynamical André-Oort conjecture for curves in this context, originally stated by Baker and DeMarco.This is a reader-friendly invitation to a new and exciting research area that brings together sophisticated tools from many branches of mathematics.

This book develops integral identities, mostly involving multidimensional functions and infinite limits of integration, whose evaluations are intractable by common means. It exposes a methodology based on the multivariate power substitution and its variants, assisted by the software tool Mathematica. The approaches introduced comprise the generalized method of exhaustion, the multivariate power substitution and its variants, and the use of permutation symmetry to evaluate definite integrals, which are very important both in their own right, and as necessary intermediate steps towards more involved computation.A key tenet is that such approaches work best when applied to integrals having certain characteristics as a starting point. Most integrals, if used as a starting point, will lead to no result at all, or will lead to a known result. However, there is a special class of integrals (i.e., innovative integrals) which, if used as a starting point for such approaches, willlead to new and useful results, and can also enable the reader to generate many other new results that are not in the book.The reader will find a myriad of novel approaches for evaluating integrals, with a focus on tools such as Mathematica as a means of obtaining useful results, and also checking whether they are already known. Results presented involve the gamma function, the hypergeometric functions, the complementary error function, the exponential integral function, the Riemann zeta function, and others that will be introduced as they arise. The book concludes with selected engineering applications, e.g., involving wave propagation, antenna theory, non-Gaussian and weighted Gaussian distributions, and other areas.The intended audience comprises junior and senior sciences majors planning to continue in the pure and applied sciences at the graduate level, graduate students in mathematics and the sciences, and junior and established researchers in mathematicalphysics, engineering, and mathematics. Indeed, the pedagogical inclination of the exposition will have students work out, understand, and efficiently use multidimensional integrals from first principles.

This collection of essays aims to promote constructive mathematics, not by defining it or formalizing it, but by practicing it. All definitions and proofs are based on finite algorithms, which pave illuminating paths to nontrivial results, primarily in algebra, number theory, and the theory of algebraic curves. The second edition adds a new set of essays that reflect and expand upon the first. The topics covered derive from classic works of nineteenth-century mathematics, among them Galois's theory of algebraic equations, Gauss's theory of binary quadratic forms, and Abel's theorems about integrals of rational differentials on algebraic curves. Other topics include Newton's diagram, the fundamental theorem of algebra, factorization of polynomials over constructive fields, and the spectral theorem for symmetric matrices, all treated using constructive methods in the spirit of Kronecker. In this second edition, the essays of the first edition are augmented with newessays that give deeper and more complete accounts of Galois's theory, points on an algebraic curve, and Abel's theorem. Readers will experience the full power of Galois's approach to solvability by radicals, learn how to construct points on an algebraic curve using Newton's diagram, and appreciate the amazing ideas introduced by Abel in his 1826 Paris memoir on transcendental functions. Mathematical maturity is required of the reader, and some prior knowledge of Galois theory is helpful. But experience with constructive mathematics is not necessary; readers should simply be willing to set aside abstract notions of infinity and explore deep mathematics via explicit constructions.

Besides their well-known value in number theory, continued fractions are also a useful tool in modern numerical applications and computer science. The goal of the book is to revisit the almost forgotten classical theory and to contextualize it for contemporary numerical applications and signal processing, thus enabling students and scientist to apply classical mathematics on recent problems. The books tries to be mostly self-contained and to make the material accessible for all interested readers. This provides a new view from an applied perspective, combining the classical recursive techniques of continued fractions with orthogonal problems, moment problems, Prony's problem of sparse recovery and the design of stable rational filters, which are all connected by continued fractions.

Galois theory is the culmination of a centuries-long search for a solution to the classical problem of solving algebraic equations by radicals. In this book, Bewersdorff follows the historical development of the theory, emphasizing concrete examples along the way. As a result, many mathematical abstractions are now seen as the natural consequence of particular investigations. Few prerequisites are needed beyond general college mathematics, since the necessary ideas and properties of groups and fields are provided as needed. Results in Galois theory are formulated first in a concrete, elementary way, then in the modern form. Each chapter begins with a simple question that gives the reader an idea of the nature and difficulty of what lies ahead. The applications of the theory to geometric constructions, including the ancient problems of squaring the circle, duplicating the cube, and trisecting the angle, and the construction of regular $n$-gons are also presented. This new edition contains an additional chapter as well as twenty facsimiles of milestones of classical algebra. It is suitable for undergraduates and graduate students, as well as teachers and mathematicians seeking a historical and stimulating perspective on the field.

This book carefully presents a unified treatment of equivariant Poincaré duality in a wide variety of contexts, illuminating an area of mathematics that is often glossed over elsewhere. The approach used here allows the parallel treatment of both equivariant and nonequivariant cases. It also makes it possible to replace the usual field of coefficients for cohomology, the field of real numbers, with any field of arbitrary characteristic, and hence change (equivariant) de Rham cohomology to the usual singular (equivariant) cohomology. The book will be of interest to graduate students and researchers wanting to learn about the equivariant extension of tools familiar from non-equivariant differential geometry.

The classical exponential polynomials, today commonly named after E.,T. Bell, have a wide range of remarkable applications in Combinatorics, Algebra, Analysis, and Mathematical Physics. Within the algebraic framework presented in this book they appear as structural coefficients in finite expansions of certain higher-order derivative operators. In this way, a correspondence between polynomials and functions is established, which leads (via compositional inversion) to the specification and the effective computation of orthogonal companions of the Bell polynomials. Together with the latter, one obtains the larger class of multivariate `Stirling polynomials'. Their fundamental recurrences and inverse relations are examined in detail and shown to be directly related to corresponding identities for the Stirling numbers. The following topics are also covered: polynomial families that can be represented by Bell polynomials; inversion formulas, in particular of Schlömilch-Schläfli type; applications to binomial sequences; new aspects of the Lagrange inversion, and, as a highlight, reciprocity laws, which unite a polynomial family and that of orthogonal companions. Besides a Mathematica(R) package and an extensive bibliography, additional material is compiled in a number of notes and supplements.

This book provides a broad, interdisciplinary overview of non-Archimedean analysis and its applications. Featuring new techniques developed by leading experts in the field, it highlights the relevance and depth of this important area of mathematics, in particular its expanding reach into the physical, biological, social, and computational sciences as well as engineering and technology.In the last forty years the connections between non-Archimedean mathematics and disciplines such as physics, biology, economics and engineering, have received considerable attention. Ultrametric spaces appear naturally in models where hierarchy plays a central role – a phenomenon known as ultrametricity. In the 80s, the idea of using ultrametric spaces to describe the states of complex systems, with a natural hierarchical structure, emerged in the works of Fraunfelder, Parisi, Stein and others. A central paradigm in the physics of certain complex systems – for instance,proteins – asserts that the dynamics of such a system can be modeled as a random walk on the energy landscape of the system. To construct mathematical models, the energy landscape is approximated by an ultrametric space (a finite rooted tree), and then the dynamics of the system is modeled as a random walk on the leaves of a finite tree. In the same decade, Volovich proposed using ultrametric spaces in physical models dealing with very short distances. This conjecture has led to a large body of research in quantum field theory and string theory. In economics, the non-Archimedean utility theory uses probability measures with values in ordered non-Archimedean fields. Ultrametric spaces are also vital in classification and clustering techniques. Currently, researchers are actively investigating the following areas: p-adic dynamical systems, p-adic techniques in cryptography, p-adic reaction-diffusion equations and biological models, p-adic models in geophysics, stochastic processes in ultrametric spaces, applications of ultrametric spaces in data processing, and more. This contributed volume gathers the latest theoretical developments as well as state-of-the art applications of non-Archimedean analysis. It covers non-Archimedean and non-commutative geometry, renormalization, p-adic quantum field theory and p-adic quantum mechanics, as well as p-adic string theory and p-adic dynamics. Further topics include ultrametric bioinformation, cryptography and bioinformatics in p-adic settings, non-Archimedean spacetime, gravity and cosmology, p-adic methods in spin glasses, and non-Archimedean analysis of mental spaces. By doing so, it highlights new avenues of research in the mathematical sciences, biosciences and computational sciences.

This book addresses the global study of finite and infinite singularities of planar polynomial differential systems, with special emphasis on quadratic systems. While results covering the degenerate cases of singularities of quadratic systems have been published elsewhere, the proofs for the remaining harder cases were lengthier. This book covers all cases, with half of the content focusing on the last non-degenerate ones.The book contains the complete bifurcation diagram, in the 12-parameter space, of global geometrical configurations of singularities of quadratic systems. The authors'results provide - for the first time - global information on all singularities of quadratic systems in invariant form and their bifurcations. In addition, a link to a very helpful software package is included. With the help of this software, the study of the algebraic bifurcations becomes much more efficient and less time-consuming.Given its scope, the book will appeal to specialists on polynomial differential systems, pure and applied mathematicians who need to study bifurcation diagrams of families of such systems, Ph.D. students, and postdoctoral fellows.

New Numerical Scheme with Newton Polynomial: Theory, Methods, and Applications provides a detailed discussion on the underpinnings of the theory, methods and real-world applications of this numerical scheme. The book's authors explore how this efficient and accurate numerical scheme is useful for solving partial and ordinary differential equations, as well as systems of ordinary and partial differential equations with different types of integral operators. Content coverage includes the foundational layers of polynomial interpretation, Lagrange interpolation, and Newton interpolation, followed by new schemes for fractional calculus. Final sections include six chapters on the application of numerical scheme to a range of real-world applications. Over the last several decades, many techniques have been suggested to model real-world problems across science, technology and engineering. New analytical methods have been suggested in order to provide exact solutions to real-world problems. Many real-world problems, however, cannot be solved using analytical methods. To handle these problems, researchers need to rely on numerical methods, hence the release of this important resource on the topic at hand. Offers an overview of the field of numerical analysis and modeling real-world problems Provides a deeper understanding and comparison of Adams-Bashforth and Newton polynomial numerical methods Presents applications of local fractional calculus to a range of real-world problems Explores new scheme for fractal functions and investigates numerical scheme for partial differential equations with integer and non-integer order Includes codes and examples in MATLAB in all relevant chapters

This proceedings volume presents selected, peer-reviewed contributions from the 26th National School on Algebra, which was held in Constanța, Romania, on August 26-September 1, 2018. The works cover three fields of mathematics: algebra, geometry and discrete mathematics, discussing the latest developments in the theory of monomial ideals, algebras of graphs and local positivity of line bundles. Whereas interactions between algebra and geometry go back at least to Hilbert, the ties to combinatorics are much more recent and are subject of immense interest at the forefront of contemporary mathematics research. Transplanting methods between different branches of mathematics has proved very fruitful in the past – for example, the application of fixed point theorems in topology to solving nonlinear differential equations in analysis. Similarly, combinatorial structures, e.g., Newton-Okounkov bodies, have led to significant advances in our understanding of the asymptotic propertiesof line bundles in geometry and multiplier ideals in algebra.This book is intended for advanced graduate students, young scientists and established researchers with an interest in the overlaps between different fields of mathematics. A volume for the 24th edition of this conference was previously published with Springer under the title'Multigraded Algebra and Applications'(ISBN 978-3-319-90493-1).

The quadratic formula for the solution of quadratic equations was discovered independently by scholars in many ancient cultures and is familiar to everyone. Less well known are formulas for solutions of cubic and quartic equations whose discovery was the high point of 16th century mathematics. Their study forms the heart of this book, as part of the broader theme that a polynomial's coefficients can be used to obtain detailed information on its roots. The book is designed for self-study, with many results presented as exercises and some supplemented by outlines for solution. The intended audience includes in-service and prospective secondary mathematics teachers, high school students eager to go beyond the standard curriculum, undergraduates who desire an in-depth look at a topic they may have unwittingly skipped over, and the mathematically curious who wish to do some work to unlock the mysteries of this beautiful subject.

The French expression “dessins d'enfants” means children's drawings. This term was coined by the great French mathematician Alexandre Grothendieck in order to denominate a method of pictorial representation of some highly interesting classes of polynomials and rational functions. The polynomials studied in this book take their origin in number theory. The authors show how, by drawing simple pictures, one can prove some long-standing conjectures and formulate new ones. The theory presented here touches upon many different fields of mathematics. The major part of the book is quite elementary and is easily accessible to an undergraduate student. The less elementary parts, such as Galois theory or group representations and their characters, would need a more profound knowledge of mathematics. The reader may either take the basic facts of these theories for granted or use our book as a motivation and a first approach to these subjects.

This volume is based on lectures delivered at the 2019 AMS Short Course “Sum of Squares: Theory and Applications”, held January 14–15, 2019, in Baltimore, Maryland. This book provides a concise state-of-the-art overview of the theory and applications of polynomials that are sums of squares. This is an exciting and timely topic, with rich connections to many areas of mathematics, including polynomial and semidefinite optimization, real and convex algebraic geometry, and theoretical computer science. The six chapters introduce and survey recent developments in this area; specific topics include the algebraic and geometric aspects of sums of squares and spectrahedra, lifted representations of convex sets, and the algorithmic and computational implications of viewing sums of squares as a meta algorithm. The book also showcases practical applications of the techniques across a variety of areas, including control theory, statistics, finance and machine learning.

The so-called “pinched disk” model of the Mandelbrot set is due to A. Douady, J. H. Hubbard and W. P. Thurston. It can be described in the language of geodesic laminations. The combinatorial model is the quotient space of the unit disk under an equivalence relation that, loosely speaking, “pinches” the disk in the plane (whence the name of the model). The significance of the model lies in particular in the fact that this quotient is planar and therefore can be easily visualized. The conjecture that the Mandelbrot set is actually homeomorphic to this model is equivalent to the celebrated MLC conjecture stating that the Mandelbrot set is locally connected. For parameter spaces of higher degree polynomials no combinatorial model is known. One possible reason may be that the higher degree analog of the MLC conjecture is known to be false. The authors investigate to which extent a geodesic lamination is determined by the location of its critical sets and when different choices of critical sets lead to essentially the same lamination. This yields models of various parameter spaces of laminations similar to the “pinched disk” model of the Mandelbrot set.

The authors prove an elementary recursive bound on the degrees for Hilbert's 17th problem. More precisely they express a nonnegative polynomial as a sum of squares of rational functions and obtain as degree estimates for the numerators and denominators the following tower of five exponentials 2^{ 2^{ 2^{d^{4^{k}}} } } where $d$ is the number of variables of the input polynomial. The authors'method is based on the proof of an elementary recursive bound on the degrees for Stengle's Positivstellensatz. More precisely the authors give an algebraic certificate of the emptyness of the realization of a system of sign conditions and obtain as degree bounds for this certificate a tower of five exponentials, namely 2^{ 2^{\left(2^{\max\{2,d\}^{4^{k}}}+ s^{2^{k}}\max\{2, d\}^{16^{k}{\mathrm bit}(d)} \right)} } where $d$ is a bound on the degrees, $s$ is the number of polynomials and $k$ is the number of variables of the input polynomials.

This book discusses basic topics in the spectral theory of dynamical systems. It also includes two advanced theorems, one by H. Helson and W. Parry, and another by B. Host. Moreover, Ornstein's family of mixing rank-one automorphisms is given with construction and proof. Systems of imprimitivity and their relevance to ergodic theory are also examined. Baire category theorems of ergodic theory, scattered in literature, are discussed in a unified way in the book. Riesz products are introduced and applied to describe the spectral types and eigenvalues of rank-one automorphisms. Lastly, the second edition includes a new chapter “Calculus of Generalized Riesz Products”, which discusses the recent work connecting generalized Riesz products, Hardy classes, Banach's problem of simple Lebesgue spectrum in ergodic theory and flat polynomials.

This monograph provides a self-contained presentation of the foundations of finite fields, including a detailed treatment of their algebraic closures. It also covers important advanced topics which are not yet found in textbooks: the primitive normal basis theorem, the existence of primitive elements in affine hyperplanes, and the Niederreiter method for factoring polynomials over finite fields.We give streamlined and/or clearer proofs for many fundamental results and treat some classical material in an innovative manner. In particular, we emphasize the interplay between arithmetical and structural results, and we introduce Berlekamp algebras in a novel way which provides a deeper understanding of Berlekamp's celebrated factorization algorithm.The book provides a thorough grounding in finite field theory for graduate students and researchers in mathematics. In view of its emphasis on applicable and computational aspects, it is also useful for readers working in information and communication engineering, for instance, in signal processing, coding theory, cryptography or computer science.

This book presents original peer-reviewed contributions from the London Mathematical Society (LMS) Midlands Regional Meeting and Workshop on'Galois Covers, Grothendieck-Teichmüller Theory and Dessinsd'Enfants', which took place at the University of Leicester, UK, from 4 to 7 June, 2018. Within the theme of the workshop, the collected articles cover a broad range of topics and explore exciting new links between algebraic geometry, representation theory, group theory, number theory and algebraic topology. The book combines research and overview articles by prominent international researchers and provides a valuable resource for researchers and students alike.