AbstractWe present an algorithm along with implementation details and timing data for computing the Hilbert function of a monomial ideal. Our algorithm is often substantially faster in practice than existing algorithms, and executes in linear time when applied to an initial monomial ideal in generic coordinates. The algorithm generalizes to compute multi-graded Hilbert functions
International audienceIn this paper, it is shown that the Hilbert series of a Borel type ideal may b...
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing...
Hilbert functions developed from classical mathematical concepts. In algebraic geometry, the coeffic...
AbstractWe present an algorithm along with implementation details and timing data for computing the ...
We describe a new algorithm for computing standard and multi-graded Hilbert-Poincare series of a mon...
AbstractWe describe a new algorithm for computing standard and multi-graded Hilbert-Poincaré series ...
The Hilbert function for any graded module over a field k is defined by the dimension of all of the ...
International audienceIn this paper, it is shown that the Hilbert series of a Borel type ideal may b...
The aim of this thesis is to introduce the reader to the theory of affine monoids and, thereby, to p...
AbstractIn this paper we show how to use the knowledge of the Hilbert–Poincaré series of an idealIto...
AbstractWe describe a new algorithm for computing standard and multi-graded Hilbert-Poincaré series ...
The Hilbert function for any graded module over a field k is defined by the dimension of all of the ...
We prove a theorem, which provides a formula for the computation of the Poincaré series of a monomia...
We prove a theorem, which provides a formula for the computation of the Poincar\'e series of a monom...
The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Di...
International audienceIn this paper, it is shown that the Hilbert series of a Borel type ideal may b...
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing...
Hilbert functions developed from classical mathematical concepts. In algebraic geometry, the coeffic...
AbstractWe present an algorithm along with implementation details and timing data for computing the ...
We describe a new algorithm for computing standard and multi-graded Hilbert-Poincare series of a mon...
AbstractWe describe a new algorithm for computing standard and multi-graded Hilbert-Poincaré series ...
The Hilbert function for any graded module over a field k is defined by the dimension of all of the ...
International audienceIn this paper, it is shown that the Hilbert series of a Borel type ideal may b...
The aim of this thesis is to introduce the reader to the theory of affine monoids and, thereby, to p...
AbstractIn this paper we show how to use the knowledge of the Hilbert–Poincaré series of an idealIto...
AbstractWe describe a new algorithm for computing standard and multi-graded Hilbert-Poincaré series ...
The Hilbert function for any graded module over a field k is defined by the dimension of all of the ...
We prove a theorem, which provides a formula for the computation of the Poincaré series of a monomia...
We prove a theorem, which provides a formula for the computation of the Poincar\'e series of a monom...
The ways of using the Elliot–MacMahon algorithm to compute the Hilbert base of a system of linear Di...
International audienceIn this paper, it is shown that the Hilbert series of a Borel type ideal may b...
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing...
Hilbert functions developed from classical mathematical concepts. In algebraic geometry, the coeffic...
DOI
Add to ORKG