This book covers most of the known results on reducibility of polynomials over arbitrary fields, algebraically closed fields and finitely generated fields. Results valid only over finite fields, local fields or the rational field are not covered here, but several theorems on reducibility of polynomials over number fields that are either totally real or complex multiplication fields are included. Some of these results are based on recent work of E. Bombieri and U. Zannier (presented here by Zannier in an appendix). The book also treats other subjects like Ritt's theory of composition of polynomials, and properties of the Mahler measure, and it concludes with a bibliography of over 300 items. This unique work will be a necessary resource for all number theorists and researchers in related fields.

The series is aimed specifically at publishing peer reviewed reviews and contributions presented at workshops and conferences. Each volume is associated with a particular conference, symposium or workshop. These events cover various topics within pure and applied mathematics and provide up-to-date coverage of new developments, methods and applications.

Algebra and number theory have always been counted among the most beautiful mathematical areas with deep proofs and elegant results. However, for a long time they were not considered that important in view of the lack of real-life applications. This has dramatically changed: nowadays we find applications of algebra and number theory frequently in our daily life. This book focuses on the theory and algorithms for polynomials over various coefficient domains such as a finite field or ring. The operations on polynomials in the focus are factorization, composition and decomposition, basis computation for modules, etc. Algorithms for such operations on polynomials have always been a central interest in computer algebra, as it combines formal (the variables) and algebraic or numeric (the coefficients) aspects. The papers presented were selected from the Workshop on Computer Algebra and Polynomials, which was held in Linz at the Johann Radon Institute for Computational and Applied Mathematics (RICAM) during November 25-29, 2013, at the occasion of the Special Semester on Applications of Algebra and Number Theory.

Contributions by leading experts in the field provide a snapshot of current progress in polynomials and number theory.

New mathematical research in arithmetic dynamics In 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 is the first book to systematically state the fundamental theory of integrability and its development of ordinary differential equations with emphasis on the Darboux theory of integrability and local integrability together with their applications. It summarizes the classical results of Darboux integrability and its modern development together with their related Darboux polynomials and their applications in the reduction of Liouville and elementary integrabilty and in the center—focus problem, the weakened Hilbert 16th problem on algebraic limit cycles and the global dynamical analysis of some realistic models in fields such as physics, mechanics and biology. Although it can be used as a textbook for graduate students in dynamical systems, it is intended as supplementary reading for graduate students from mathematics, physics, mechanics and engineering in courses related to the qualitative theory, bifurcation theory and the theory of integrability of dynamical systems.

This major revision of Berstel and Perrin's classic Theory of Codes has been rewritten with a more modern focus and a much broader coverage of the subject. The concept of unambiguous automata, which is intimately linked with that of codes, now plays a significant role throughout the book, reflecting developments of the last 20 years. This is complemented by a discussion of the connection between codes and automata, and new material from the field of symbolic dynamics. The authors have also explored links with more practical applications, including data compression and cryptography. The treatment remains self-contained: there is background material on discrete mathematics, algebra and theoretical computer science. The wealth of exercises and examples make it ideal for self-study or courses. In summary, this is a comprehensive reference on the theory of variable-length codes and their relation to automata.

It is possible to associate a topological space to the category of modules over any ring. This space, the Ziegler spectrum, is based on the indecomposable pure-injective modules. Although the Ziegler spectrum arose within the model theory of modules and plays a central role in that subject, this book concentrates specifically on its algebraic aspects and uses. The central aim is to understand modules and the categories they form through associated structures and dimensions, which reflect the complexity of these, and similar, categories. The structures and dimensions considered arise particularly through the application of model-theoretic and functor-category ideas and methods. Purity and associated notions are central, localisation is an ever-present theme and various types of spectrum play organising roles. This book presents a unified, coherent account of material which is often presented from very different viewpoints and clarifies the relationships between these various approaches.

Aggregation is the process of combining several numerical values into a single representative value, and an aggregation function performs this operation. These functions arise wherever aggregating information is important: applied and pure mathematics (probability, statistics, decision theory, functional equations), operations research, computer science, and many applied fields (economics and finance, pattern recognition and image processing, data fusion, etc.). This is a comprehensive, rigorous and self-contained exposition of aggregation functions. Classes of aggregation functions covered include triangular norms and conorms, copulas, means and averages, and those based on nonadditive integrals. The properties of each method, as well as their interpretation and analysis, are studied in depth, together with construction methods and practical identification methods. Special attention is given to the nature of scales on which values to be aggregated are defined (ordinal, interval, ratio, bipolar). It is an ideal introduction for graduate students and a unique resource for researchers.

This book constitutes the refereed proceedings of the 9th International Workshop on Computer Algebra in Scientific Computing, CASC 2006. The book presents 25 revised full papers together with 2 invited papers, covering various expanding applications of computer algebra to scientific computing, the computer algebra systems themselves, and the CA algorithms. Topics addressed are studies in Gröbner bases, polynomial algebra, homological algebra, quantifier elimination, celestial mechanics, and more.