Cantitate/Preț
Produs

Computer Algebra and Polynomials: Applications of Algebra and Number Theory: Lecture Notes in Computer Science, cartea 8942

Editat de Jaime Gutierrez, Josef Schicho, Martin Weimann
en Limba Engleză Paperback – 2 feb 2015
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32217 lei

Preț vechi: 40272 lei
-20% Nou

Puncte Express: 483

Preț estimativ în valută:
6166 6405$ 5121£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319150802
ISBN-10: 3319150804
Pagini: 213
Ilustrații: IX, 213 p. 29 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.32 kg
Ediția:2015
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics.- Moving Curve Ideals of Rational Plane Parametrizations.- Survey on Counting Special Types of Polynomials.- Orbit Closures of Linear Algebraic Groups.- Symbolic Solutions of First-Order Algebraic ODEs.- Ore Polynomials in Sage.- Giac and GeoGebra – Improved Gröbner Basis Computations.- Polar Varieties Revisited.- A Note on a Problem Proposed by Kim and Lisonek.- Fast Algorithms for Refined Parameterized Telescoping in Difference Fields.- Some Results on the Surjectivity of Surface Parametrizations.- Rational Normal Curves as Set-Theoretic Complete Intersections of Quadrics.

Textul de pe ultima copertă

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.

Caracteristici

State-of-the-art research Includes contributions from a set of experts in various coefficient domains and in applications of manipulation of polynomials Provides interesting perspective on the rich and active area of research in theory and algorithms for polynomials over various coefficient domains Includes supplementary material: sn.pub/extras