Related papers: Gr\"obner bases for bipartite determinantal ideals
We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…
Motivated by a recent conjecture by Hernandez and Leclerc [arXiv:0903.1452], we embed a Fomin-Zelevinsky cluster algebra [arXiv:math/0104151] into the Grothendieck ring R of the category of representations of quantum loop algebras U_q(Lg)…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…
For a partition $\lambda$ of $n$, the _Specht ideal_ $I_\lambda \subset K[x_1, \ldots, x_n]$ is the ideal generated by all Specht polynomials of shape $\lambda$. In their unpublished manuscript, Haiman and Woo showed that $I_\lambda$ is a…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
Border bases arise as a canonical generalization of Gr\"obner bases. We provide a polyhedral characterization of all order ideals (and hence border bases) that are supported by a zero-dimensional ideal: order ideals that support a border…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
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…
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…
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 generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…
This chapter combines an introduction and research survey about Schubert varieties. The theme is to combinatorially classify their singularities using a family of polynomial ideals generated by determinants.
Schubert patch ideals are a class of generalized determinantal ideals. They are prime defining ideals of open patches of Schubert varieties in the type $A$ flag variety. In this paper, we adapt the linkage-theoretic approach of E. Gorla, J.…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…
Hara, Takemura and Yoshida discuss toric ideals arising from two way subtable sum problems and shows that these toric ideals are generated by quadratic binomials if and only if the subtables are either diagonal or triangular. In the present…