Related papers: A Gr\"{o}bner Basis Approach to Combinatorial Null…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…

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 paper we prove a strong version of the Hilbert Nullstellensatz in the ring $\mathbb H[q_1,\ldots,q_n]$ of slice regular polynomials in several quaternionic variables. Our proof deeply depends on a detailed analysis of the common…

We introduce the sequence of generalized Gon\v{c}arov polynomials, which is a basis for the solutions to the Gon\v{c}arov interpolation problem with respect to a delta operator. Explicitly, a generalized Gon\v{c}arov basis is a sequence…

We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular application. The first approach uses techniques from algebraic…

A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…

For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…

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…

In this paper, we consider the following problem: what is the minimum number of affine hyperplanes in $\mathbb{R}^n$, such that all the vertices of $\{0, 1\}^n \setminus \{\vec{0}\}$ are covered at least $k$ times, and $\vec{0}$ is…

Hilbert's Nullstellensatz is one of the most fundamental correspondences between algebra and geometry, and has inspired a plethora of noncommutative analogs. In last two decades, there has been an increased interest in understanding…

We prove that in every variety of $G$-groups, every $G$-existentially closed element satisfies nullstellensatz for finite consistent systems of equations. This will generalize {\bf Theorem G} of \cite{BMR1}. As a result we see that every…

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

Previous work by Mora and Sala provides the reduced Groebner basis of the ideal formed by the elementary symmetric polynomials in $n$ variables of degrees $k=1,\dots,n$, $\langle e_{1,n}(x), \dots, e_{n,n}(x) \rangle$. Haglund, Rhoades, and…

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…

In this paper we prove a Nullstellensatz for supersymmetric polynomials. This gives a bijection between radical ideals and superalgebraic sets. These are algebraic sets which are invariant under the Weyl groupoid of Sergeev and Veselov,…

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

We study zeros of polynomials in the multivariate skew polynomial ring $D[x_1,\ldots,x_n; \sigma]$, where $\sigma$ is an automorphism of a division ring $D$. We prove a generalization of Alon's celebrated Combinatorial Nullstellensatz for…