Related papers: Lattices and Hypergraphs associated to square-free…
In the present paper we study algebraic properties of edge ideals associated with plane curve arrangements via their Levi graphs. Using combinatorial properties of such Levi graphs we are able to describe those monomial algebras being…
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. Suppose that $\mathcal{C}$ is a chordal clutter with $n$ vertices and assume that the minimum edge…
Let $S = k[x_{11}, \cdots, x_{1b_1}, \cdots, x_{n1}, \cdots, x_{nb_n}]$ be a polynomial ring in $m = b_1 + \cdots + b_n$ variables over a field $k$. For all $j$, $1\le j \le n$, let $P_j$ be the prime ideal generated by variables $\{x_{j1},…
For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough symmetry, we can construct a provably deterministic polynomial-time algorithm to accomplish…
We survey some recent results on the minimal graded free resolution of a square-free monomial ideal. The theme uniting these results is the point-of-view that the generators of a monomial ideal correspond to the maximal faces (the facets)…
Let $\mathbb{K}$ be a field, and let $S=\mathbb{K}[X_1, ..., X_n]$ be the polynomial ring. Let $I$ be a monomial ideal of $S$ with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that…
Let $I\supsetneq J$ be two squarefree monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . Suppose that $I$ is either generated by three monomials of degrees $d$ and a set of monomials of…
To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of…
This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…
In this paper, we draw a connection between ideal lattices and Gr\"{o}bner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in $\mathbb{Z}[x]/\langle f \rangle$ (Lyubashevsky \& Micciancio,…
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
In this paper we study squarefree monomial ideals which have constant depth functions. Edge ideals, matroidal ideals and facet ideals of pure simplicial forests connected in codimension one with this property are classified.
Given a graph $G$ on the vertex set $\{0,1,\ldots,n\}$ with the root vertex $0$, Postnikov and Shapiro associated a monomial ideal $\mathcal{M}_G$ in the polynomial ring $R=\mathbb{K}[x_1,\ldots,x_n]$ over a field $\mathbb{K}$ such that…
The purpose of this paper is to provide methods for determining the associated primes of the square of the Alexander dual of the edge ideal for an m-hypergraph H. We prove a general method for detecting associated primes of the square of…
A convex set with nonempty interior is maximal lattice-free if it is inclusion-maximal with respect to the property of not containing integer points in its interior. Maximal lattice-free convex sets are known to be polyhedra. The precision…
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…
The symmetric edge polytope of a simple graph is a lattice polytope defined as the convex hull of a subset of the type A roots corresponding to the edges of the graph. In this article we prove a sharp lower bound for the number of edges of…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…
For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…