Related papers: Gr\"obner Bases for Schubert Codes
One of the main contributions which Volker Weispfenning made to mathematics is related to Groebner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational…
We study the combinatorics of Gr\"obner degenerations of Grassmannians and the Schubert varieties inside them. We provide a family of binomial ideals whose combinatorics is governed by tableaux induced by matching fields in the sense of…
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
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…
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
We consider the problem of inference in higher-order undirected graphical models with binary labels. We formulate this problem as a binary polynomial optimization problem and propose several linear programming relaxations for it. We compare…
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…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
We propose an innovative approach to investigating the linearity of $\mathbb{Z}_{2^L}$-linear codes derived from $\mathbb{Z}_{2^L}$-additive codes using the generalized Gray map. To achieve this, we define two related binary codes: the…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
The extended definition of the polynomial B-splines may give a chance to improve the results obtained by the classical cubic polynomial B-splines. Determination of the optimum value of the extension parameter can be achieved by scanning…
In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…
The Schubert varieties on a flag manifold G/P give rise to a cell decomposition on G/P whose Kronecker duals, known as the Schubert classes on G/P, form an additive base of the integral cohomology of G/P. The Schubert's problem of…
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).
We describe a large-scale computational experiment to study structure in the numbers of real solutions to osculating instances of Schubert problems. This investigation uncovered Schubert problems whose computed numbers of real solutions…
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…
Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…
It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…
We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan's list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The…
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…