Related papers: A Combinatorial Algorithm to Find the Minimal Free…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…
Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…
In this paper, we find an explicit combinatorial criterion for the existence of a nonzero GL_{n-1}(K)-high weight vector of weight (\lambda_1,...,\lambda_{i-1},\lambda_i-d,\lambda_{i+1},..., \lambda_{n-1}), where d<char K and K is an…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
In this article we study the combinatorics of congruence subgroups of the modular group. We consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of Coxeter friezes),…
We study quotients of the Weyl algebra by left ideals whose generators consist of an arbitrary Z^d-graded binomial ideal I along with Euler operators defined by the grading and a parameter in C^d. We determine the parameters for which these…
We generalize the polynomial-time solvability of $k$-\textsc{Diverse Minimum s-t Cuts} (De Berg et al., ISAAC'23) to a wider class of combinatorial problems whose solution sets have a distributive lattice structure. We identify three…
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…
We consider a combinatorial question about searching for an unknown ideal $\mu$ within a known poset $\lambda$. Elements of $\lambda$ may be queried for membership in $\mu$, but at most $k$ positive query results are permitted. The goal is…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…
Let K be a field, let R=K[x_1,..., x_m] be a polynomial ring with the standard Z^m-grading (multigrading), let L be a Noetherian multigraded R-module, and let F: E --> G be a finite free multigraded presentation of L over R. Given a choice…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
We develop combinatorial tools to study the relationship between the Stanley depth of a monomial ideal $I$ and the Stanley depth of its compliment, $S/I$. Using these results we are able to prove that if $S$ is a polynomial ring with at…
We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is…
Let $A=K[a_1,\ldots,a_n]$ be a weighted $\mathbb{N}$-filtered solvable polynomial algebra with filtration $FA=\{ F_pA\}_{p\in\mathbb{N}}$, where solvable polynomial algebras are in the sense of (A. Kandri-Rody and V. Weispfenning,…
Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…