✦ LIBER ✦

Computational Algorithms for the Enumeration of Group Invariant Partitions

✍ Scribed by White, D. E.; Williamson, S. G.

Book ID: 118178082
Publisher: Society for Industrial and Applied Mathematics
Year: 1975
Tongue: English
Weight: 355 KB
Volume: 4
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0204017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implicit enumeration algorithms for the

Implicit enumeration algorithms for the Set-Partitioning Problem

✍ S. Albers 📂 Article 📅 1980 🏛 Springer 🌐 German ⚖ 797 KB

Special algorithm for computer calculati

Special algorithm for computer calculation of the point group invariants

✍ M.A. Fradkin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 355 KB

Fast algorithm for the computation of mo

Fast algorithm for the computation of moment invariants

✍ M.F. Zakaria; L.J. Vroomen; P.J.A. Zsombor-Murray; J.M.H.M. van Kessel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Computation of Invariants for Reductive

Computation of Invariants for Reductive Groups

✍ Harm Derksen 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We will give an algorithm for computing generators of the invariant ring for a given representation of a linearly reductive group. The algorithm basically consists of a single Gro bner basis computation. We will also show a connection between some open conjectures in commutative algebra and finding

A Fast Algorithm for the Computation and

A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies

✍ Kannan, Sampath; Warnow, Tandy 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB

Analysis of an algorithm for computing i

Analysis of an algorithm for computing invariant measures

✍ Phil Diamond; Peter Kloeden; Alexei Pokrovskii 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 647 KB