Related papers: Separating Variables in Bivariate Polynomial Ideal…

Let $S=K[x_1, \ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and let $I \subset S$ be a monomial ideal. For a vector $\mathfrak{c}\in\mathbb{N}^n$, we set $I_{\mathfrak{c}}$ to be the ideal generated by monomials…

A space $X$ is H-separable (Bella et al., 2009) if for every sequence $(Y_n)$ of dense subspaces of $X$ there exists a sequence $(F_n)$ such that for each $n$ $F_n$ is a finite subset of $Y_n$ and every nonempty open set of $X$ intersects…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

We investigate the problem of deciding whether the restriction of a rational function $r\in\mathbb{K}(x,y)$ to the curve associated with an irreducible polynomial $p\in\mathbb{K}[x,y]$ is the restriction of an element of…

The multiview variety of an arrangement of cameras is the Zariski closure of the images of world points in the cameras. The prime vanishing ideal of this complex projective variety is called the multiview ideal. We show that the bifocal and…

Let g be a complex reductive Lie algebra and U(g) the universal enveloping algebra of g. Associated to a faithful irreducible finite dimensional representation of g, a square matrix F with entries in U(g) naturally arises and if we consider…

Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial…

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

A square-free monomial ideal $I$ of $k[x_1,\ldots,x_n]$ is said to be an $f$-ideal if the facet complex and non-face complex associated with $I$ have the same $f$-vector. We show that $I$ is an $f$-ideal if and only if its Newton…

Based on the partition of parameter space, two algorithms for computing the rational univariate representation of zero-dimensional ideals with parameters are presented in the paper. Unlike the rational univariate representation of…

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial…

The spectrum $\omega(G)$ of a finite group $G$ is the set of orders of elements of $G$. We present a polynomial-time algorithm that, given a finite set $\mathcal M$ of positive integers, outputs either an empty set or a finite simple group…

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

The problem of finding independent components of an indexed object (e.g., a tensor) with arbitrary number of indices and arbitrary linear symmetries is discussed. It is proved that the number of independent components $f(k)$ is a polynomial…

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

Building on coprincipal mesoprimary decomposition [Kahle and Miller, 2014], we combinatorially construct an irreducible decomposition of any given binomial ideal. In a parallel manner, for congruences in commutative monoids we construct…