An algorithm to calculate optimal homogeneous systems of parameters (Q1284280): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q209723 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Tie Luo / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jsco.1998.0247 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1990461097 / rank | |||
Normal rank |
Latest revision as of 18:18, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm to calculate optimal homogeneous systems of parameters |
scientific article |
Statements
An algorithm to calculate optimal homogeneous systems of parameters (English)
0 references
30 March 1999
0 references
Let \(A= \bigoplus^\infty_{d= 0}A_d\) be a graded algebra of Krull dimension \(n\) over a field \(K= A_0\). Noether's normqalization lemma implies that there are homogeneous elements \(f_1,\dots, f_n\) in \(A\) so that \(A\) is a finite algebra over \(K[f_1,\dots, f_n]\). Such a set \(\{f_1,\dots, f_n\}\) is called a set of Homogeneous System Of Parameters (HSOP). Clearly a HSOP is not unique and degrees of \(f_i\in A_{d_i}\) can be arbitrarily high. The paper under review provides an algorithm which finds optimal HSOPs in the sense that \(\sum^n_{i= 1}d_i\) or \(\prod^n_{i= 1}d_i\) is minimal. The algorithm rests on a fundamental observation of the following equivalence between statemens (1) and (2) for a fixed \((d_1,\dots, d_n)\in \mathbb{Z}^n_+\) when \(K\) is an infinite field (theorem 2 of the paper): (1) There exist homogeneous elements \(f_i\in A_{d_i}\) such that \(\dim A/(f_1,\dots, f_n)= 0\). (2) For any subset \(M\subset\{1,\dots, n\}\), \(\dim A/\left(\bigcup_{i\in M}A_{d_i}\right)\leq n=|M|\). Now assuming one can compute generators of each \(A_d\) and dimension of \(A/I\) where \(I\) is an ideal generated by a union of some \(A_{d^S}\), finding optimal HSOPs is a matter of checking statement (2) for vectors \((d_1,\dots, d_n)\in \mathbb{Z}^n_+\) partially ordered according their sum or product. There were early related algorithms on finding HSOPs in some special cases by \textit{G. Kemper} [J. Symb. Comput. 21, No. 3, 351-366 (1996; Zbl 0889.13004)] and by \textit{W. Decker}, \textit{A. E. Heydtmann} and \textit{F.-O. Schreyer} [``Generating a Noetherian normalization of the invariant ring of a finite group'', ibid. 25, No. 6, 727-731 (1998)]. However, examples are demonstrated in the paper that HSOPs found based on earlier algorithms are not optimal.
0 references
homogeneous system of parameters
0 references
graded algebra
0 references