Related papers: Bar code for monomial ideals
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
We study the generic initial ideals (gin) of certain ideals that arise in modular invariant theory. For all cases an explicit generating set is known we calculate the generic initial ideal of the Hilbert ideal of a cyclic group of prime…
We introduce and compute the class of a number of effective divisors on the moduli space of stable maps $\bar M_{0,0}(P^{r},d)$, which, for small d, provide a good understanding of the extremal rays and the stable base locus decomposition…
A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…
In the present paper we introduce and study finite point subsets of a special kind, called optimum distributions, in the n-dimensional unit cube. Such distributions are closely related with known (delta,s,n)-nets of low discrepancy. It…
In this work, we study the structure of multivariable modular codes over finite chain rings when the ambient space is a principal ideal ring. We also provide some applications to additive modular codes over the finite field $\mathbb{F}_4$.
We prove an index theorem for the quotient module of a monomial ideal. We obtain this result by resolving the monomial ideal by a sequence of Bergman space like essentially normal Hilbert modules.
This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily…
The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…
Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…
In this paper we introduce a family of monomial ideals with the persistence property. Given positive integers $n$ and $t$, we consider the monomial ideal $I=Ind_t(P_n)$ generated by all monomials $\textbf{x} ^F$, where $F$ is an independent…
In this work, we explore the relationship between free resolution of some monomial ideals and Generalized Hamming Weights (GHWs) of binary codes. More precisely, we look for a structure smaller than the set of codewords of minimal support…
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
Roughly speaking, holonomic measures are parametric varifolds without boundary. They provide a setting appropriate for the analysis of many variational problems. In this paper, we characterize the space of variations for these objects, and…
For an ideal $I$ in a polynomial ring over a field, a monomial support of $I$ is the set of monomials that appear as terms in a set of minimal generators of $I$. Craig Huneke asked whether the size of a monomial support is a bound for the…
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…
Given a regular multiset $M$ on $[n]=\{1,2,\ldots,n\}$, a partial order $R$ on $M$, and a label map $\pi : [n] \rightarrow \mathbb{N}$ defined by $\pi(i) = k_i$ with $\sum_{i=1}^{n}\pi (i) = N$, we define a pomset block metric…
Let $I\subset S=\KK[x_1,...,x_n]$ be a lexsegment ideal, generated by monomials of degree $d$. The main aim of this paper is to characterize when the Hilbert depth of $I$ will be 1, in the standard graded case. In addition to this, we will…
The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…
Let S be a polynomial ring in n variables over a field, and let M be a monomial ideal of S. We introduce a new invariant, called the order of dominance of S/M, denoted odom(S/M), which has many similarities with the codimension of S/M. We…