Related papers: The Stanley-Reisner ideals of polygons as set-theo…

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

Let $k$ be a commutative ring and $S=k[x_0, \ldots, x_n]$ be a polynomial ring over $k$ with a monomial order. For any monomial ideal $J$, there exists an affine $k$-scheme of finite type, called Gr\"obner scheme, which parameterizes all…

What is the maximum number of intersections of the boundaries of a simple $m$-gon and a simple $n$-gon, assuming general position? This is a basic question in combinatorial geometry, and the answer is easy if at least one of $m$ and $n$ is…

We show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…

We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with…

Let R be a Stanley-Reisner ring (that is, a reduced monomial ring) with coefficients in a domain k, and K its associated simplicial complex. Also let D_k(R) be the ring of k-linear differential operators on R. We give two different…

We examine the ideal $I=(x_1^2, \dots, x_n^2, (x_1+\dots+x_n)^2)$ in the polynomial ring $Q=k[x_1, \dots, x_n]$, where $k$ is a field of characteristic zero or greater than $n$. We also study the Gorenstein ideal $G$ linked to $I$ via the…

We provide a complete description of the ideal that serves as the resultant ideal for n univariate polynomials of degree d. We in particular describe a set of generators of this resultant ideal arising as maximal minors of a set of…

Given an ascending chain $(I_n)_{n\in\mathbb{N}}$ of $\Sym$-invariant squarefree monomial ideals, we study the corresponding chain of Alexander duals $(I_n^\vee)_{n\in\mathbb{N}}$. Using a novel combinatorial tool, which we call…

Let $K$ be a field, $R=K[X_1, ..., X_n]$ be the polynomial ring and $J \subsetneq I$ two monomial ideals in $R$. In this paper we show that $\mathrm{sdepth}\ {I/J} - \mathrm{depth}\ {I/J} = \mathrm{sdepth}\ {I^p/J^p}-\mathrm{depth}\…

In recent work of T. Cassidy and the author, a notion of complete intersection was defined for (non-commutative) regular skew polynomial rings, defining it using both algebraic and geometric tools, where the commutative definition is a…

``What kind of ring can be represented as the singular cohomology ring of a space?'' is a classic problem in algebraic topology, posed by Steenrod. In this paper, we consider this problem when rings are the graded Stanley-Reisner rings, in…

Let $(A,\mathfrak{m})$ be an abstract complete intersection and let $P$ be a prime ideal of $A$. In [1] Avramov proved that $A_P$ is an abstract complete intersection. In this paper we give an elementary proof of this result.

A graph is called weakly perfect if its vertex chromatic number equals its clique number. Let $R$ be a ring and $I(R)^*$ be the set of all left proper non-trivial ideals of $R$. The intersection graph of ideals of $R$, denoted by $G(R)$, is…

A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a…

A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…

We construct a polygonal spiral by arranging a sequence of regular $n$-gons such that each $n$-gon shares a specified side and vertex with the $(n+1)$-gon in the construction. By offering flexibility for determining the size of each $n$-gon…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

Let $I$ be the edge ideal of a clutter $\mathcal{C}$ in a polynomial ring $S$. In this paper, we present estimations of the Stanley depth of $I$ as well as the Stanley regularity of $S/I$, in terms of combinatorial data from the clutter…

Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$ and $I$ is an ideal in $A$. Then M. P. Murthy conjectured that $\mu(I)=\mu(I/I^2)$, where $\mu$ denotes the minimal number of generators. Recently, Fasel \cite{F}…