Related papers: Dimension-Dependent Upper Bounds for Grobner Bases

Given a monomial ideal in a polynomial ring over a field, we define the generalized Newton complementary dual of the given ideal. We show good properties of such duals including linear quotients and isomorphisms between the special fiber…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

It is known that the initial ideals of generic ideals are the same. Moreno-Soc\'{i}as conjectured that the initial ideal of generic ideals with respect to the degree reverse lexicographic order is weakly reverse lexicographic. In the first…

A set of polynomials G in a polynomial ring S over a field is said to be a universal Groebner basis, if G is a Groebner basis with respect to every term order on S. Twenty years ago Bernstein, Sturmfels, and Zelevinsky proved that the set…

Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing…

We derive new bounds for the Castelnuovo-Mumford regularity of the ideal sheaf of a complex projective manifold of any dimension. They depend linearly on the coefficients of the Hilbert polynomial, and are optimal for rational scrolls, but…

Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…

For Arithmetization-Oriented ciphers and hash functions Gr\"obner basis attacks are generally considered as the most competitive attack vector. Unfortunately, the complexity of Gr\"obner basis algorithms is only understood for special…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

Let $I$ be a homogeneous ideal in a polynomial ring $S$. In this paper, we extend the study of the asymptotic behavior of the minimum distance function $\delta_I$ of $I$ and give bounds for its stabilization point, $r_I$, when $I$ is an…

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…

In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…

In this paper, we extend a result of Eisenbud-Reeves-Totaro in the frame of ideals of Borel type. As a consequence, we obtain a linear upper bound for the regularity of a new class of ideals, called $\mathcal D$-fixed ideals.

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…

We generalize a result of Eisenbud-Huneke-Ulrich on the maximal graded shifts of a module with prescribed annihilator and prove a linear regularity bound for ideals in a polynomial ring depending only on the first $p - c$ steps in the…

Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

We prove a formula for the degrees of Ikeda and Naruse's $P$-Grothendieck polynomials using combinatorics of shifted tableaux. We show this formula can be used in conjunction with results of Hamaker, Marberg, and Pawlowski to obtain an…