Related papers: Right Buchberger algorithm over bijective skew PBW…
In this paper we prove the universal property of skew $PBW$ extensions generalizing this way the well known universal property of skew polynomial rings. For this, we will show first a result about the existence of this class of…
Birkenmeier and Heider, in [2], say that a ring R is right cP-Baer if the right annihilator of a cyclic projective right R-module in R is generated by an idempotent. These rings are a generalization of the right p.q.-Baer and abelian rings.…
We investigate the reduction of Feynman integrals to master integrals using Gr\"obner bases in a rational double-shift algebra Y in which the integration-by-parts (IBP) relations form a left ideal. The problem of reducing a given family of…
List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…
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 give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…
Many rings and algebras arising in quantum mechanics can be interpreted as skew PBW (Poincar\'e-Birkhoff-Witt) extensions. Indeed, Weyl algebras, enveloping algebras of finite-dimensional Lie algebras (and its quantization), Artamonov…
This paper involves categories and computer science. The paper is motivated by a question which arises from two pieces of research. Firstly, the work of Brown and Heyworth which extends rewriting techniques to enable the computation of left…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…
An approximation result for the bilinear Hilbert transform is proved and used for the inversion of the bilinear Hilbert transform. Also, p-Lebesgue points $(p\geq 1)$ are analyzed.
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
In this paper we study the computational feasibility of an algorithm to prove orbifold equivalence between potentials describing Landau-Ginzburg models. Through a comparison with leading results of Groebner basis computations in cryptology,…
In this paper we introduce an algebra embedding $\iota:K< X >\to S$ from the free associative algebra $K< X >$ generated by a finite or countable set $X$ into the skew monoid ring $S = P * \Sigma$ defined by the commutative polynomial ring…
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
We propose two optimization-based heuristics for structure selection and identification of PieceWise Affine (PWA) models with exogenous inputs. The first method determines the number of affine sub-models assuming known model order of the…
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…
In this work we study the automorphisms of skew $PBW$ extensions and skew quantum polynomials. We use Artamonov's works as reference for getting the principal results about automorphisms for generic skew $PBW$ extensions and generic skew…
Finitely generated modules over the polynomial ring in $n$ indeterminates are isomorphic to quotients of finite rank free modules. We introduce a theory of relative Gr\"obner bases for those quotients of free modules and, equivalently, for…
We present a $p$-adic algorithm to recover the lexicographic Gr\"obner basis $\mathcal G$ of an ideal in $\mathbb Q[x,y]$ with a generating set in $\mathbb Z[x,y]$, with a complexity that is less than cubic in terms of the dimension of…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…