Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 315–328 Computing Minimal Generating Sets of Invariant Rings of Permutation Groups ¨ with SAGBI-Grobner - Elementary symmetric polynomial - Document - PDFSEARCH.IO

First Page	Meta Content
	Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 315–328 Computing Minimal Generating Sets of Invariant Rings of Permutation Groups ¨ with SAGBI-Grobner Add to Reading List Document Date: 2005-10-17 15:50:24 Open Document File Size: 128,31 KB Share Result on Facebook City Paris / / Company m and S / A3 / Intel / / Country France / / / Facility library GLIP / library PerMuVAR / / IndustryTerm by-product / reduction algorithm / combinatorial algorithms / direct product / usual division algorithm / usual algorithms / classical algorithms / computational tools / Naive algorithms / minimal generating systems / characteristic-free algorithm / / OperatingSystem Linux / GNU / / Person Nicolas M. Thi´ery / / ProgrammingLanguage C++ / / ProvinceOrState Indiana / / Technology 3.6 An algorithm / purely combinatorial algorithms / following algorithm / classical algorithms / extended algorithm / Linux / 2.2 Classical algorithms / characteristic-free algorithm / reduction algorithm / desired algorithm / usual algorithms / / URL http / SocialTag Invariant theory Commutative algebra Polynomials Algebraic geometry Homogeneous polynomials Elementary symmetric polynomial Invariant Monomial Gröbner basis Algebra

Discrete Mathematics and Theoretical Computer Science Proceedings AA (DM-CCG), 2001, 315–328 Computing Minimal Generating Sets of Invariant Rings of Permutation Groups ¨ with SAGBI-GrobnerAdd to Reading List