Related papers: Computing Vanishing Ideals for Toric Codes

In this paper, we investigate the row-factorization matrices of Arf numerical semigroups, and we provide the full list of such matrices of certain Arf numerical semigroups. We use the information of row-factorization matrices to detect the…

We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…

For a discrete valuation domain $V$ with maximal ideal $\mathfrak{m}$ such that the residue field $V/\mathfrak{m}$ is finite, there exists a sequence of polynomials $(F_n(x))_{n \ge 0}$ defined over the quotient field $K$ of $V$ that forms…

In this paper we show that the agglomeration of rows or columns of a contingency table with a hierarchical clustering algorithm yields statistical models defined through toric ideals. In particular, starting from the classical independence…

In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…

We propose an effective algorithm that decides if a prime ideal in a polynomial ring over the complex numbers can be transformed into a toric ideal by a linear automorphism of the ambient space. If this is the case, the algorithm computes…

For a degree 2n finite sequence of real numbers $\beta \equiv \beta^{(2n)}= \{ \beta_{00},\beta_{10}, \beta_{01},\cdots, \beta_{2n,0}, \beta_{2n-1,1},\cdots, \beta_{1,2n-1},\beta_{0,2n} \}$ to have a representing measure $\mu $, it is…

The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…

We study certain groups and ideals arising from the chip-firing game on a generalisation of graphs called pargraphs. Several well-known families of toric ideals arise as toppling ideals of pargraphs. These include ideals defining rational…

In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…

Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

We present a new algorithm for computing the real radical of an ideal and, more generally, the-radical of, which is based on convex moment optimization. A truncated positive generic linear functional vanishing on the generators of is…

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…

In this paper we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context two different approaches…

In this article, we study monomial curves, toric ideals and monomial algebras associated to $4$-generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization for…

In this note, we show that the decomposition group $Dec(I)$ of a zero-dimensional radical ideal $I$ in ${\bf K}[x_1,\ldots,x_n]$ can be represented as the direct sum of several symmetric groups of polynomials based upon using Gr\"{o}bner…