A combinatorial description of finite O-sequences and aCM genera

The goal of this paper is to explicitly detect all the arithmetic genera of arithmetically Cohen-Macaulay projective curves with a given degree $d$. It is well-known that the arithmetic genus $g$ of a curve $C$ can be easily deduced from the $h$-vector of the curve; in the case where $C$ is arithmetically Cohen-Macaulay of degree $d$, $g$ must belong to the range of integers $\big\{0,\ldots,\binom{d-1}{2}\big\}$. We develop an algorithmic procedure that allows one to avoid constructing most of the possible $h$-vectors of $C$. The essential tools are a combinatorial description of the finite O-sequences of multiplicity $d$, and a sort of continuity result regarding the generation of the genera. The efficiency of our method is supported by computational evidence. As a consequence, we single out the minimal possible Castelnuovo-Mumford regularity of a curve with Cohen-Macaulay postulation and given degree and genus.Comment: Final versio

Segments and Hilbert schemes of points

Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the Hilbert scheme of points in $\mathbb{P}^n$. In this context, we look inside properties of several types of "segment" ideals that we define and compare. This study led us to focus our attention also to connections between the shape of generators of Borel ideals and the related Hilbert polynomial, providing an algorithm for computing all saturated Borel ideals with the given Hilbert polynomial.Comment: 19 pages, 2 figures. Comments and suggestions are welcome

Oracle-supported drawing of the Groebner {\em escalier}

The aim of this note is to discuss the following quite queer Problem: \noindent GIVEN \noindent i) the free non-commutative polynomial ring, {\Cal P} := {\Bbb F}\langle X_1,\ldots,X_n\rangle {\em (public)}, \noindent ii) a bilateral ideal ${\sf I}\subset {\Bbb F}\langle X_1,\ldots,X_n\rangle$ {\em (private)}, \noindent iii) a finite set $G := \{g_1,\ldots,g_l\}\subset{\sf I}$ of elements of the ideal ${\sf I}$ {\em (public)}, \noindent a noetherian semigroup term-ordering $\prec,$ {\rm (private)}, on the word semigroup {\Cal T} := , \noindent COMPUTE \noindent --a finite subset $H\subset\Gamma({\sf I})$ of the Gr\"obner basis $\Gamma({\sf I})$ of ${\sf I}$ w.r.t. $\prec$ s.t., for each $g_i\in G$ its {\em normal form} $NF(g_i,H)$ w.r.t. $H$ is zero, \noindent "by means of a finite number of queries to an oracle", which, \noindent given a term \tau\in{\Cal T} returns its {\em canonical form} \Can(\tau,{\sf I},\prec) w.r.t. the ideal ${\sf I}$ and the term-ordering $\prec$. \qed This queer problem has been suggested to us by Bulygin (2005) where a similar problem, but with stronger assumptions, is faced in order to set up a chosen-cyphertext attack against the cryptographic system proposed in Rai (2004)

The big mother of all dualities: Möller algorithm

Duality was introduced in Computer Algebra in 1982 by Möller and since that has been widely used. We give a survey of Möller algorithm and its applications, presenting a new one to the computation of canonical modules. "Its dual application" allow us to give answer to a question posed to us by Stette

Segments and Hilbert schemes of points

proprieta' dello schema di Hilbert di punt