Related papers: Bar code for monomial ideals

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

The quotient bases for zero-dimensional ideals are often of interest in the investigation of multivariate polynomial interpolation, algebraic coding theory, and computational molecular biology, etc. In this paper, we discuss the properties…

In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).

Generalizations of the Hermite polynomials to many variables and/or to the complex domain have been located in mathematical and physical literature for some decades. Polynomials traditionally called complex Hermite ones are mostly…

Let $K$ be a field, $V$ a finite dimensional $K$-vector space and $E$ the exterior algebra of $V$. We analyze iterated mapping cone over $E$. If $I$ is a monomial ideal of $E$ with linear quotients, we show that the mapping cone…

We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Let $I$ be a regular $\mathfrak m$-primary ideal in $(R,\mathfrak m,k)$. Then the Ratliff-Rush ideal associated to $I$ is denoted by $\bar I$ and is defined as the largest ideal containing $I$ with the same Hilbert polynomial as $I$. In…

In this work, we present an abstract framework for some algebraic error-correcting codes with the aim of capturing codes that are list-decodable to capacity, along with their decoding algorithm. In the polynomial ideal framework, a code is…

Let $S = K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$ and $I \subset S$ a homogeneous ideal of $S$ with $\dim S/I = d$. The Hilbert series of $S/I$ is of the form…

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

This article shows that any type of binary data can be defined as a collection from codewords of variable length. This feature helps us to define an Injective and surjective function from the suggested codewords to the required codewords.…

A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are…

Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{m}= (x_1, \ldots, x_n)$ be the irredundant maximal ideal of $S$. For an ideal $I \subset S$, let $\mathrm{sat}(I)$ be the minimum number $k$…

This work constructs codes that are efficiently decodable from a constant fraction of \emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for…