Constructions in Algebra

DOI10.2307/1996938zbMath0356.13007MaRDI QIDQ4128897

A. Seidenberg

Publication date: 1974

Full work available at URL: https://doi.org/10.2307/1996938

Mathematics Subject Classification ID

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

13C05: Structure, classification theorems for modules and ideals in commutative rings

13A15: Ideals and multiplicative ideal theory in commutative rings

14A05: Relevant commutative algebra

68W99: Algorithms in computer science

Related Items

The Algorithmic Theory of Finitely Generated Metabelian Groups, Ideal membership in polynomial rings over the integers, Effective Results for Discriminant Equations over Finitely Generated Integral Domains, An FGLM-like algorithm for computing the radical of a zero-dimensional ideal, On the computation of the Galois group of linear difference equations, Definability of Geometric Properties in Algebraically Closed Fields, Théorème des zéros effectif et élimination, $3$-Manifold Groups are Virtually Residually $p$, Nullstellensatz via Nonstandard Methods, Generalized Gröbner bases: Theory and applications. A condensation, Typical ranks for 3-tensors, nonsingular bilinear maps and determinantal ideals, On the small-weight codewords of some Hermitian codes, Generic interpolation polynomial for list decoding, Derivations and radicals of polynomial ideals over fields of arbitrary characteristic, Polynomial bounds in polynomial rings over fields, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, Explicit polynomial bounds on prime ideals in polynomial rings over fields, Bounds for the solutions of norm form, discriminant form and index form equations in finitely generated integral domains, On explicit solutions to the Bezout equation, Bounds in the theory of polynomial rings over fields. A nonstandard approach, Definability and fast quantifier elimination in algebraically closed fields, A new lower bound construction for commutative Thue systems with applications, A characterization of semisimple plane polynomial automorphisms, An algorithm for constructing Gröbner bases from characteristic sets and its application to geometry, Methods for computing in algebraic geometry and commutative algebra, Effective bounds of functions approximating formal solutions of binomial equations, Degree bounds for Gröbner bases in algebras of solvable type, A commutative algebra approach to linear codes, Semidefinite characterization and computation of zero-dimensional real radical ideals, Evaluation techniques for zero-dimensional primary decomposition, Fields of large transcendence degree generated by values of elliptic functions, On constructing bases for ideals in polynomial rings over the integers, Recursive properties of Euclidean domains, Model-theoretic and algorithmic questions in group theory, Countable algebra and set existence axioms, Cramer-type formula for the polynomial solutions of coupled linear equations with polynomial coefficients, Small degree solutions for the polynomial Bezout equation, Existence theorems in mathematics, Gröbner bases and primary decomposition of polynomial ideals, On the complexity of computing syzygies, Univariate polynomial factorization over finite fields, Occurrence problem for a polynomial ring, New decision algorithms for finitely presented commutative semigroups, Zero estimates on group varieties. I, Computable algebra and group embeddings, Complexity of computations in Commutative Division of the USSR Academy of Sciences, Complexity of solution of linear systems in rings of differential operators, An algorithm for solving parametric linear systems, Solutions of systems of algebraic equations and linear maps on residue class rings, Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen, Notes on Gröbner bases, Trajectories of polynomial vector fields and ascending chains of polynomial ideals, Finding the radical of matrix algebras using Fitting decompositions, On Gröbner bases under specialization, Finding the radical of an algebra of linear transformations, Polar varieties, real equation solving, and data structures: the hypersurface case, Computation of real radicals of polynomial ideals. II, The logic of pseudo-\(S\)-integers, Ideals generated by quadrics exhibiting double exponential degrees, Continuity properties for flat families of polynomials. I: Continuous parametrizations, Direct twisted Galois stratification, Local zero estimates and effective division in rings of algebraic power series, Proof mining and effective bounds in differential polynomial rings, Nonstandard methods for bounds in differential polynomial rings, Strongly minimal expansions of algebraically closed fields, Ideal basis and primary decompositions: case of two variables, The decomposition theorem for ideals in polynomial rings over a domain, The complexity of the word problems for commutative semigroups and polynomial ideals, Conjugacy problem in metabelian groups, The calculation of radical ideals in positive characteristic, Square-free algorithms in positive characteristic, Many associated primes of powers of primes, Subexponential-time computation of isolated primary components of a polynomial ideal, Diophantine problems over tamely ramified fields, Evaluation codes and their basic parameters, Grete Hermann and effective methods in geometry, The density of integer points on homogeneous varieties, Hermitian codes and complete intersections, Hrushovski's algorithm for computing the Galois group of a linear differential equation, Algorithmic aspects of Suslin's proof of Serre's conjecture, Weak Bézout inequality for D-modules, Subquadratic algorithms for algebraic 3SUM, Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve, Fast separable factorization and applications, A constructive notion of codimension, Ideals in computable rings, Comparison of theoretical complexities of two methods for computing annihilating ideals of polynomials, Computing restrictions of ideals in finitely generated \(k\)-algebras by means of Buchberger's algorithm, Saturation and Castelnuovo-Mumford regularity, Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert), Implementation of prime decomposition of polynomial ideals over small finite fields, Effective Bezout identities in \({\mathbb{Q}}[z_ 1,\dots ,z_ n\)], Integral Closure, Double-exponential lower bound for the degree of any system of generators of a polynomial prime ideal, Les nombres transcendants, Unnamed Item, Algèbre linéaire sur $K[X_1,\dots,X_n$ et élimination], Unnamed Item, What is Noetherian?, Construction of the Integral Closure of a Finite Integral Domain. II, Unnamed Item, On polynomial ideals, their complexity, and applications, Membership in polynomial ideals over Q is exponential space complete, A note on Nullstellensatz over finite fields, Small subalgebras of polynomial rings and Stillman’s Conjecture, Covering rational ruled surfaces, Localization, metabelian groups, and the isomorphism problem, Height bounds, nullstellensatz and primality, Axiomatizing the existential theory of \(\mathbb{F}_q((t))\)

Cites Work

• Unnamed Item
• Parameterspezialisierung in Polynomringen
• Parameterspezialisierung in Polynomringen. II. Das Grundpolynom
• Constructive normalization of an algebraic variety
• On the Length of a Hilbert Ascending Chain
• Construction of the integral closure of a finite integral domain
• Constructive Proof of Hilbert's Theorem on Ascending Chains
• The Hyperplane Sections of Normal Varieties