On the public citation graph
Gr�bner bases of ideals defined by functionals with an application to ideals of projective points
0 signed · 143 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jsco.1993.1051openalex-snapshot
Efficient Computation of Zero-dimensional Gröbner Bases by Change of Ordering
inferredcites →https://doi.org/10.1007/3-540-09519-5_52openalex-snapshot
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases
inferredcites →https://doi.org/10.1007/3-540-11607-9_3openalex-snapshot
The construction of multivariate polynomials with preassigned zeros
inferredcites →https://doi.org/10.1007/3-540-12868-9_99openalex-snapshot
Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations
inferredcites →https://doi.org/10.1007/3-540-54195-0_59openalex-snapshot
Bounds for degrees and number of elements in Gröbner bases
inferredcites →https://doi.org/10.1007/3-540-54195-0_61openalex-snapshot
Complexity of standard bases in projective dimension zero II
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_11openalex-snapshot
Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles
inferredcites →https://doi.org/10.1007/978-1-4612-0441-1_15openalex-snapshot
A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals
inferredcites →https://doi.org/10.1016/0021-8693(86)90071-2openalex-snapshot
New constructive methods in classical Ideal theory
inferredcites →https://doi.org/10.1016/s0747-7171(88)80048-8openalex-snapshot
On an installation of Buchberger's algorithm
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/120694.120702openalex-snapshot
Gröbner bases of ideals given by dual bases
inferredcites →https://doi.org/10.1145/120694.120703openalex-snapshot
The Chinese remainder problem, multivariate interpolation, and Gröbner bases
inferredcites →https://doi.org/10.1145/120694.120708openalex-snapshot
How we proved that there are exactly 924 cyclic 7-roots
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/mma.4495openalex-snapshot
Lagrange‐type basis for multivariate uniform integrable tensor‐product Birkhoff interpolation
inferred← citeshttps://doi.org/10.1006/jsco.1998.0209openalex-snapshot
An Algebraic Computational Approach to the Identifiability of Fourier Models
inferred← citeshttps://doi.org/10.1006/jsco.1999.0354openalex-snapshot
Minimally Generating Ideals of Rational Parametric Curves in Polynomial Time
inferred← citeshttps://doi.org/10.1006/jsco.1999.0415openalex-snapshot
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
inferred← citeshttps://doi.org/10.1006/jsco.2000.0428openalex-snapshot
Implicitization of a General Union of Parametric Varieties
inferred← citeshttps://doi.org/10.1006/jsco.2001.0476openalex-snapshot
Multivariate Polynomial System Solving Using Intersections of Eigenspaces
inferred← citeshttps://doi.org/10.1007/11617983_11openalex-snapshot
Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points
inferred← citeshttps://doi.org/10.1007/11617983_7openalex-snapshot
A General Framework for Applying FGLM Techniques to Linear Codes
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_32openalex-snapshot
Systems of algebraic equations solved by means of endomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-0348-9104-2_4openalex-snapshot
How to compute the canonical module of a set of points
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_1openalex-snapshot
Geometry, Algebra, and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_10openalex-snapshot
Additional Gröbner Basis Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_4openalex-snapshot
The Algebra–Geometry Dictionary
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_5openalex-snapshot
Polynomial and Rational Functions on a Variety
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_6openalex-snapshot
Robotics and Automatic Geometric Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_7openalex-snapshot
Invariant Theory of Finite Groups
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_8openalex-snapshot
Projective Algebraic Geometry
inferred← citeshttps://doi.org/10.1007/978-3-319-16721-3_9openalex-snapshot
The Dimension of a Variety
inferred← citeshttps://doi.org/10.1007/978-3-319-66320-3_23openalex-snapshot
Algorithms for Zero-Dimensional Ideals Using Linear Recurrent Sequences
inferred← citeshttps://doi.org/10.1007/978-3-319-96418-8_12openalex-snapshot
Efficient Computation of Squarefree Separator Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-540-89994-5_9openalex-snapshot
Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_10openalex-snapshot
The BMS Algorithm and Decoding of AG Codes
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_24openalex-snapshot
An Application of Möller’s Algorithm to Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-93806-4_3openalex-snapshot
The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
inferred← citeshttps://doi.org/10.1007/978-3-642-01960-9_6openalex-snapshot
Some Meeting Points of Gröbner Bases and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_4openalex-snapshot
Some Combinatorial Applications of Gröbner Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-27951-5_39openalex-snapshot
Generating Inductive Invariants for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-662-43799-5_21openalex-snapshot
The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures
inferred← citeshttps://doi.org/10.1007/bf02948792openalex-snapshot
The multiplicity of zeros of algebraic system in eigenvalue method
inferred← citeshttps://doi.org/10.1007/s00200-003-0133-5openalex-snapshot
Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality
inferred← citeshttps://doi.org/10.1007/s00200-005-0171-2openalex-snapshot
A characterization of stable and Borel ideals
inferred← citeshttps://doi.org/10.1007/s00200-006-0019-4openalex-snapshot
The big Mother of all dualities 2: Macaulay bases
inferred← citeshttps://doi.org/10.1007/s00200-007-0048-7openalex-snapshot
Gröbner basis approach to list decoding of algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s00200-014-0213-8openalex-snapshot
An algorithm for implicit interpolation
inferred← citeshttps://doi.org/10.1007/s00200-022-00570-7openalex-snapshot
Effective algorithm for computing Noetherian operators of zero-dimensional ideals
inferred← citeshttps://doi.org/10.1007/s00200-022-00586-zopenalex-snapshot
Degröbnerization: a political manifesto
inferred← citeshttps://doi.org/10.1007/s002110050122openalex-snapshot
Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
inferred← citeshttps://doi.org/10.1007/s10623-023-01302-9openalex-snapshot
Towards a Gröbner-free approach to coding
inferred← citeshttps://doi.org/10.1007/s10994-026-07112-zopenalex-snapshot
Discovery of Exact Equations via Computing the Gröbner Basis
inferred← citeshttps://doi.org/10.1007/s11424-016-4113-9openalex-snapshot
A two-dimensional improvement for Farr-Gao algorithm
inferred← citeshttps://doi.org/10.1007/s11424-016-4114-8openalex-snapshot
An algorithm for the discretization of an ideal projector
inferred← citeshttps://doi.org/10.1007/s11424-021-9330-1openalex-snapshot
Computing PUR of Zero-Dimensional Ideals of Breadth at Most One
inferred← citeshttps://doi.org/10.1007/s11424-026-4533-0openalex-snapshot
Computing PUR of Zero-Dimensional Ideals
inferred← citeshttps://doi.org/10.1007/s11425-012-4404-0openalex-snapshot
Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis
inferred← citeshttps://doi.org/10.1007/s11766-014-3238-7openalex-snapshot
A fast algorithm for multivariate Hermite interpolation
inferred← citeshttps://doi.org/10.1007/s11786-012-0108-7openalex-snapshot
Multiplication Matrices and Ideals of Projective Dimension Zero
inferred← citeshttps://doi.org/10.1007/s13348-021-00313-wopenalex-snapshot
The close relation between border and Pommaret marked bases
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00126-4openalex-snapshot
From algebraic sets to monomial linear bases by means of combinatorial algorithms
inferred← citeshttps://doi.org/10.1016/j.cam.2008.10.009openalex-snapshot
Newton basis for multivariate Birkhoff interpolation
inferred← citeshttps://doi.org/10.1016/j.cam.2010.04.035openalex-snapshot
A bivariate preprocessing paradigm for the Buchberger–Möller algorithm
inferred← citeshttps://doi.org/10.1016/j.cam.2011.01.006openalex-snapshot
The proper interpolation space for multivariate Birkhoff interpolation
inferred← citeshttps://doi.org/10.1016/j.cam.2011.09.028openalex-snapshot
A fast algorithm for the multivariate Birkhoff interpolation problem
inferred← citeshttps://doi.org/10.1016/j.cam.2014.09.002openalex-snapshot
Stable monomial basis for multivariate Birkhoff interpolation problems
inferred← citeshttps://doi.org/10.1016/j.cam.2016.05.012openalex-snapshot
The discretization for bivariate ideal interpolation
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2009.03.025openalex-snapshot
Finite sets of d-planes in affine space
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2025.11.034openalex-snapshot
Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases
inferred← citeshttps://doi.org/10.1016/j.jat.2016.01.004openalex-snapshot
The structure of a second-degree D -invariant subspace and its application in ideal interpolation
inferred← citeshttps://doi.org/10.1016/j.jco.2020.101502openalex-snapshot
Computing syzygies in finite dimension using fast linear algebra
inferred← citeshttps://doi.org/10.1016/j.jco.2021.101574openalex-snapshot
Fast amortized multi-point evaluation
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.03.009openalex-snapshot
On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.09.001openalex-snapshot
Computing zero-dimensional schemes
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.11.005openalex-snapshot
Irreducible decomposition of polynomial ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.01.002openalex-snapshot
List decoding of Reed–Solomon codes from a Gröbner basis perspective
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.010openalex-snapshot
Approximate computation of zero-dimensional polynomial ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.05.009openalex-snapshot
Flat families by strongly stable ideals and a generalization of Gröbner bases
inferred← citeshttps://doi.org/10.1016/j.jsc.2013.12.007openalex-snapshot
Computational aspects of retrieving a representation of an algebraic geometry code
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.07.031openalex-snapshot
A survey on signature-based algorithms for computing Gröbner bases
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.08.005openalex-snapshot
Border bases for lattice ideals
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.02.002openalex-snapshot
A general framework for Noetherian well ordered polynomial reductions
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.09.002openalex-snapshot
Noetherian operators and primary decomposition
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102400openalex-snapshot
Local dual spaces and primary decomposition
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.025openalex-snapshot
Deterministic normal position transformation and its applications
inferred← citeshttps://doi.org/10.1016/s0022-4049(03)00122-1openalex-snapshot
Maximal rank and minimal generation of some parametric varieties
inferred← citeshttps://doi.org/10.1016/s0022-4049(99)00011-0openalex-snapshot
Some properties of Borel ideals
inferred← citeshttps://doi.org/10.1023/a:1018981505752openalex-snapshot
Polynomial interpolation in several variables
inferred← citeshttps://doi.org/10.1080/00927870008827075openalex-snapshot
Co-generators for algebras over fields and commutative applications
inferred← citeshttps://doi.org/10.1080/09720529.2007.10698114openalex-snapshot
On a Gröbner bases structure associated to linear codes
inferred← citeshttps://doi.org/10.1080/10586458.1995.10504323openalex-snapshot
An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
inferred← citeshttps://doi.org/10.1080/10586458.2007.10128986openalex-snapshot
Computational Methods for the Construction of a Class of Noetherian Operators
inferred← citeshttps://doi.org/10.1081/agb-120017343openalex-snapshot
The Big Mother of all Dualities: Möller Algorithm
inferred← citeshttps://doi.org/10.1090/conm/572/11374openalex-snapshot
Ideals of curves given by points
inferred← citeshttps://doi.org/10.1090/conm/826/16570openalex-snapshot
Gröbnerian and Gröbner free techniques on non-associative algebras
inferred← citeshttps://doi.org/10.1090/mcom/2969openalex-snapshot
A new framework for computing Gröbner bases
inferred← citeshttps://doi.org/10.1090/mcom/3744openalex-snapshot
Toric eigenvalue methods for solving sparse polynomial systems
inferred← citeshttps://doi.org/10.1090/s0002-9947-00-02646-5openalex-snapshot
Gröbner bases, H–bases and interpolation
inferred← citeshttps://doi.org/10.1090/s0002-9947-96-01671-6openalex-snapshot
On multiplicities in polynomial system solving
inferred← citeshttps://doi.org/10.1090/s0025-5718-05-01790-4openalex-snapshot
Gröbner bases and generalized Padé approximation
inferred← citeshttps://doi.org/10.1134/s0032946007030027openalex-snapshot
Interpolation in list decoding of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1137/110827247openalex-snapshot
Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
inferred← citeshttps://doi.org/10.1142/9789812704436_0008openalex-snapshot
BIVARIATE HERMITE INTERPOLATION AND LINEAR SYSTEMS OF PLANE CURVES WITH BASE FAT POINTS
inferred← citeshttps://doi.org/10.1142/9789812706898_0005openalex-snapshot
Introduction to algebraic theory of multivariate interpolation
inferred← citeshttps://doi.org/10.1142/9789812772022_0002openalex-snapshot
A Gröbner representation for linear codes
inferred← citeshttps://doi.org/10.1142/s021949881100549xopenalex-snapshot
FINITE SETS OF AFFINE POINTS WITH UNIQUE ASSOCIATED MONOMIAL ORDER QUOTIENT BASES
inferred← citeshttps://doi.org/10.1142/s0219498818500020openalex-snapshot
An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
inferred← citeshttps://doi.org/10.1145/1145768.1145771openalex-snapshot
Computational communicative algebra
inferred← citeshttps://doi.org/10.1145/220346.220368openalex-snapshot
Gröbner duality and multiplicities in polynomial system solving
inferred← citeshttps://doi.org/10.1145/281508.281607openalex-snapshot
A note on Nielsen reduction and coset enumeration
inferred← citeshttps://doi.org/10.1145/3326229.3326279openalex-snapshot
Linear Algebra for Zero-Dimensional Ideals
inferred← citeshttps://doi.org/10.1145/3373207.3404059openalex-snapshot
A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
inferred← citeshttps://doi.org/10.1145/3476446.3535484openalex-snapshot
Faster Change of Order Algorithm for Gröbner Bases under Shape and Stability Assumptions
inferred← citeshttps://doi.org/10.1145/3476446.3536195openalex-snapshot
A Degroebnerization Approach to Algebraic Statistics
inferred← citeshttps://doi.org/10.1145/384101.384112openalex-snapshot
Computation of minimal generators of ideals of fat points
inferred← citeshttps://doi.org/10.3390/axioms10030193openalex-snapshot
The Representation of D-Invariant Polynomial Subspaces Based on Symmetric Cartesian Tensors
inferred← citeshttps://doi.org/10.3390/axioms14110838openalex-snapshot
An Algorithm for Determining Whether the Quotient Ring Modulo an Ideal Has a Cyclic Basis
inferred← citeshttps://doi.org/10.3934/math.2024948openalex-snapshot
Algorithms for computing Gröbner bases of ideal interpolation
inferred← citeshttps://doi.org/10.4156/jdcta.vol6.issue4.31openalex-snapshot
Generating Invariants for Hybrid Systems by Computing Vanishing Ideals of Sample Points
inferred← citeshttps://doi.org/10.48550/arxiv.0711.1026openalex-snapshot
Finite subsets of projective space, and their ideals
inferred← citeshttps://doi.org/10.48550/arxiv.0711.3475openalex-snapshot
Efficiently computing Groebner bases of ideals of points
inferred← citeshttps://doi.org/10.48550/arxiv.0807.2370openalex-snapshot
Complexity of comparing monomials and two improvements of the BM-algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.0808.3591openalex-snapshot
Vector space bases associated to vanishing ideals of points
inferred← citeshttps://doi.org/10.48550/arxiv.0903.2028openalex-snapshot
Multiplication matrices and ideals of projective dimension zero
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3201openalex-snapshot
On a C. de Boor's Conjecture in a Particular Case and Related Perturbation
inferred← citeshttps://doi.org/10.48550/arxiv.1111.0732openalex-snapshot
Generating Loop Invariants by Computing Vanishing Ideals of Sample Points
inferred← citeshttps://doi.org/10.48550/arxiv.1304.7045openalex-snapshot
An Algorithm for Training Polynomial Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1308.2371openalex-snapshot
Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1774openalex-snapshot
A survey on signature-based Gröbner basis computations
inferred← citeshttps://doi.org/10.48550/arxiv.1805.09165openalex-snapshot
Combinatorics of ideals of points: a Cerlienco-Mureddu-like approach for an iterative lex game
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13189openalex-snapshot
Macaulay, Lazard and the Syndrome Variety
inferred← citeshttps://doi.org/10.48550/arxiv.2005.11439openalex-snapshot
Computing monomial interpolating basis for multivariate polynomial interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.2006.13881openalex-snapshot
Noetherian operators and primary decomposition
inferred← citeshttps://doi.org/10.48550/arxiv.2007.11830openalex-snapshot
Groebner basis structure of ideal interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.2111.07340openalex-snapshot
Computing Groebner bases of ideal interpolation
inferred← citeshttps://doi.org/10.48550/arxiv.math/0506045openalex-snapshot
On a Grobner bases structure associated to linear codes
inferred← citeshttps://doi.org/10.5402/2012/359069openalex-snapshot
The Discretization for a Special Class of Ideal Projectors
inferred← citeshttps://doi.org/10.70675/d8ca44b8zb45cz479az80a3zd34deb5c4454openalex-snapshot
Bases of relations in one or several variables : fast algorithms and applications
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.