32,712 research outputs found
Stable Border Bases for Ideals of Points
Let be a set of points whose coordinates are known with limited accuracy;
our aim is to give a characterization of the vanishing ideal independent
of the data uncertainty. We present a method to compute a polynomial basis
of which exhibits structural stability, that is, if is
any set of points differing only slightly from , there exists a polynomial
set structurally similar to , which is a basis of the
perturbed ideal .Comment: This is an update version of "Notes on stable Border Bases" and it is
submitted to JSC. 16 pages, 0 figure
A polyhedral approach to computing border bases
Border bases can be considered to be the natural extension of Gr\"obner bases
that have several advantages. Unfortunately, to date the classical border basis
algorithm relies on (degree-compatible) term orderings and implicitly on
reduced Gr\"obner bases. We adapt the classical border basis algorithm to allow
for calculating border bases for arbitrary degree-compatible order ideals,
which is \emph{independent} from term orderings. Moreover, the algorithm also
supports calculating degree-compatible order ideals with \emph{preference} on
contained elements, even though finding a preferred order ideal is NP-hard.
Effectively we retain degree-compatibility only to successively extend our
computation degree-by-degree. The adaptation is based on our polyhedral
characterization: order ideals that support a border basis correspond
one-to-one to integral points of the order ideal polytope. This establishes a
crucial connection between the ideal and the combinatorial structure of the
associated factor spaces
Border bases for lattice ideals
The main ingredient to construct an O-border basis of an ideal I
K[x1,. .., xn] is the order ideal O, which is a basis of the K-vector space
K[x1,. .., xn]/I. In this paper we give a procedure to find all the possible
order ideals associated with a lattice ideal IM (where M is a lattice of Z n).
The construction can be applied to ideals of any dimension (not only
zero-dimensional) and shows that the possible order ideals are always in a
finite number. For lattice ideals of positive dimension we also show that,
although a border basis is infinite, it can be defined in finite terms.
Furthermore we give an example which proves that not all border bases of a
lattice ideal come from Gr\"obner bases. Finally, we give a complete and
explicit description of all the border bases for ideals IM in case M is a
2-dimensional lattice contained in Z 2 .Comment: 25 pages, 3 figures. Comments welcome!, MEGA'2015 (Special Issue),
Jun 2015, Trento, Ital
- …