Página inicialGruposDiscussãoMaisZeitgeist
Pesquise No Site
Este site usa cookies para fornecer nossos serviços, melhorar o desempenho, para análises e (se não estiver conectado) para publicidade. Ao usar o LibraryThing, você reconhece que leu e entendeu nossos Termos de Serviço e Política de Privacidade . Seu uso do site e dos serviços está sujeito a essas políticas e termos.

Resultados do Google Livros

Clique em uma foto para ir ao Google Livros

Ideals, Varieties, and Algorithms: An…
Carregando...

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Undergraduate Texts in Mathematics) (edição: 1992)

de David A. Cox (Autor)

MembrosResenhasPopularidadeAvaliação médiaConversas
131Nenhum(a)208,507 (4.25)Nenhum(a)
This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the Preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry--the elimination theorem, the extension theorem, the closure theorem and the Nullstellensatz--this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new Chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and with some supplementation perhaps, for beginning graduate level courses in algebraic geometry or computational algebra. Prerequisites for the reader include linear algebra and a proof-oriented course. It is assumed that the reader has access to a computer algebra system. Appendix C describes features of Maple(tm), Mathematica® and Sage, as well as other systems that are most relevant to the text. Pseudocode is used in the text; Appendix B carefully describes the pseudocode used. Readers who are teaching from Ideals, Varieties, and Algorithms, or are studying the book on their own, may obtain a copy of the solutions manual by sending an email to jlittle@holycross.edu. From the reviews of previous editions:  "...The book gives an introduction to Buchberger's algorithm with applications to syzygies, Hilbert polynomials, primary decompositions. There is an introduction to classical algebraic geometry with applications to the ideal membership problem, solving polynomial equations and elimination theory. ...The book is well-written. ...The reviewer is sure that it will be an excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry."  --Peter Schenzel, zbMATH, 2007  "I consider the book to be wonderful. ... The exposition is very clear, there are many helpful pictures and there are a great many instructive exercises, some quite challenging ... offers the heart and soul of modern commutative and algebraic geometry."  --The American Mathematical Monthly… (mais)
Membro:AFloridaReader
Título:Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Undergraduate Texts in Mathematics)
Autores:David A. Cox (Autor)
Informação:Springer-Verlag (1992), 513 pages
Coleções:Sua biblioteca
Avaliação:
Etiquetas:Nenhum(a)

Informações da Obra

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra de David A. Cox

Nenhum(a)
Carregando...

Registre-se no LibraryThing tpara descobrir se gostará deste livro.

Ainda não há conversas na Discussão sobre este livro.

Sem resenhas
sem resenhas | adicionar uma resenha

» Adicionar outros autores

Nome do autorFunçãoTipo de autorObra?Status
Cox, David A.autor principaltodas as ediçõesconfirmado
Little, Johnautor principaltodas as ediçõesconfirmado
O'Shea, Donalautor principaltodas as ediçõesconfirmado

Pertence à série publicada

Você deve entrar para editar os dados de Conhecimento Comum.
Para mais ajuda veja a página de ajuda do Conhecimento Compartilhado.
Título canônico
Informação do Conhecimento Comum em inglês. Edite para a localizar na sua língua.
Título original
Títulos alternativos
Data da publicação original
Pessoas/Personagens
Lugares importantes
Eventos importantes
Filmes relacionados
Epígrafe
Dedicatória
Primeiras palavras
Citações
Últimas palavras
Aviso de desambiguação
Editores da Publicação
Autores Resenhistas (normalmente na contracapa do livro)
Idioma original
CDD/MDS canônico
LCC Canônico
This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the Preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry--the elimination theorem, the extension theorem, the closure theorem and the Nullstellensatz--this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new Chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D). The book may serve as a first or second course in undergraduate abstract algebra and with some supplementation perhaps, for beginning graduate level courses in algebraic geometry or computational algebra. Prerequisites for the reader include linear algebra and a proof-oriented course. It is assumed that the reader has access to a computer algebra system. Appendix C describes features of Maple(tm), Mathematica® and Sage, as well as other systems that are most relevant to the text. Pseudocode is used in the text; Appendix B carefully describes the pseudocode used. Readers who are teaching from Ideals, Varieties, and Algorithms, or are studying the book on their own, may obtain a copy of the solutions manual by sending an email to jlittle@holycross.edu. From the reviews of previous editions:  "...The book gives an introduction to Buchberger's algorithm with applications to syzygies, Hilbert polynomials, primary decompositions. There is an introduction to classical algebraic geometry with applications to the ideal membership problem, solving polynomial equations and elimination theory. ...The book is well-written. ...The reviewer is sure that it will be an excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry."  --Peter Schenzel, zbMATH, 2007  "I consider the book to be wonderful. ... The exposition is very clear, there are many helpful pictures and there are a great many instructive exercises, some quite challenging ... offers the heart and soul of modern commutative and algebraic geometry."  --The American Mathematical Monthly

Não foram encontradas descrições de bibliotecas.

Descrição do livro
Resumo em haiku

Current Discussions

Nenhum(a)

Capas populares

Links rápidos

Avaliação

Média: (4.25)
0.5
1
1.5
2
2.5
3 1
3.5
4 4
4.5
5 3

É você?

Torne-se um autor do LibraryThing.

 

Sobre | Contato | LibraryThing.com | Privacidade/Termos | Ajuda/Perguntas Frequentes | Blog | Loja | APIs | TinyCat | Bibliotecas Históricas | Os primeiros revisores | Conhecimento Comum | 204,715,239 livros! | Barra superior: Sempre visível