pith. the verified trust layer for science. sign in

arxiv: 1409.8011 · v2 · pith:KG5R7ID4new · submitted 2014-09-29 · 🧮 math.AC

The zero short Covering Problem for finite rings

classification 🧮 math.AC
keywords finiteringsshortzerocoveringproblemartiniancardinality
0
0 comments X p. Extension
Add this Pith Number to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{KG5R7ID4}

Prints a linked pith:KG5R7ID4 badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original abstract

In this work, we find the cardinality of minimal zero short covers of An for any finite local ring A, removing the restriction of D(A)^2 = 0 from the previous works in the literature. Using the structure theorem for Artinian rings, we conclude that we have solved the zero short covering problem for all finite rings. We demonstrate our results on R_k, an infinite family of finite commutative rings extensively studied in coding theory, which satisfy D(A)^2 \neq 0 for all k \geq 2.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.