Related papers: Deformations of Border Bases
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…
The computation of amoebas has been a challenging open problem for the last dozen years. The most natural approach, namely to compute an amoeba via its boundary, has not been practical so far since only a superset of the boundary, the…
Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…
We develop some basic facts on deformations of exterior differential ideals on a smooth complex algebraic variety. With these tools we study deformations of several types of differential ideals, leading to several irreducible components of…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
Boundary groupoids were introduced by the second author, which can be used to model many analysis problems on singular spaces. In order to investigate index theory on boundary groupoids, we introduce the notion of {\em a deformation from…
The main purpose of this paper is to lay the foundations of a general theory which encompasses the features of the classical Hough transform and extend them to general algebraic objects such as affine schemes. The main motivation comes from…
Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…
In this paper we develop the basic infinitesimal deformation theory of abelian categories. This theory yields a natural generalization of the well-known deformation theory of algebras developed by Gerstenhaber. As part of our deformation…
Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…
In this paper we introduce a working generalization of the theory of Gr\"obner bases for algebras of partial difference polynomials with constant coefficients. One obtains symbolic (formal) computation for systems of linear or non-linear…
Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
In this thesis we consider the geometry of the Hilbert scheme of points in P^n, concentrating on the locus of points corresponding to the Gorenstein subschemes of P^n. New results are given, most importantly we provide tools for…
Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…
The main purpose of this article is to develop an explicit derived deformation theory of algebraic structures at a high level of generality, encompassing in a common framework various kinds of algebras (associative, commutative, Poisson...)…
Border complexity captures functions that can be approximated by low-complexity ones. Debordering is the task of proving an upper bound on some non-border complexity measure in terms of a border complexity measure, thus getting rid of…
In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…