Add to ORKGThis article first presents two examples of algorithms that extracts information on scheme out of its defining equations. We also give a review on the notion of Castelnuovo-Mumford regularity, its main properties (in particular its relation to computational issues) and different ways that were used to estimate it
Let $K$ be an algebraically closed field of null characteristic and $p(z)$ a Hilbert polynomial. We ...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
We provide bounds on the Castelnuovo-Mumford regularity in terms of ``defining equations'' by using ...
AbstractWe here develop some new algorithms for computing several invariants attached to a projectiv...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
AbstractWe discuss an algorithm computing the push-forward to projective space of several classes as...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
In numerical algebraic geometry, a witness point set W is a key object for performing nu-merical com...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
Interest in linear programming has recently been intensified by the publication and discussion of a ...
Interest in linear programming has recently been intensified by the publication and discussion of a ...
In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials shown ...
We prove that the Castelnuovo-Mumford regularity of a projective C curve embedded in an n-dimensiona...
Abstract. The purpose of this paper is to give a simple geometric construction of ideals whose Caste...
Let $K$ be an algebraically closed field of null characteristic and $p(z)$ a Hilbert polynomial. We ...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
We provide bounds on the Castelnuovo-Mumford regularity in terms of ``defining equations'' by using ...
AbstractWe here develop some new algorithms for computing several invariants attached to a projectiv...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
AbstractThis article deals with algorithmic and structural aspects related to the computer-aided stu...
AbstractWe discuss an algorithm computing the push-forward to projective space of several classes as...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
In numerical algebraic geometry, a witness point set W is a key object for performing nu-merical com...
AbstractWe give an optimal lower bound in terms of large cardinal axioms for the logical strength of...
Interest in linear programming has recently been intensified by the publication and discussion of a ...
Interest in linear programming has recently been intensified by the publication and discussion of a ...
In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials shown ...
We prove that the Castelnuovo-Mumford regularity of a projective C curve embedded in an n-dimensiona...
Abstract. The purpose of this paper is to give a simple geometric construction of ideals whose Caste...
Let $K$ be an algebraically closed field of null characteristic and $p(z)$ a Hilbert polynomial. We ...
The Castelnuovo-Mumford regularity is one of the most important invariants in studying the minimal f...
We provide bounds on the Castelnuovo-Mumford regularity in terms of ``defining equations'' by using ...