3 citations · 9 across the 19 of their papers we have counts for
5 papers · 1 filter
Combinatorics of ideals of points: a Cerlienco-Mureddu-like approach for an iterative lex game
M. Ceria
In 1990 Cerlienco and Mureddu gave a combinatorial iterative algorithm which, given an ordered set of points, returns the lexicographical Groebner escalier of the ideal of these po…
Combinatorics of involutive divisions
Michela Ceria
The classical involutive division theory by Janet decomposes in the same way both the ideal and the escalier. The aim of this paper, following Janet's approach, is to discuss the c…
A general framework for Noetherian well ordered polynomial reductions
Michela Ceria, Teo Mora, Margherita Roggero
Polynomial reduction is one of the main tools in computational algebra with innumerable applications in many areas, both pure and applied. Since many years both the theory and an e…
Term-ordering free involutive bases
Michela Ceria, Teo Mora, Margherita Roggero
In this paper, we consider a monomial ideal J in P := A[x1,...,xn], over a commutative ring A, and we face the problem of the characterization for the family Mf(J) of all homogeneo…
A simplified version of the "Axis of Evil Theorem" for distinct points
Michela Ceria
Given a finite set of distinct points, Marinari-Mora's 'Axis of Evil Theorem' states that a combinatorial algorithm and interpolation enable to find a 'linear' factori…