Algorithms in invariant theory /

Saved in:
Bibliographic Details
Author / Creator:Sturmfels, Bernd, 1962-
Imprint:Wien ; New York : Springer-Verlag, c1993.
Description:197 p. : ill. ; 25 cm.
Language:English
Series:Texts and monographs in symbolic computation
Subject:
Format: Print Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/1515364
Hidden Bibliographic Details
ISBN:0387824456
Notes:Includes bibliographical references and index.

MARC

LEADER 00000cam a2200000 a 4500
001 1515364
003 ICU
005 19990927093700.0
008 931118s1993 au a b 001 0 eng
010 |a  93026772 
020 |a 0387824456 
035 |a (ICU)BID17624936 
035 |a (OCoLC)28423211 
040 |c DLC  |d ICU$dOrLoB 
050 0 0 |a QA201  |b .S956 1993 
082 |a 512/.74  |2 20 
100 1 |a Sturmfels, Bernd,  |d 1962-  |0 http://id.loc.gov/authorities/names/n88055085  |1 http://viaf.org/viaf/29606595 
245 1 0 |a Algorithms in invariant theory /  |c Bernd Sturmfels. 
260 |a Wien ;  |a New York :  |b Springer-Verlag,  |c c1993. 
263 |a 9307 
300 |a 197 p. :  |b ill. ;  |c 25 cm. 
336 |a text  |b txt  |2 rdacontent  |0 http://id.loc.gov/vocabulary/contentTypes/txt 
337 |a unmediated  |b n  |2 rdamedia  |0 http://id.loc.gov/vocabulary/mediaTypes/n 
338 |a volume  |b nc  |2 rdacarrier  |0 http://id.loc.gov/vocabulary/carriers/nc 
440 0 |a Texts and monographs in symbolic computation 
504 |a Includes bibliographical references and index. 
505 0 0 |g 1.  |t Introduction.  |g 1.1.  |t Symmetric polynomials.  |g 1.2.  |t Grobner bases.  |g 1.3.  |t What is invariant theory?  |g 1.4.  |t Torus invanants and integer programming --  |g 2.  |t Invariant theory of finite groups.  |g 2.1.  |t Finiteness and degree bounds.  |g 2.2.  |t Counting the number of invariants.  |g 2.3.  |t The Cohen-Macaulay property.  |g 2.4.  |t Reflection groups.  |g 2.5.  |t Algorithms for computing fundamental invariants.  |g 2.6.  |t Grobner bases under finite group action.  |g 2.7.  |t Abelian groups and permutation groups --  |g 3.  |t Bracket algebra and projective geometry.  |g 3.1.  |t The straightening algorithm.  |g 3.2.  |t The first fundamental theorem.  |g 3.3.  |t The Grassmann-Cayley algebra.  |g 3.4.  |t Applications to projective geometry.  |g 3.5.  |t Cayley factorization.  |g 3.6.  |t Invariants and covariants of binary forms.  |g 3.7.  |t Gordan's finiteness theorem --  |g 4.  |t Invariants of the general linear group.  |g 4.1.  |t Representation theory of the general linear group.  |g 4.2.  |t Binary forms revisited.  |g 4.3.  |t Cayley's [Omega]-process and Hilbert finiteness theorem.  |g 4.4.  |t Invariants and covariants of forms.  |g 4.5.  |t Lie algebra action and the symbolic method.  |g 4.6.  |t Hilbert's algorithm.  |g 4.7.  |t Degree bounds. 
650 0 |a Invariants  |0 http://id.loc.gov/authorities/subjects/sh85067665 
650 0 |a Algorithms  |0 http://id.loc.gov/authorities/subjects/sh85003487 
650 0 |a Geometry, Projective  |0 http://id.loc.gov/authorities/subjects/sh85054157 
650 7 |a Algorithms.  |2 fast  |0 http://id.worldcat.org/fast/fst00805020 
650 7 |a Geometry, Projective.  |2 fast  |0 http://id.worldcat.org/fast/fst00940936 
650 7 |a Invariants.  |2 fast  |0 http://id.worldcat.org/fast/fst00977982 
850 |a ICU 
901 |a ToCBNA 
903 |a HeVa 
903 |a Hathi 
929 |a cat 
999 f f |i e833797e-5c35-515b-94f0-3caadf1e8266  |s 5861b56e-9d66-520a-b61c-b1e24ac1fe4d 
928 |t Library of Congress classification  |a QA201.S9560 1993  |l Eck  |c Eck-Eck  |i 2818342 
927 |t Library of Congress classification  |a QA201.S9560 1993  |l Eck  |c Eck-Eck  |b 40269989  |i 2915196