000 03750nam a22005655i 4500
001 978-3-319-15081-9
003 DE-He213
005 20200421111650.0
007 cr nn 008mamaa
008 150120s2015 gw | s |||| 0|eng d
020 _a9783319150819
_9978-3-319-15081-9
024 7 _a10.1007/978-3-319-15081-9
_2doi
050 4 _aQA76.9.M35
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT002000
_2bisacsh
082 0 4 _a005.131
_223
245 1 0 _aComputer Algebra and Polynomials
_h[electronic resource] :
_bApplications of Algebra and Number Theory /
_cedited by Jaime Gutierrez, Josef Schicho, Martin Weimann.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2015.
300 _aIX, 213 p. 29 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8942
505 0 _aAn 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�obner 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.
520 _aAlgebra 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.
650 0 _aComputer science.
650 0 _aAlgorithms.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 0 _aAlgebra.
650 1 4 _aComputer Science.
650 2 4 _aSymbolic and Algebraic Manipulation.
650 2 4 _aNumeric Computing.
650 2 4 _aAlgebra.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
700 1 _aGutierrez, Jaime.
_eeditor.
700 1 _aSchicho, Josef.
_eeditor.
700 1 _aWeimann, Martin.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319150802
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8942
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-15081-9
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c54346
_d54346