Related papers: An indispensable classification of monomial curves…

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

Theorem 1.2.6 of [ATW20] provides a relatively functorial logarithmic principalization of ideals on relative logarithmic orbifolds $X\to B$ in characteristic 0, relying on a delicate monomialization theorem for Kummer ideals. The paper…

Let $G$ be a simple graph on $d$ vertices. We define a monomial ideal $K$ in the Stanley-Reisner ring $A$ of the order complex of the Boolean algebra on $d$ atoms. The monomials in $K$ are in one-to-one correspondence with the proper…

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…

A graph $G$ with four or more vertices is called bicritical if the removal of any pair of distinct vertices of $G$ results in a graph with a perfect matching. A bicritical graph is minimal if the deletion of each edge results in a…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

Let $\mm=(m_0,...,m_n)$ be an arithmetic sequence, i.e., a sequence of integers $m_0<...<m_n$ with no common factor that minimally generate the numerical semigroup $\sum_{i=0}^{n}m_i\N$ and such that $m_i-m_{i-1}=m_{i+1}-m_i$ for all…

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

The structure of the algebra K[M] of the Chinese monoid M over a field K is studied. The minimal prime ideals are described. They are determined by certain homogeneous congruences on M and they are in a one to one correspondence with…

We define and study the Picard group of a monoid scheme and the class group of a normal monoid scheme. To do so, we develop some ideal theory for (pointed abelian) noetherian monoids, including primary decomposition and discrete valuations.…

In this note, we introduce monoidal subcategories of the tensor category of finite-dimensional representations of a simply-laced quantum affine algebra, parametrized by arbitrary Dynkin quivers. For linearly oriented quivers of types A and…

The edges of any hypergraph parametrize a monomial algebra called the edge subring of the hypergraph. We study presentation ideals of these edge subrings, and describe their generators in terms of balanced walks on hypergraphs. Our results…

We consider a classification problem of ideals by codimension in case rings are the local rings of irreducible curve singularities. In this paper, we introduce a systematic method to solve this problem.

Two finite words $u$ and $v$ are $k$-binomially equivalent if, for each word $x$ of length at most $k$, $x$ appears the same number of times as a subsequence (i.e., as a scattered subword) of both $u$ and $v$. This notion generalizes…

The purpose of this note is to prove that there is an algebraic stack U parameterizing all curves. The curves that appear in the algebraic stack U are allowed to be arbitrarily singular, non-reduced, disconnected, and reducible. We also…

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

It was recently conjectured that every system of exceptional orthogonal polynomials is related to classical orthogonal polynomials by a sequence of Darboux transformations. In this paper we prove this conjecture, which paves the road to a…

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group.…

We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal…

We extend the formulae of classical invariant theory for the Jacobian of a genus one curve of degree $n \le 4$ to curves of arbitrary degree. To do this, we associate to each genus one normal curve of degree $n$, an $n \times n$ alternating…