Representation Theory of Symmetric Groups is the most up-to-date abstract algebra book on the subject of symmetric groups and representation theory. Utilizing new research and results, this book can be studied from a combinatorial, algorithmic or algebraic viewpoint. This book is an excellent way of introducing today's students to representation theory of the symmetric groups, namely classical theory. From there, the book explains how the theory can be extended to other related combinatorial algebras like the Iwahori-Hecke algebra. In a clear and concise manner, the author presents the case that most calculations on symmetric group can be performed by utilizing appropriate algebras of functions. Thus, the book explains how some Hopf algebras (symmetric functions and generalizations) can be used to encode most of the combinatorial properties of the representations of symmetric groups. Overall, the book is an innovative introduction to representation theory of symmetric groups for graduate students and researchers seeking new ways of thought.

Proceedings of the NATO Advanced Study Institute, Calgary, Canada, August 26-September 2, 1978

A general class of powerful and flexible modeling techniques, spline smoothing has attracted a great deal of research attention in recent years and has been widely used in many application areas, from medicine to economics. Smoothing Splines: Methods and Applications covers basic smoothing spline models, including polynomial, periodic, spherical, thin-plate, L-, and partial splines, as well as more advanced models, such as smoothing spline ANOVA, extended and generalized smoothing spline ANOVA, vector spline, nonparametric nonlinear regression, semiparametric regression, and semiparametric mixed-effects models. It also presents methods for model selection and inference. The book provides unified frameworks for estimation, inference, and software implementation by using the general forms of nonparametric/semiparametric, linear/nonlinear, and fixed/mixed smoothing spline models. The theory of reproducing kernel Hilbert space (RKHS) is used to present various smoothing spline models in a unified fashion. Although this approach can be technical and difficult, the author makes the advanced smoothing spline methodology based on RKHS accessible to practitioners and students. He offers a gentle introduction to RKHS, keeps theory at a minimum level, and explains how RKHS can be used to construct spline models. Smoothing Splines offers a balanced mix of methodology, computation, implementation, software, and applications. It uses R to perform all data analyses and includes a host of real data examples from astronomy, economics, medicine, and meteorology. The codes for all examples, along with related developments, can be found on the book's web page.

All modern books on Einstein emphasize the genius of his relativity theory and the corresponding corrections and extensions of the ancient space-time concept. However, Einstein s opposition to the use of probability in the laws of nature and particularly in the laws of quantum mechanics is criticized and often portrayed as outdated.

The author of Einstein Was Right takes a different view and shows that Einstein created a "Trojan horse" ready to unleash forces against the use of probability as a basis for the laws of nature. Einstein warned that the use of probability would, in the final analysis, lead to "spooky" actions and mysterious instantaneous influences at a distance.

John Bell pulled Einstein s Trojan horse into the castle of physics. He developed a theory that, together with experimental results of Aspect, Zeilinger, and others, "proves" the existence of quantum non-localities, instantaneous influences. These have indeed the nature of what Einstein labeled as "spooky."

The book Einstein Was Right shows that Bell was not aware of the special role that time and space-time play in any rigorous probability theory. As a consequence, his formalism is not general enough to be applied to the Aspect-Zeilinger type of experiments and his conclusions about the existence of instantaneous influences at a distance are incorrect.

This fact suggests a world view that is less optimistic about claims that teleportation and influences at a distance could open new horizons and provide the possibility of quantum computing. On the positive side, however, and as compensation, we are assured that the space-time picture of mankind developed over millions of years and perfected by Einstein, is still able to cope with the phenomena that nature presents us on the atomic and sub-atomic level and that the "quantum weirdness" may be explainable and understandable after all. "

Using basic category theory, this Element describes all the central concepts and proves the main theorems of theoretical computer science. Category theory, which works with functions, processes, and structures, is uniquely qualified to present the fundamental results of theoretical computer science. In this Element, readers will meet some of the deepest ideas and theorems of modern computers and mathematics, such as Turing machines, unsolvable problems, the P=NP question, Kurt Goedel's incompleteness theorem, intractable problems, cryptographic protocols, Alan Turing's Halting problem, and much more. The concepts come alive with many examples and exercises.

Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

The book is a research monograph on the notions of truth and assertibility as they relate to the foundations of mathematics. It is aimed at a general mathematical and philosophical audience. The central novelty is an axiomatic treatment of the concept of assertibility. This provides us with a device that can be used to handle difficulties that have plagued philosophical logic for over a century. Two examples relate to Frege's formulation of second-order logic and Tarski's characterization of truth predicates for formal languages. Both are widely recognized as fundamental advances, but both are also seen as being seriously flawed: Frege's system, as Russell showed, is inconsistent, and Tarski's definition fails to capture the compositionality of truth. A formal assertibility predicate can be used to repair both problems. The repairs are technically interesting and conceptually compelling. The approach in this book will be of interest not only for the uses the author has put it to, but also as a flexible tool that may have many more applications in logic and the foundations of mathematics.

This book introduces ten problem-solving strategies by first presenting the strategy and then applying it to problems in elementary mathematics. In doing so, first the common approach is shown, and then a more elegant strategy is provided. Elementary mathematics is used so that the reader can focus on the strategy and not be distracted by some more sophisticated mathematics.

Mathematical Recreations from the Tournament of the Towns contains the complete list of problems and solutions to the International Mathematics Tournament of the Towns from Fall 2007 to Spring 2021. The primary audience for this book is the army of recreational mathematicians united under the banner of Martin Gardner. It should also have great value to students preparing for mathematics competitions and trainers of such students. This book also provides an entry point for students in upper elementary schools. Features Huge recreational value to mathematics enthusiasts Accessible to upper-level high school students Problems classified by topics such as two-player games, weighing problems, mathematical tasks etc.

This book introduces ten problem-solving strategies by first presenting the strategy and then applying it to problems in elementary mathematics. In doing so, first the common approach is shown, and then a more elegant strategy is provided. Elementary mathematics is used so that the reader can focus on the strategy and not be distracted by some more sophisticated mathematics.

The heart of mathematics is its elegance; the way it all fits together. Unfortunately, its beauty often eludes the vast majority of people who are intimidated by fear of the difficulty of numbers. Mathematical Elegance remedies this. Using hundreds of examples, the author presents a view of the mathematical landscape that is both accessible and fascinating.

At a time of concern that American youth are bored by math, there is renewed interest in improving math skills. Mathematical Elegance stimulates students, along with those already experienced in the discipline, to explore some of the unexpected pleasures of quantitative thinking. Invoking mathematical proofs famous for their simplicity and brainteasers that are fun and illuminating, the author leaves readers feeling exuberant--as well as convinced that their IQs have been raised by ten points.

A host of anecdotes about well-known mathematicians humanize and provide new insights into their lofty subjects. Recalling such classic works as Lewis Carroll's Introduction to Logic and A Mathematician Reads the Newspaper by John Allen Paulos, Mathematical Elegance will energize and delight a wide audience, ranging from intellectually curious students to the enthusiastic general reader.

This book gathers together a colorful set of problems on classical Mathematical Logic, selected from over 30 years of teaching. The initial chapters start with problems from supporting fields, like set theory (ultrafilter constructions), full-information game theory (strategies), automata, and recursion theory (decidability, Kleene's theorems). The work then advances toward propositional logic (compactness and completeness, resolution method), followed by first-order logic, including quantifier elimination and the Ehrenfeucht- Fraisse game; ultraproducts; and examples for axiomatizability and non-axiomatizability. The Arithmetic part covers Robinson's theory, Peano's axiom system, and Goedel's incompleteness theorems. Finally, the book touches universal graphs, tournaments, and the zero-one law in Mathematical Logic. Instructors teaching Mathematical Logic, as well as students who want to understand its concepts and methods, can greatly benefit from this work. The style and topics have been specially chosen so that readers interested in the mathematical content and methodology could follow the problems and prove the main theorems themselves, including Goedel's famous completeness and incompleteness theorems. Examples of applications on axiomatizability and decidability of numerous mathematical theories enrich this volume.

This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees.The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.

During his lifetime, Kurt Goedel was not well known outside the professional world of mathematicians, philosophers and theoretical physicists. Early in his career, for his doctoral thesis and then for his Habilitation (Dr.Sci.), he wrote earthshaking articles on the completeness and provability of mathematical-logical systems, upsetting the hypotheses of the most famous mathematicians/philosophers of the time. He later delved into theoretical physics, finding a unique solution to Einstein's equations for gravity, the 'Goedel Universe', and made contributions to philosophy, the guiding theme of his life. This book includes more details about the context of Goedel's life than are found in earlier biographies, while avoiding an elaborate treatment of his mathematical/scientific/philosophical works, which have been described in great detail in other books. In this way, it makes him and his times more accessible to general readers, and will allow them to appreciate the lasting effects of Goedel's contributions (the latter in a more up-to-date context than in previous biographies, many of which were written 15-25 years ago). His work spans or is relevant to a wide spectrum of intellectual endeavor, and this is emphasized in the book, with recent examples. This biography also examines possible sources of his unusual personality, which combined mathematical genius with an almost childlike naivete concerning everyday life, and striking scientific innovations with timidity and hesitancy in practical matters. How he nevertheless had a long and successful career, inspiring many younger scholars along the way, with the help of his loyal wife Adele and some of his friends, is a fascinating story in human nature.

An Introduction to Mathematical Proofs presents fundamental material on logic, proof methods, set theory, number theory, relations, functions, cardinality, and the real number system. The text uses a methodical, detailed, and highly structured approach to proof techniques and related topics. No prerequisites are needed beyond high-school algebra. New material is presented in small chunks that are easy for beginners to digest. The author offers a friendly style without sacrificing mathematical rigor. Ideas are developed through motivating examples, precise definitions, carefully stated theorems, clear proofs, and a continual review of preceding topics. Features Study aids including section summaries and over 1100 exercises Careful coverage of individual proof-writing skills Proof annotations and structural outlines clarify tricky steps in proofs Thorough treatment of multiple quantifiers and their role in proofs Unified explanation of recursive definitions and induction proofs, with applications to greatest common divisors and prime factorizations About the Author: Nicholas A. Loehr is an associate professor of mathematics at Virginia Technical University. He has taught at College of William and Mary, United States Naval Academy, and University of Pennsylvania. He has won many teaching awards at three different schools. He has published over 50 journal articles. He also authored three other books for CRC Press, including Combinatorics, Second Edition, and Advanced Linear Algebra.

This is an introduction to a flexible tool for use in strategic management within a competitive environment. Based upon ideas from both graph theory and game theory, the method offers several distinct advantages. It can handle a finite number of decision-makers, each of whom controls a number of actions. The graph model can describe and distinguish reversible and irreversible moves. Most importantly, the graph model forms a solid framework upon which solution concepts for describing human behaviour can be defined, assessed and compared This book is accompanied by a computer disk, which is explained and illustrated in the appendix. In addition, the text provides a summary of how to apply the graph model to practical problems Each chapter concludes with a set of problems, which serve to clarify important points and ensure comprehension

This book collects 13 papers that explore Wittgenstein's philosophy throughout the different stages of his career. The author writes from the viewpoint of critical rationalism. The tone of his analysis is friendly and appreciative yet critical. Of these papers, seven are on the background to the philosophy of Wittgenstein. Five papers examine different aspects of it: one on the philosophy of young Wittgenstein, one on his transitional period, and the final three on the philosophy of mature Wittgenstein, chiefly his Philosophical Investigations. The last of these papers, which serves as the concluding chapter, concerns the analytical school of philosophy that grew chiefly under its influence. Wittgenstein's posthumous Philosophical Investigations ignores formal languages while retaining the view of metaphysics as meaningless -- declaring that all languages are metaphysics-free. It was very popular in the middle of the twentieth century. Now it is passe. Wittgenstein had hoped to dissolve all philosophical disputes, yet he generated a new kind of dispute. His claim to have improved the philosophy of life is awkward just because he prevented philosophical discussion from the ability to achieve that: he cut the branch on which he was sitting. This, according to the author, is the most serious critique of Wittgenstein.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science.

The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their
interconnected themes challenge at the same time how we think of logic, philosophy and computation.

Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations.

This volume is based on the successful 6th China-Japan Seminar on number theory that was held in Shanghai Jiao Tong University in August 2011. It is a compilation of survey papers as well as original works by distinguished researchers in their respective fields. The topics range from traditional analytic number theory - additive problems, divisor problems, Diophantine equations - to elliptic curves and automorphic L-functions. It contains new developments in number theory and the topics complement the existing two volumes from the previous seminars which can be found in the same book series.

This volume, first published in 2000, presents a classical approach to the foundations and development of the geometry of vector fields, describing vector fields in three-dimensional Euclidean space, triply-orthogonal systems and applications in mechanics. Topics covered include Pfaffian forms, systems in n-dimensional space, and foliations and their Godbillion-Vey invariant. There is much interest in the study of geometrical objects in n-dimensional Euclidean space and this volume provides a useful and comprehensive presentation.

The subject of mathematics is not something distant, strange, and abstract that you can only learn about and often dislike in school. It is in everyday situations, such as housekeeping, communications, traffic, and weather reports. Taking you on a trip into the world of mathematics, Do I Count? Stories from Mathematics describes in a clear and captivating way the people behind the numbers and the places where mathematics is made.

Written by top scientist and engaging storyteller Gunter M. Ziegler and translated by Thomas von Foerster, the book presents mathematics and mathematicians in a manner that you have not previously encountered. It guides you on a scenic tour through the field, pointing out which beds were useful in constructing which theorems and which notebooks list the prizes for solving particular problems. Forgoing esoteric areas, the text relates mathematics to celebrities, history, travel, politics, science and technology, weather, clever puzzles, and the future.

• Can bees count?
• Is 13 bad luck?
• Are there equations for everything?
• What s the real practical value of the Pythagorean Theorem?
• Are there Sudoku puzzles with fewer than 17 entries and just one solution?
• Where and how do mathematicians work?
• Who invented proofs and why do we need them?
• Why is there no Nobel Prize for mathematics?
• What kind of life did Paul Erd s lead?

Find out the answers to these and other questions in this entertaining book of stories. You ll see that everyone counts, but no computation is needed."

This text consists of a sequence of problems which develop a variety of aspects in the field of semigroupsof operators. Many of the problems are not found easily in other books. Written in the Socratic/Moore method, this is a problem book without the answers presented. To get the most out of the content requires high motivation from the reader to work out the exercises. The reader is given the opportunity to discover important developments of the subject and to quickly arrive at the point of independent research. The compactness of the volume and the reputation of the author lends this consider set of problems to be a 'classic' in the making. This text is highly recommended for us as supplementary material for 3 graduate level courses.

Project Origami: Activities for Exploring Mathematics, Second Edition presents a flexible, discovery-based approach to learning origami-math topics. It helps readers see how origami intersects a variety of mathematical topics, from the more obvious realm of geometry to the fields of algebra, number theory, and combinatorics. With over 100 new pages, this updated and expanded edition now includes 30 activities and offers better solutions and teaching tips for all activities. The book contains detailed plans for 30 hands-on, scalable origami activities. Each activity lists courses in which the activity might fit, includes handouts for classroom use, and provides notes for instructors on solutions, how the handouts can be used, and other pedagogical suggestions. The handouts are also available on the book's CRC Press web page. Reflecting feedback from teachers and students who have used the book, this classroom-tested text provides an easy and entertaining way for teachers to incorporate origami into a range of college and advanced high school math courses. Visit the author's website for more information.