Franz Winkler – författare

The theory of Gröbner bases, invented by Bruno Buchberger, is a general method by which many fundamental problems in various branches of mathematics and engineering can be solved by structurally simple algorithms. The method is now available in all major mathematical software systems. This book provides a short and easy-to-read account of the theory of Gröbner bases and its applications. It is in two parts, the first consisting of tutorial lectures, beginning with a general introduction. The subject is then developed in a further twelve tutorials, written by leading experts, on the application of Gröbner bases in various fields of mathematics. In the second part are seventeen original research papers on Gröbner bases. An appendix contains the English translations of the original German papers of Bruno Buchberger in which Gröbner bases were introduced.

The book gives a thorough introduction to the mathematical underpinnings of computer algebra. The subjects treated range from arithmetic of integers and polynomials to fast factorization methods, Grobner bases, and algorithms in algebraic geometry. The algebraic background for all the algorithms presented in the book is fully described, and most of the algorithms are investigated with respect to their computational complexity. Each chapter closes with a brief survey of the related literature.

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Automated Deduction in Geometry, ADG 2002, held at Hagenberg Castle, Austria in September 2002.The 13 revised full papers presented were carefully selected during two rounds of reviewing and improvement. Among the issues addressed are theoretical and methodological topics, such as the resolution of singularities, algebraic geometry and computer algebra; various geometric theorem proving systems are explored; and applications of automated deduction in geometry are demonstrated in fields like computer-aided design and robotics.

This book constitutes the thoroughly refereed post-proceedings of the Second International Conference on Symbolic and Numerical Scientific Computation, SNSC 2001, held in Hagenberg, Austria, in September 2001.The 19 revised full papers presented were carefully selected during two rounds of reviewing and improvement. The papers are organized in topical sections on symbolics and numerics of differential equations, symbolics and numerics in algebra and geometry, and applications in physics and engineering.

Algebraic curves and surfaces are an old topic of geometric and algebraic investigation. They have found applications for instance in ancient and m- ern architectural designs, in number theoretic problems, in models of b- logical shapes, in error-correcting codes, and in cryptographic algorithms. Recently they have gained additional practical importance as central objects in computer-aided geometric design. Modern airplanes, cars, and household appliances would be unthinkable without the computational manipulation of algebraic curves and surfaces. Algebraic curves and surfaces combine fas- nating mathematical beauty with challenging computational complexity and wide spread practical applicability. In this book we treat only algebraic curves, although many of the results and methods can be and in fact have been generalized to surfaces. Being the solution loci of algebraic, i. e. , polynomial, equations in two variables, plane algebraiccurvesarewellsuited forbeing investigatedwith symboliccomputer algebra methods. This is exactly the approach we take in our book. We apply algorithms from computer algebra to the analysis, and manipulation of al- braic curves. To a large extent this amounts to being able to represent these algebraic curves in di?erent ways, such as implicitly by de?ning polyno- als, parametrically by rational functions, or locally parametrically by power series expansions around a point.

Algebraic curves and surfaces are an old topic of geometric and algebraic investigation. They have found applications for instance in ancient and m- ern architectural designs, in number theoretic problems, in models of b- logical shapes, in error-correcting codes, and in cryptographic algorithms. Recently they have gained additional practical importance as central objects in computer-aided geometric design. Modern airplanes, cars, and household appliances would be unthinkable without the computational manipulation of algebraic curves and surfaces. Algebraic curves and surfaces combine fas- nating mathematical beauty with challenging computational complexity and wide spread practical applicability. In this book we treat only algebraic curves, although many of the results and methods can be and in fact have been generalized to surfaces. Being the solution loci of algebraic, i. e. , polynomial, equations in two variables, plane algebraiccurvesarewellsuited forbeing investigatedwith symboliccomputer algebra methods. This is exactly the approach we take in our book. We apply algorithms from computer algebra to the analysis, and manipulation of al- braic curves. To a large extent this amounts to being able to represent these algebraic curves in di?erent ways, such as implicitly by de?ning polyno- als, parametrically by rational functions, or locally parametrically by power series expansions around a point.

Algebraic curves and surfaces are an old topic of geometric and algebraic investigation. They have found applications for instance in ancient and m- ern architectural designs, in number theoretic problems, in models of b- logical shapes, in error-correcting codes, and in cryptographic algorithms. Recently they have gained additional practical importance as central objects in computer-aided geometric design. Modern airplanes, cars, and household appliances would be unthinkable without the computational manipulation of algebraic curves and surfaces. Algebraic curves and surfaces combine fas- nating mathematical beauty with challenging computational complexity and wide spread practical applicability. In this book we treat only algebraic curves, although many of the results and methods can be and in fact have been generalized to surfaces. Being the solution loci of algebraic, i. e. , polynomial, equations in two variables, plane algebraiccurvesarewellsuited forbeing investigatedwith symboliccomputer algebra methods. This is exactly the approach we take in our book. We apply algorithms from computer algebra to the analysis, and manipulation of al- braic curves. To a large extent this amounts to being able to represent these algebraic curves in di?erent ways, such as implicitly by de?ning polyno- als, parametrically by rational functions, or locally parametrically by power series expansions around a point.

This book constitutes the refereed proceedings of the 4th International Conference on Algebraic Informatics, CAI 2011, held in Linz, Austria, in June 2011. The 12 revised full papers presented together with 4 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.

This book constitutes the refereed proceedings of the 4th International Conference on Algebraic Informatics, CAI 2011, held in Linz, Austria, in June 2011. The 12 revised full papers presented together with 4 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.