Related papers: The F5 Criterion revised
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
The notion off-ideals is recent and has been studied in the papers[1] [2], [5], [10], [11], [12], [13], [14] and [15]. In this paper, we have generalized the idea off-ideals to quasi f-ideals. This extended class of ideals is much bigger…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
These notes originate from a reading course held by the authors in the spring of 2024 at the Universit\`a di Genova. They provide a hands-on introduction to the F4 and FGLM algorithms. In addition to the notes, we present two…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…
Graeffe iteration was the choice algorithm for solving univariate polynomials in the XIX-th and early XX-th century. In this paper, a new variation of Graeffe iteration is given, suitable to IEEE floating-point arithmetics of modern digital…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…
Given a finite set $\mathbf{X}$ of distinct points, Marinari-Mora's 'Axis of Evil Theorem' states that a combinatorial algorithm and interpolation enable to find a 'linear' factorization for a lexicographical minimal Groebner basis…
Let $(R,\mathfrak{m},\Bbbk)$ be a regular local ring of dimension 3. Let $I$ be a Gorenstein ideal of $R$ of grade 3. It follows from a result of Buchsbaum and Eisenbud that there is a skew-symmetric matrix of odd size such that $I$ is…
Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximation scheme to estimate the probability that a graph $G$ becomes disconnected, given that its edges are removed independently with probability $p$. This…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
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…
We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…
We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…
An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the…
The theory of "subalgebra basis" analogous to standard basis (the generalization of Gr\"{o}bner bases to monomial ordering which are not necessarily well ordering \cite{GP1}.) for ideals in polynomial rings over a field is developed. We…
The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear…
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…
In this paper, we consider parametric ideals and introduce a notion of comprehensive involutive system. This notion plays the same role in theory of involutive bases as the notion of comprehensive Groebner system in theory of Groebner…