Constructions in Algebra

DOI10.2307/1996938zbMath0356.13007OpenAlexW4233757388MaRDI QIDQ4128897

A. Seidenberg

Publication date: 1974

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

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Structure, classification theorems for modules and ideals in commutative rings (13C05) Ideals and multiplicative ideal theory in commutative rings (13A15) Relevant commutative algebra (14A05) Algorithms in computer science (68W99)

Related Items (only showing first 100 items - show all)

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

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

This page was built for publication: Constructions in Algebra