Related papers: On the ideal associated to a linear code

We show that every Lie ideal in a unital, properly infinite C*-algebra is commutator equivalent to a unique two-sided ideal. It follows that the Lie ideal structure of such a C*-algebra is concisely encoded by its lattice of two-sided…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

Large linear systems are ubiquitous in modern computational science and engineering. The main recipe for solving them is the use of Krylov subspace iterative methods with well-designed preconditioners. Recently, GNNs have been shown to be a…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

We study quotients of the Weyl algebra by left ideals whose generators consist of an arbitrary Z^d-graded binomial ideal I along with Euler operators defined by the grading and a parameter in C^d. We determine the parameters for which these…

Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…

We prove that the log canonical thresholds of a large class of binomial ideals, such as complete intersection binomial ideals and the defining ideals of space monomial curves, are computable by linear programming.

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…

In this paper, we use the tools of Gr\"{o}bner bases and combinatorial secant varieties to study the determinantal ideals $I_t$ of the extended Hankel matrices. Denote by $c$-chain a sequence $a_1,\...,a_k$ with $a_i+c<a_{i+1}$ for all…

The vanishing ideal I of a subspace arrangement is an intersection of linear ideals. We give a formula for the Hilbert polynomial of I if the subspaces meet transversally. We also give a formula for the Hilbert series of a product J of the…

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

In this work we study a weak order ideal associated with the coset leaders of a non-binary linear code. This set allows the incrementally computation of the coset leaders and the definitions of the set of leader codewords. This set of…

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…

A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…

The interpolation step of Guruswami and Sudan's list decoding of Reed-Solomon codes poses the problem of finding the minimal polynomial of an ideal with respect to a certain monomial order. An efficient algorithm that solves the problem is…

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…

We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…