molest 发表于 2025-3-26 22:17:25
Hilbert Series and Degree Bounds in Invariant TheoryThe algorithm for computing a miniversal deformation of an isolated singularity using Massey products and its implementation in SINGULAR is explained. For completeness the cotangent cohomology and the obstruction calculus is described in concrete terms as well.谷物 发表于 2025-3-27 01:06:35
http://reply.papertrans.cn/16/1529/152881/152881_32.png沙草纸 发表于 2025-3-27 06:46:12
Algorithms for the Computation of Free ResolutionsR. Brauer posed in his famous lectures on modern mathematics 1963 more than 40 problems, questions and conjectures about the representation theory of finite groups, cf. [.]. These questions have had a big influence on the development of the theory since then. Most of the problems may be summarized under the following central question.确保 发表于 2025-3-27 11:08:58
http://reply.papertrans.cn/16/1529/152881/152881_34.pngolfction 发表于 2025-3-27 16:17:22
http://image.papertrans.cn/a/image/152881.jpgAnticlimax 发表于 2025-3-27 18:06:34
http://reply.papertrans.cn/16/1529/152881/152881_36.pngiodides 发表于 2025-3-27 23:09:56
http://reply.papertrans.cn/16/1529/152881/152881_37.pngAbduct 发表于 2025-3-28 04:39:28
Sieving Methods for Class Group Computationfastest method known has conjectured sub-exponential running time and was proposed in [.]. . this paper we show how sieving methods developed for factoring algorithms can be used to speed up this algorithm in practice. We present numerical experiments which demonstrate the efficiency of our new stra参考书目 发表于 2025-3-28 07:07:20
http://reply.papertrans.cn/16/1529/152881/152881_39.png排斥 发表于 2025-3-28 10:53:43
Fortschritte in der inversen Galoistheorie tiber seither erreichte neue Resultate. Da inzwischen mehrere einftihrende Texte in Buchform von Matzat (1987), Serre (1992), V6lklein (1996) sowie Ishkhanov, Lure und Faddeev (1997) vorhanden sind, kann ich mich bei der Zusammenstellung der Grundlagen sehr kurz fassen. Eine ausftihrliche Darstellu