Related papers: Normalization of Quaternionic Polynomials in Coord…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a…
In this contribution, we consider a zero-dimensional polynomial system in $n$ variables defined over a field $\mathbb{K}$. In the context of computing a Rational Univariate Representation (RUR) of its solutions, we address the problem of…
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…
In his Ph.D. thesis, Sean Griffin introduced a family of ideals and found monomial bases for their quotient rings. These rings simultaneously generalize the Delta Conjecture coinvariant rings of Haglund-Rhoades-Shimozono and the cohomology…
This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…
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 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…
Quaternions often appear in wide areas of applied science and engineering such as wireless communications systems, mechanics, etc. It is known that are two types of non-isomorphic generalized quaternion algebras, namely: the algebra of…
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…
A polynomial that is nonnegative need not be a sum of squares of polynomials. This classical gap, identified by Hilbert in 1888, lies at the heart of why the global optimization of multivariate quartic polynomials is NP-hard. Yet we show…
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…
A proof of Lagrange's and Jacobi's four-square theorem due to Hurwitz utilizes orders in a quaternion algebra over the rationals. Seeking a generalization of this technique to orders over number fields, we identify two key components: an…
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
We present foundational work on standard bases over rings and on Boolean Groebner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
Traditional formulations of geometric problems from the Schubert calculus, either in Plucker coordinates or in local coordinates provided by Schubert cells, yield systems of polynomials that are typically far from complete intersections and…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…