東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Computer algebra and polynomials = a...

Gutierrez, Jaime.

Linked to FindBook

Google Book

Amazon

博客來

Computer algebra and polynomials = applications of algebra and number theory /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Computer algebra and polynomials/ edited by Jaime Gutierrez, Josef Schicho, Martin Weimann.
Reminder of title:	applications of algebra and number theory /
other author:	Gutierrez, Jaime.
Published:	Cham :Springer International Publishing : : 2015.,
Description:	ix, 213 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer eBooks
Subject:	Computer algebra - Congresses. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-15081-9
ISBN:	9783319150819 (electronic bk.)

Computer algebra and polynomials = applications of algebra and number theory /
Computer algebra and polynomialsapplications of algebra and number theory /[electronic resource] :edited by Jaime Gutierrez, Josef Schicho, Martin Weimann. - Cham :Springer International Publishing :2015. - ix, 213 p. :ill., digital ;24 cm. - Lecture notes in computer science,89420302-9743 ;. - Lecture notes in computer science ;5353..

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.

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.

ISBN: 9783319150819 (electronic bk.)

Standard No.: 10.1007/978-3-319-15081-9doiSubjects--Topical Terms:

2133945
Computer algebra
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 511.3

Computer algebra and polynomials = applications of algebra and number theory /
LDR:02915nmm a2200337 a 4500 001 1994871
003 DE-He213
005 20150826104534.0
006 m d
007 cr nn 008maaau
008 151019s2015 gw s 0 eng d
020 $a 9783319150819 (electronic bk.)
020 $a 9783319150802 (paper)
024 7 $a 10.1007/978-3-319-15081-9 $2 doi
035 $a 978-3-319-15081-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UYAM $2 bicssc
072 7 $a COM018000 $2 bisacsh
072 7 $a MAT002000 $2 bisacsh
082 0 4 $a 511.3 $2 23
090 $a QA76.9.A43 $b C738 2015
245 0 0 $a Computer algebra and polynomials $h [electronic resource] : $b applications of algebra and number theory / $c edited by Jaime Gutierrez, Josef Schicho, Martin Weimann.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2015.
300 $a ix, 213 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 8942
505 0 $a 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.
520 $a 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.
650 0 $a Computer algebra $v Congresses. $3 2133945
650 0 $a Number theory $v Problems, exercises, etc. $3 1232300
650 0 $a Polynomials $v Congresses. $3 2133946
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Symbolic and Algebraic Manipulation. $3 891222
650 2 4 $a Numeric Computing. $3 892606
650 2 4 $a Algebra. $3 516203
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
700 1 $a Gutierrez, Jaime. $3 2133942
700 1 $a Schicho, Josef. $3 2133943
700 1 $a Weimann, Martin. $3 2133944
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 5353. $x 0302-9743 $3 1274248
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-15081-9
950 $a Computer Science (Springer-11645)