Related papers: On the Connection Between Ritt Characteristic Sets…

Signature-based algorithms are the latest and most efficient approach as of today to compute Gr\"obner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention…

In this paper, we investigate characteristic polynomials of matrices in min-plus algebra. Eigenvalues of min-plus matrices are known to be the minimum roots of the characteristic polynomials based on tropical determinants which are designed…

We study the connection between probability distributions satisfying certain conditional independence (CI) constraints, and point and line arrangements in incidence geometry. To a family of CI statements, we associate a polynomial ideal…

Let $A$ and $B$ be standard graded polynomial rings over a field $k$ and $I$ and $J$ be non-zero, proper homogeneous ideals contained in $A$ and $B$, respectively. Denote by $P$ the sum of $I$ and $J$ in $R=A\otimes_k B$. Under reasonable…

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of…

We study a family of monomial ideals, called block diagonal matching field ideals, which arise as monomial Gr\"obner degenerations of determinantal ideals. Our focus is on the minimal free resolutions of these ideals and all of their…

With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…

We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…

We extend a result of Caviglia and Sbarra to a polynomial ring with base field of any characteristic. Given a homogeneous ideal containing both a piecewise lex ideal and an ideal generated by powers of the variables, we find a lex ideal…

The paper introduces the class of split regular BiHom-Poisson superalgebras, which is a natural generalization of split regular Hom-Poisson algebras and split regular BiHom-Lie superalgebras. By developing techniques of connections of roots…

We explore a family of monomial ideals derived as Gr\"obner degenerations of determinantal ideals. These ideals, previously examined as block diagonal matching field ideals within the realm of toric degenerations of Grassmannians, are…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik…

Let GradAlg(H) be the scheme parameterizing graded quotients of R=k[x_0,...,x_n] with Hilbert function H (it is a subscheme of the Hilbert scheme of P^n if we restrict to quotients of positive dimension, see definition below). A graded…

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…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…