Algorithms in Invariant Theory.
tarafından
 
Sturmfels, Bernd.

Başlık
Algorithms in Invariant Theory.

Yazar
Sturmfels, Bernd.

ISBN
9783211774175

Yazar Ek Girişi
Sturmfels, Bernd.

Basım Bilgisi
2nd ed.

Fiziksel Tanımlama
1 online resource (204 pages)

Seri
Texts & Monographs in Symbolic Computation

İçerik
Pages:1 to 25 -- Pages:26 to 50 -- Pages:51 to 75 -- Pages:76 to 100 -- Pages:101 to 125 -- Pages:126 to 150 -- Pages:151 to 175 -- Pages:176 to 200 -- Pages:201 to 204.

Özet
J. Kung and G.-C. Rota, in their 1984 paper, write: "Like the Arabian phoenix rising out of its ashes, the theory of invariants, pronounced dead at the turn of the century, is once again at the forefront of mathematics". The book of Sturmfels is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. The Groebner bases method is the main tool by which the central problems in invariant theory become amenable to algorithmic solutions. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematics, symbolic computation, and computer science will get access to a wealth of research ideas, hints for applications, outlines and details of algorithms, worked out examples, and research problems.

Notlar
Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2017. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries.

Konu Başlığı
Algorithms.
 
Electronic books. -- local.
 
Geometry, Projective.
 
Invariants.

Tür
Electronic books.

Yazar Ek Girişi
Paule, Peter.

Elektronik Erişim
Click to View


LibraryMateryal TürüDemirbaş NumarasıYer NumarasıDurumu/İade Tarihi
IYTE LibraryE-Kitap1199528-1001QA75.5 -76.95Ebrary E-Books