English
Related papers

Related papers: Fine multidegrees, universal Grobner bases, and ma…

200 papers

Let $J\subset S=K[x_0,...,x_n]$ be a monomial strongly stable ideal. The collection $\Mf(J)$ of the homogeneous polynomial ideals $I$, such that the monomials outside $J$ form a $K$-vector basis of $S/I$, is called a {\em $J$-marked…

Commutative Algebra · Mathematics 2012-07-31 Cristina Bertone , Francesca Cioffi , Paolo Lella , Margherita Roggero

We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…

Commutative Algebra · Mathematics 2023-07-19 Clemens Hofstadler , Thibaut Verron

Computation of parallel lines (envelopes) to parabolas, ellipses, and hyperbolas is of importance in structure engineering and theory of mechanisms. Homogeneous polynomials that implicitly define parallel lines for the given offset to a…

Algebraic Geometry · Mathematics 2007-05-23 RafałAbłamowicz , Jane Liu

Involution Schubert polynomials represent cohomology classes of $K$-orbit closures in the complete flag variety, where $K$ is the orthogonal or symplectic group. We show they also represent $T$-equivariant cohomology classes of subvarieties…

Combinatorics · Mathematics 2022-11-09 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

We study Schubert polynomials using geometry of infinite-dimensional flag varieties and degeneracy loci. Applications include Graham-positivity of coefficients appearing in equivariant coproduct formulas and expansions of back-stable and…

Algebraic Geometry · Mathematics 2025-02-19 David Anderson

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

Commutative Algebra · Mathematics 2015-08-06 Dereje Kifle Boku , Claus Fieker , Wolfram Decker , Andreas Steenpass

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

Commutative Algebra · Mathematics 2016-09-15 Christian Eder , Gerhard Pfister , Adrian Popescu

A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…

Symbolic Computation · Computer Science 2009-11-11 Vladimir P. Gerdt , Daniel Robertz

Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…

Commutative Algebra · Mathematics 2010-05-05 Margherita Roggero

In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…

Commutative Algebra · Mathematics 2012-08-02 Julio José Moyano-Fernández , Jan Uliczka

We upper bound the number of common zeros over a finite grid of multivariate polynomials and an arbitrary finite collection of their consecutive Hasse derivatives (in a coordinate-wise sense). To that end, we make use of the tool from…

Information Theory · Computer Science 2017-07-06 Olav Geil , Umberto Martínez-Peñas

Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…

Commutative Algebra · Mathematics 2014-05-08 Natalia Dück , Karl-Heinz Zimmermann

In this paper, we introduce Schubert decompositions for quiver Grassmannians and investigate example classes of quiver Grassmannians with a Schubert decomposition into affine spaces. The main theorem puts the cells of a Schubert…

Algebraic Geometry · Mathematics 2013-03-29 Oliver Lorscheid

We develop a Gr\"obner basis theory for a class of algebras that generalizes both PBW-algebras and rings of differential algebras on smooth varieties. Emphasis lies on methods to compute filtrations and graded structures defined by weight…

Rings and Algebras · Mathematics 2018-09-28 Cornelia Rottner , Mathias Schulze

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

Rings and Algebras · Mathematics 2012-12-11 Christian Dönch , Alexander Levin

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…

Commutative Algebra · Mathematics 2023-06-06 Xin Ren , Kohji Yanagawa

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…

Symbolic Computation · Computer Science 2020-07-02 Rina Dong , Dongming Wang

We give a closed-form formula for the Hilbert function of the tangent cone at the identity of a Schubert variety X in the Grassmannian in both group theoretic and combinatorial terms. We also give a formula for the multiplicity of X at the…

Algebraic Geometry · Mathematics 2007-05-23 V. Kreiman , V. Lakshmibai

We give new formulas for Grothendieck polynomials of two types. One type expresses any specialization of a Grothendieck polynomial in at least two sets of variables as a linear combination of products Grothendieck polynomials in each set of…

Combinatorics · Mathematics 2010-03-29 Cristian Lenart , Shawn Robinson , Frank Sottile