Related papers: DG-Sensitive Pruning & a Complete Classification o…
Let $F$ be a $\delta-$field (differential field) of characteristic zero with an algebraically closed field of constants $F^\delta$, $A$ be a $\delta-F-$central simple algebra, $K$ be a Picard-Vessiot extension for the $\delta-F-$module $A$…
Let $G$ be a finite simple graph and let $I(G)$ be its edge ideal. In this article, we deeply investigate the squarefree powers of $I(G)$ by means of Betti splittings. When $G$ is a forest, it is shown that the normalized depth function of…
Suppose $I$ is an ideal of a polynomial ring over a field, $I\subseteq k[x_1,\ldots,x_n]$, and whenever $fg\in I$ with degree $\leq b$, then either $f\in I$ or $g\in I$. When $b$ is sufficiently large, it follows that $I$ is prime.…
Let $\Bbbk$ be a field and let $I$ be a monomial ideal in the polynomial ring $Q=\Bbbk[x_1,\ldots,x_n]$. In her thesis, Taylor introduced a complex which provides a finite free resolution for $Q/I$ as a $Q$-module. Later, Gemeda constructed…
In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…
Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…
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},…
We prove that a commutative association scheme is imprimitive if and only if it admits a multivariate $P$- or $Q$-polynomial structure with respect to an elimination-type monomial order. This provides a direct bridge between the classical…
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…
Fix a pair of positive integers d and n. We create a ring R and a complex G of R-modules with the following universal property. Let P be a polynomial ring in d variables over a field and let I be a grade d Gorenstein ideal in P which is…
Let $I$ be a square-free monomial ideal in a polynomial ring $R=K[x_1,\ldots, x_n]$ over a field $K$, $\mathfrak{m}=(x_1, \ldots, x_n)$ be the graded maximal ideal of $R$, and $\{u_1, \ldots, u_{\beta_1(I)}\}$ be a maximal independent set…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…
Let $A$ be a semigroup whose only invertible element is 0. For an $A$-homogeneous ideal we discuss the notions of simple $i$-syzygies and simple minimal free resolutions of $R/I$. When $I$ is a lattice ideal, the simple 0-syzygies of $R/I$…
We give a formula for counting tree modules for the quiver S_g with g loops and one vertex in terms of tree modules on its universal cover. This formula, along with work of Helleloid and Rodriguez-Villegas, is used to show that the number…
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…
We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…
We are interested in solving the congruences $f^3+g^3+1\equiv 0\pmod{fg}$ and $f^4-4g^2+4\equiv 0\pmod{fg}$ in polynomials $f, g$ with rational coefficients. Moreover, we present results of computations of all integer points on certain one…
Given a weighted, ordered query set $Q$ and a partition of $Q$ into classes, we study the problem of computing a minimum-cost decision tree that, given any query $q$ in $Q$, uses equality tests and less-than comparisons to determine the…
Let $G$ be a (multi) graph on the vertex set $V=\{0,1,\ldots ,n\}$ with root $0$. The $G$-parking function ideal $\mathcal{M}_G$ is a monomial ideal in the polynomial ring $R=\mathbb{K}[x_1,\ldots ,x_n]$ over a field $\mathbb{K}$ such that…
Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…