On regular sequences of binomials (Q1279855): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
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.1007/s002290050129 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053319302 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:29, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On regular sequences of binomials |
scientific article |
Statements
On regular sequences of binomials (English)
0 references
11 April 1999
0 references
In the ring of polynomials of several variables \(T_0,T_1,\dots, T_n\), an ideal \(I\), generated by binomials \(F_1,F_2,\dots, F_r\) \((r\leq n)\) with indeterminate coefficients, is considered. The property for such an ideal to be prime is characterized by a condition of strict admissibility [introduced earlier by the authors: \textit{G. Scheja} and \textit{U. Storch} in: Commutative Algebra, Proc. Workshop, Trieste 1992, 217-235 (1994; Zbl 0927.13024)] for general \(F_1,F_2,\dots, F_r\). Several equivalent definitions of strict admissibility are presented in the considered case, both combinatorial, using the notion of distinguished sequences of \textit{Ch. Delorme} [Ann. Sci. Éc. Norm. Supér., IV. Sér. 9, 145-154 (1976; Zbl 0325.20065)] and algebraic, in terms of regularity of some specializations of \(F_1,F_2,\dots, F_r\). A graph-theoretic approach to this theory and an algorithm for obtaining the distinguished sequences in question are presented, as well.
0 references
binomials
0 references
primeness of polynomial ideal
0 references
partitions
0 references
strict admissibility
0 references
distinguished sequences
0 references
algorithm
0 references