Related papers: Taylor and Lyubeznik Resolutions via Grobner Bases

We compute the linear strand of the minimal free resolution of the ideal generated by k x k sub-permanents of an n x n generic matrix and of the ideal generated by square-free monomials of degree k. The latter calculation gives the full…

In this paper, we discuss the normality of the toric rings of stable set polytopes, and the set of generators and Gr\"obner bases of toric ideals of stable set polytopes by using the results on that of edge polytopes of finite nonsimple…

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…

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 = ( f_1, \dots, f_n )$ be a homogeneous ideal in the polynomial ring $K[x_1, \dots,x_n]$ over a field $K$ generated by generic polynomials. Using an incremental approach based on a method by Gao, Guan and Volny, and properties of the…

Let (\Pi,\Sigma) be a Coxeter system. An ordered list of elements in \Sigma and an element in \Pi determine a {\em subword complex}, as introduced in our paper on Gr\"obner geometry of Schubert polynomials (math.AG/0110058). Subword…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

We generalize the Stein-Tomas [17] $L^2$-restricition theorem and the uniform Sobolev estimates of Kenig, Ruiz and the second author [11] by allowing critically singular potential. We also obtain Strichartz estimates for Schr\"odinger and…

We prove that the defining ideal of a sufficiently high Veronese subring of a toric algebra admits a quadratic Gr\"obner basis consisting of binomials. More generally, we prove that the defining ideal of a sufficiently high Veronese subring…

There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…

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…

Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…

The aim of this paper is to study the relationship between reduction numbers and Borel-fixed ideals in all characteristics. By definition, Borel-fixed ideals are closed under certain specializations which is similar to the strong stability.…

We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common…

A beautiful degree formula for the Grothendieck polynomials was recently given by Pechenik, Speyer, and Weigandt (2021). We provide an alternative proof of their degree formula, utilizing the climbing chain model for Grothendieck…

We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal…

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Over a field of characteristic two, we develop a theory of standard monomials for polynomial rings modulo a Frobenius power of the maximal ideal generated by all variables. As a result, we obtain a filtration by modular GL_n-representations…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…