Related papers: Collections of cells, binomial ideals and combinat…
We consider homogeneous binomial ideals $I=(f_1,\ldots,f_n)$ in $K[x_1, \ldots, x_n]$, where $f_i = a_i x_i^{d_i} - b_i m_i$ and $a_i \neq 0$. When such an ideal is a complete intersection, we show that the monomials which are not divisible…
We prove the componentwise linearity of ideals that satisfy a certain exchange property similar to polymatroidal ideals. We also discuss the componentwise linearity and exchange properties of ideals of $k$-covers of totally balanced…
We identify several classes of monomial ideals that possess minimal generalized Barile-Macchia resolutions. These classes of ideals include generic monomial ideals, monomial ideals with linear quotients, and edge ideals of hypertrees. We…
In this paper we study the primality of weakly connected collections of cells, showing that the ideal generated by inner 2-minors attached to a weakly connected and simple collection of cells is the toric ideal of the edge ring of a weakly…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic…
We study powers of binomial edge ideals associated with closed and block graphs.
We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…
Each graph and choice of a commutative ring gives rise to an associated graphical group. In this article, we introduce and investigate graph polynomials that enumerate conjugacy classes of graphical groups over finite fields according to…
We prove an index theorem for the quotient module of a monomial ideal. We obtain this result by resolving the monomial ideal by a sequence of Bergman space like essentially normal Hilbert modules.
Bipartite determinantal ideals are introduced by Illian and the author as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory and combinatorics.…
We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to…
We use the theory of poset resolutions to construct the minimal free resolution of an arbitrary stable monomial ideal in the polynomial ring whose coefficients are from a field. This resolution is recovered by utilizing a poset of…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
Mathematica offers, by way of the package Combinatorics, many useful functions to work on graphs and ordered structures, but none of these functions was specific enough to meet the needs of our research group. Moreover, the existing…
In this paper we discuss the problem of characterizing the Cohen-Macaulay property of certain families of monomial ideals with fixed radical. More precisely, we consider generically complete intersection monomial ideals whose radical…
In this article, we survey the recent results on the Castelnuovo-Mumford regularity of binomial edge ideals and generalized binomial edge ideals. We also generalize some of the known upper bounds for binomial edge ideals to the case of…
This article develops a theory of cell combinatorics and cell 2-representations for differential graded 2-categories. We introduce two types of partial preorders, called the strong and weak preorder. We then analyse and compare them. The…
Polynomials commute under composition are referred to as commuting polynomials. In this paper, we study division properties for commuting polynomials with rational (and integer) coefficients. As a consequence, we show an algebraic…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…