Related papers: Computational methods for t-spread monomial ideals

$k$-means algorithm is one of the most classical clustering methods, which has been widely and successfully used in signal processing. However, due to the thin-tailed property of the Gaussian distribution, $k$-means algorithm suffers from…

We study the homogeneous artinian ideals of the polynomial ring $K[x,y,z]$, generated by the homogenous polynomials of degree $d$ which are invariant under an action of the cyclic group $\mathbb Z/d\mathbb Z$, for any $d\geq 3$. We prove…

We introduce the concept of monomial ideals with stable projective dimension, as a generalization of the Cohen-Macaulay property. Indeed, we study the class of monomial ideals $I$, whose projective dimension is stable under monomial…

We initiate a study of the following problem: Given a continuous domain $\Omega$ along with its convex hull $\mathcal{K}$, a point $A \in \mathcal{K}$ and a prior measure $\mu$ on $\Omega$, find the probability density over $\Omega$ whose…

Random effects meta-analysis model is an important tool for integrating results from multiple independent studies. However, the standard model is based on the assumption of normal distributions for both random effects and within-study…

In this paper, we begin our discussion with some of the well-known methods available in the literature for the estimation of the parameters of a univariate/multivariate stable distribution. Based on the available methods, a new hybrid…

Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial…

Given an arbitrary integer $d>0$, we construct a homogeneous ideal $I$ of the polynomial ring $S = K[x_1, \ldots, x_{3d}]$ in $3d$ variables over a filed $K$ for which $S/I$ is a Cohen--Macaulay ring of dimension $d$ with the property that,…

Kernel based methods provide a way to reconstruct potentially high-dimensional functions from meshfree samples, i.e., sampling points and corresponding target values. A crucial ingredient for this to be successful is the distribution of the…

We study ideals which are generated by monomials of degree $d$ in the polynomial ring in $n$ variables and which satisfy certain numerical side conditions regarding their exponents. Typical examples of such ideals are the ideals of Veronese…

Inspired by the definition of $\bf{t}$-spread monomial ideals, in this paper, we introduce $\bf{t}$-spread $d$-partite hypergraph $K^{\bf t}_V$ and study its edge ideal $I(K^{\bf t}_V)$. We prove that $I(K^{\bf t}_V)$ has linear quotients,…

We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to…

B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…

We give a necessary and sufficient condition on a homogeneous polynomial ideal for its Taylor complex to be exact. Then we give a combinatorial construction of a minimal resolution for ideals satisfying the above condition (in particular…

A multiplicative subset $S$ of a ring $R$ is called \textit{strongly multiplicative} if $(\bigcap_{i\in\Delta}s_iR)\cap S \neq \emptyset$ for each family $(s_i)_{i\in\Delta}$ of elements in $S$. In this paper, we investigate how these sets…

We develop a new technique for studying monomial ideals in the standard polynomial rings $A[X_1,\ldots,X_d]$ where $A$ is a commutative ring with identity. The main idea is to consider induced ideals in the semigroup ring…

We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…

Motivated by the fact that as the number of generators of an ideal grows so does the complexity of calculating relations among the generators, this paper identifies collections of monomial ideals with a growing number of generators which…

We compute the minimal primary decomposition for completely squarefree lexsegment ideals. We show that critical squarefree monomial ideals are sequentially Cohen-Macaulay. As an application, we give a complete characterization of the…

Let $X$ be the Hankel matrix of size $2\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\subset K[x_1,\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the…