17 citations · 18 across the 6 of their papers we have counts for
6 papers
A partial characterization of Hilbert quasi-polynomials in the non-standard case
Massimo Caboara, Carla Mascia
The Hilbert function, its generating function and the Hilbert polynomial of a graded ring R have been extensively studied since the famous paper of Hilbert: Ueber die Theorie der a…
Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm
Massimo Caboara, John Perry
The dynamic algorithm to compute a Gröbner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no publish…
Computing Inhomogeneous Groebner Bases
A. M. Bigatti, M. Caboara, L. Robbiano
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
Odd-Cycle-Free Facet Complexes and the König property
Massimo Caboara, Sara Faridi
We use the definition of a simplicial cycle to define an odd-cycle-free facet complex (hypergraph). These are facet complexes that do not contain any cycles of odd length. We show…
Simplicial cycles and the computation of simplicial trees
Massimo Caboara, Sara Faridi, Peter Selinger
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a…
Efficiently Computing Minimal Sets of Critical Pairs
M. Caboara, M. Kreuzer, L. Robbiano
In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pai…