Related papers: A Combinatorial Approach to the Groebner Bases for…
A Comprehensive Grobner system for a parametric ideal I in K(A)[X] represents the collection of all Grobner bases of the ideals I' in K[X] obtained as the values of the parameters A vary in K. The recent algorithms for computing them…
We compute the primary decomposition of certain ideals generated by subsets of minors in a generic matrix or in a generic symmetric matrix, or subsets of Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we consider are…
Motivated by notions from coding theory, we study the generalized minimum distance (GMD) function $\delta_I(d,r)$ of a graded ideal $I$ in a polynomial ring over an arbitrary field using commutative algebraic methods. It is shown that…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…
The space $QSym_n(B)$ of $B$-quasisymmetric polynomials in 2 sets of $n$ variables was recently studied by Baumann and Hohlweg. The aim of this work is a study of the ideal $<QSym_n(B)^+>$ generated by $B$-quasisymmetric polynomials without…
Let S=K[x_1,...,x_n] be a polynomial ring. Denote by $p_a$ the power sum symmetric polynomial x_1^a+...+x_n^a. We consider the following two questions: Describe the subsets $A \subset \mathbb{N}$ such that the set of polynomials $p_a$ with…
We create several families of bases for the symmetric polynomials. From these bases we prove that certain Schur symmetric polynomials form a basis for quotients of symmetric polynomials that generalize the cohomology and the quantum…
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…
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…
This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…
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…
The W-characteristic set of a polynomial ideal is the minimal triangular set contained in the reduced lexicographical Groebner basis of the ideal. A pair (G,C) of polynomial sets is a strong regular characteristic pair if G is a reduced…
We give degree formulas for Grothendieck polynomials indexed by vexillary permutations and $1432$-avoiding permutations via tableau combinatorics. These formulas generalize a formula for degrees of symmetric Grothendieck polynomials which…
In a 2014 paper, R.E. Curto and S. Yoo proved that a moment matrix $M(3)$ with specific harmonic polynomials as column relations admits a representing measure if and only if a condition at the level of moments holds. \ In this paper, we…
In this paper the relation between Pommaret and Janet bases of polynomial ideals is studied. It is proved that if an ideal has a finite Pommaret basis then the latter is a minimal Janet basis. An improved version of the related algorithm…
Let $\mathbf{k}$ be a field which is either finite or algebraically closed and let $R = \mathbf{k}[x_1,\ldots,x_n].$ We prove that any $g_1,\ldots,g_s\in R$ homogeneous of positive degrees $\le d$ are contained in an ideal generated by an…
Polynomials with values in an irreducible module of the symmetric group can be given the structure of a module for the rational Cherednik algebra, called a standard module. This algebra has one free parameter and is generated by…
Subword complexes are simplicial complexes introduced by Knutson and Miller to illustrate the combinatorics of Schubert polynomials and determinantal ideals. They proved that any subword complex is homeomorphic to a ball or a sphere and…
We present a formalization of Gr\"obner basis theory in Lean 4, built on top of Mathlib's infrastructure for multivariate polynomials and monomial orders. Our development covers the core foundations of Gr\"obner basis theory, including…