On the dimension of an arbitrary ascending chain

zbMATH Open0845.13004MaRDI QIDQ687938FDOQ687938

Xiao-Shan Gao, Shang-Ching Chou

Publication date: 11 September 1996

Published in: Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

ascending chain of polynomials

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Polynomials in general fields (irreducibility, etc.) (12E05)

Cited In (10)

• Computing triangular systems and regular systems
• Computing strong regular characteristic pairs with Gröbner bases
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
• Multiplicity-preserving triangular set decomposition of two polynomials
• A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
• A generalized Euclidean algorithm for geometry theorem proving
• Title not available (Why is that?)
• On the theories of triangular sets
• Decomposition of polynomial sets into characteristic pairs
• An equivalence theorem for regular differential chains

Recommendations

• Title not available (Why is that?) 👍 👎
• CONSTRUCTING CHAINS OF PRIMES IN POWER SERIES RINGS, II 👍 👎
• Constructing chains of primes in power series rings 👍 👎
• A note on the ascending chain condition of ideals 👍 👎
• On the Ascending Chain Condition for Mixed Difference Ideals 👍 👎

This page was built for publication: On the dimension of an arbitrary ascending chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687938)