Constructions in Algebra
From MaRDI portal
Ideals and multiplicative ideal theory in commutative rings (13A15) Structure, classification theorems for modules and ideals in commutative rings (13C05) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Relevant commutative algebra (14A05) Algorithms in computer science (68W99)
Cites work
- Construction of the integral closure of a finite integral domain
- Constructive normalization of an algebraic variety
- Constructive Proof of Hilbert's Theorem on Ascending Chains
- scientific article; zbMATH DE number 3503388 (Why is no real title available?)
- On the Length of a Hilbert Ascending Chain
- Parameterspezialisierung in Polynomringen
- Parameterspezialisierung in Polynomringen. II. Das Grundpolynom
- The Hyperplane Sections of Normal Varieties
Cited in
(only showing first 100 items - show all)- 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
- Typical ranks for 3-tensors, nonsingular bilinear maps and determinantal ideals
- scientific article; zbMATH DE number 4008530 (Why is no real title available?)
- Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
- Construction of the Integral Closure of a Finite Integral Domain. II
- What is Noetherian?
- scientific article; zbMATH DE number 3577347 (Why is no real title available?)
- 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
- On the small-weight codewords of some Hermitian codes
- 3-manifold groups are virtually residually \(p\)
- Nullstellensatz via Nonstandard Methods
- Generalized Gröbner bases: Theory and applications. A condensation
- On polynomial ideals, their complexity, and applications
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- scientific article; zbMATH DE number 7408863 (Why is no real title available?)
- 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))\)
- Rationality and parametrizations of algebraic curves under specializations
- Generic interpolation polynomial for list decoding
- Quantitative behavior of unipotent flows and an effective avoidance principle
- Weighted basic parallel processes and combinatorial enumeration
- Abnormal singular foliations and the Sard conjecture for generic co-rank one distributions
This page was built for publication: Constructions in Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128897)