Related papers: Submodule codes as spherical codes in buildings
We introduce the notions of Strongly harmonic and Gelfand module, as a generalization of the well-known ring theoretic case. We prove some properties of these modules and we give a characterization via their lattice of submodules and their…
In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a…
We introduce the factor complex of a neural code, and show how intervals and maximal codewords are captured by the combinatorics of factor complexes. We use these results to obtain algebraic and combinatorial characterizations of…
Guruswami and Xing introduced subspace designs in 2013 to give the first construction of positive rate rank metric codes list-decodable beyond half the distance. In this paper we provide bounds involving the parameters of a subspace design,…
The fundamental theorem of symmetric polynomials over rings is a classical result which states that every unital commutative ring is fully elementary, i.e. we can express symmetric polynomials with elementary ones in a unique way. The…
We define and study a class of codes obtained from scrolls over curves of any genus over finite fields. These codes generalize Goppa codes in a natural way, and the orthogonal complements of these codes belong to the same class. We show how…
This paper presents a new alphabet-dependent bound for codes with hierarchical locality. Then, the complete list of possible localities is derived for a class of codes obtained by deleting specific columns from a Simplex code. This list is…
In our recent work, we introduced a generalization of the prime ideal factorization in Dedekind domains for submodules of finitely generated modules over Noetherian rings. In this article, we find conditions for the intersection of two…
Given a Chevalley group $\mathcal{G}$ of classical type and a Borel subgroup $\mathcal{B} \subseteq \mathcal{G}$, we compute the $\Sigma$-invariants of the $S$-arithmetic groups $\mathcal{B}(\mathbb{Z}[1/N])$, where $N$ is a product of…
We give a new construction of the algebraic $K$-theory of small permutative categories that preserves multiplicative structure, and therefore allows us to give a unified treatment of rings, modules, and algebras in both the input and…
Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…
\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…
We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…
Let $k =\mathbb{F}_q$ be the finite field of $q$ elements and $E$ an elliptic curve over $k$. Let $F = k(E)$ be the function field over $E$ and let $\mathcal{O} = k[E]$ be the ring of integers. We fix the place at $\infty$ of $F$ and let…
Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…
We show that if a graded submodule of a Noetherian module cannot be written as a proper intersection of graded submodules, then it cannot be written as a proper intersection of submodules at all. More generally, we show that a natural…
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode…
We consider the derived category of permutation modules for a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the spectrum of its compact objects, by reducing the…
We introduce shift algebras as certain crossed product algebras based on general function spaces and study properties, as well as the classification, of a particular class of modules depending on a set of matrix parameters. It turns out…
Bar Codes are combinatorial objects encoding many properties of monomial ideals. In this paper we employ these objects to study Janet-like divisions. Given a finite set of terms U, from its Bar Code we can compute the Janet-like…