相关论文: On divisor-closed submonoids and minimal distances…

Let $H$ be a Krull monoid with finite class group $G$. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of all possible factorization lengths $k$ is…

The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the…

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of…

A finitely generated commutative monoid is uniquely presented if it has only a minimal presentation. We give necessary and sufficient conditions for finitely generated, combinatorially finite, cancellative, commutative monoids to be…

Let $H$ be an atomic monoid. The set of distances $\Delta (H)$ of $H$ is the set of all $d \in \mathbb{N}$ with the following property: there are irreducible elements $u\_1, \ldots, u\_k, v\_1 \ldots, v\_{k+d}$ such that $u\_1 \cdot \ldots…

The catenary degree of an element $n$ of a cancellative commutative monoid $S$ is a nonnegative integer measuring the distance between the irreducible factorizations of $n$. The catenary degree of the monoid $S$, defined as the supremum…

Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product…

If $\mathbb{F}$ is an ordered field and $M$ is a finite-rank torsion-free monoid, then one can embed $M$ into a finite-dimensional vector space over $\mathbb{F}$ via the inclusion $M \hookrightarrow \text{gp}(M) \hookrightarrow \mathbb{F}…

Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…

The local structures of enveloping semigroups of simple groups are investigated. All J-coirreducible connected stabilizer submonoids are determined. The notion of a navel of a reductive monoid is introduced. The cross-section lattice of the…

This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes. We show that the minimum distance is multiplicative with respect to taking the product of polytopes, and behaves…

In this article, the minimum distance of the dual $C^{\bot}$ of a functional code $C$ on an arbitrary dimensional variety $X$ over a finite field $\F_q$ is studied. The approach consists in finding minimal configurations of points on $X$…

Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…

We prove that it is decidable whether or not a finitely generated submonoid of a virtually free group is graded, introduce a new geometric characterization as quasi-geodesic monoids, and show that their word problem is rational (as a…

The sets of all neutral, distributive and lower-modular elements of the lattice of semigroup varieties are finite, countably infinite and uncountably infinite, respectively. In 2018, we established that there are precisely three neutral…

Let $\mathcal C \subset \mathbb N^p$ be a finitely generated integer cone and $S\subset \mathcal C$ be an affine semigroup such that the real cones generated by $\mathcal C$ and by $S$ are equal. The semigroup $S$ is called $\mathcal…

For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…

Consider an algebraic semigroup $S$ and its closed subscheme of idempotents, $E(S)$. When $S$ is commutative, we show that $E(S)$ is finite and reduced; if in addition $S$ is irreducible, then $E(S)$ is contained in a smallest closed…

We obtain lower bound for the maximum distance between any three distinct points in an affine lattice which are close to a helix with small curvature and torsion.

We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…