Related papers: Computing Groebner Fans
Solving multihomogeneous systems, as a wide range of structured algebraic systems occurring frequently in practical problems, is of first importance. Experimentally, solving these systems with Gr\"obner bases algorithms seems to be easier…
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…
We propose an algorithm to compute the GIT-fan for torus actions on affine varieties with symmetries. The algorithm combines computational techniques from commutative algebra, convex geometry and group theory. We have implemented our…
The $\mathbf{g}$-vector fan of a finite-dimensional algebra is a fan whose rays are the $\mathbf{g}$-vectors of its $2$-term presilting objects. We prove that the $\mathbf{g}$-vector fan of a tame algebra is dense. We then apply this result…
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
We derive a graded character formula for the action of any finite group on the Artinian reduction of the Stanley--Reisner ring of any complete simplicial fan, which is given by an equivariant version of the classical h-polynomial. This…
In this paper, a polynomial-time algorithm is given to compute the generalized Hermite normal form for a matrix F over Z[x], or equivalently, the reduced Groebner basis of the Z[x]-module generated by the column vectors of F. The algorithm…
In this article we compute a minimal Groebner basis for the symmetric algebra for certain affine Monomial Curves, as an R-module. Keywords: Monomial Curves, Groebner Basis, Symmetric Algebra. Mathematics Subject Classification 2000: 13P10,…
By employing the (de)homogenization technique in a relatively extensive setting, this note studies in detail the relation between non-homogeneous Gr\"obner bases and homogeneous Gr\"obner bases. As a consequence, a general principle of…
Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…
We present a novel method to perform numerical integration over curved polyhedra enclosed by high-order parametric surfaces. Such a polyhedron is first decomposed into a set of triangular and/or rectangular pyramids, whose certain faces…
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
We present an algorithm which converts a given Sagbi basis of a polynomial $K$-subalgebra $\mathcal{A}$ to a Sagbi basis of $\mathcal{A}$ in a polynomial ring with respect to another term ordering, under the assumption that subalgebra…
Associated to any divisor in the Chow ring of a simplicial tropical fan, we construct a family of polytopal complexes, called normal complexes, which we propose as an analogue of the well-studied notion of normal polytopes from the setting…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
The goal of this article is to give a Lefschetz type decomposition for the cd-index of a complete fan. To a complete simplicial fan one can associate a toric variety X, the even Betti numbers h_i of X and the numbers g_i = h_i-h_{i-1}. If…
A~$k$-associahedron is a simplicial complex whose facets, called~$k$-triangulations, are the inclusion maximal sets of diagonals of a convex polygon where no~$k+1$ diagonals mutually cross. Such complexes are conjectured for about a decade…
We present an algorithm for computing zero-dimensional tropical varieties using projections. Our main tools are fast unimodular transforms of lexicographical Gr\"obner bases. We prove that our algorithm requires only a polynomial number of…