Related papers: Standard Bases for Linear Codes over Prime Fields
We introduce a new class of evaluation linear codes by evaluating polynomials at the roots of a suitable trace function. We give conditions for self-orthogonality of these codes and their subfield-subcodes with respect to the Hermitian…
When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
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 consider ideals in the ring $\mathbb{Z}_2[x_1,\ldots, x_n]$ that contain the polynomials $x_i^2 - x_i$ for $i = 1, \ldots, n$ and give various results related to the one-to-one correspondence between these ideals and the subsets of…
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…
In this paper, we propose a new method for localization of polynomial ideal, which we call "Local Primary Algorithm". For an ideal $I$ and a prime ideal $P$, our method computes a $P$-primary component of $I$ after checking if $P$ is…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
The index coding problem has been generalized recently to accommodate receivers which demand functions of messages and which possess functions of messages. The connections between index coding and matroid theory have been well studied in…
The aim of this paper is to unveil an unexpected relationship between the normal form of a polynomial with respect to a polynomial ideal and the more geometric concept of orthogonality. We present a new way to calculate the normal form of a…
In this article, we disprove a conjecture of F. Alarc\'on and D. Anderson and give a complete classification of the prime ideals in the one variable polynomial semiring with coefficients in Boolean semifield. We group the prime ideals of…
The goal of this paper is to present examples of families of homogeneous ideals in the polynomial ring over a field that satisfy the following condition: every product of ideals of the family has a linear free resolution. As we will see,…
We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…
We define \emph{generalized standard triples} $\mathbf{X}$, $\mathbf{Y}$, and $L(z) = z\mathbf{C}_{1} - \mathbf{C}_{0}$, where $L(z)$ is a linearization of a regular matrix polynomial $\mathbf{P}(z) \in \mathbb{C}^{n \times n}[z]$, in order…
In this paper, we establish some criteria to detect the presence of the maximal ideal $(x_1, \ldots, x_n)$ in the set of associated primes of powers of monomial ideals in the polynomial ring $K[x_1, \ldots, x_n]$. Furthermore, for each of…
In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…
In the nonlinear field of multilinear operators and homogeneous polynomials between Banach spaces, we develop a technique, based on the transformation of vector-valued sequences, to create new examples of hyper-ideals of multilinear…
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…