Related papers: DG-Sensitive Pruning & a Complete Classification o…

Let $I(G)^{[k]}$ denote the $k$th squarefree power of the edge ideal of $G$. When $G$ is a forest, we provide a sharp upper bound for the regularity of $I(G)^{[k]}$ in terms of the $k$-admissable matching number of $G$. For any positive…

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…

In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…

Let g be a complex reductive Lie algebra and U(g) the universal enveloping algebra of g. Associated to a faithful irreducible finite dimensional representation of g, a square matrix F with entries in U(g) naturally arises and if we consider…

Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Let $R:= \Bbbk[x_1,\ldots,x_{n}]$ be a polynomial ring over a field $\Bbbk$, $I \subset R$ be a homogeneous ideal with respect to a weight vector $\omega = (\omega_1,\ldots,\omega_n) \in (\mathbb{Z}^+)^n$, and denote by $d$ the Krull…

We prove that in the polynomial ring $Q=\mathsf{k}[x,y,z,w]$, with $\mathsf{k}$ an algebraically closed field of characteristic zero, all Gorenstein homogeneous ideals $I$ such that $(x,y,z,w)^4\subseteq I \subseteq (x,y,z,w)^2$ can be…

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

Given a tree T on n vertices, there is an associated ideal I of a polynomial ring in n variables over a field, generated by all paths of a fixed length of T. We show that such an ideal always satisfies the Konig property and classify all…

A canonical minimal free resolution of an arbitrary co-artinian lattice ideal over the polynomial ring is constructed over any field whose characteristic is 0 or any but finitely many positive primes. The differential has a closed-form…

Every multigraded free resolution of a monomial ideal I contains the Scarf multidegrees of I. We say I has a Scarf resolution if the Scarf multidegrees are sufficient to describe a minimal free resolution of I. The main question of this…

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)…

An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…

For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

Let $P$ be a commutative Noetherian ring and $F$ be a self-dual acyclic complex of finitely generated free $P$-modules. Assume that $F$ has length four and $F_0$ has rank one. We prove that $F$ can be given the structure of a Differential…

In the total matching problem, one is given a graph $G$ with weights on the vertices and edges. The goal is to find a maximum weight set of vertices and edges that is the non-incident union of a stable set and a matching. We consider the…

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…

We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…