Skip to main content
Log in

Sperner’s theorem for non-free modules over finite chain rings

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

We prove Sperner-type theorems for the partially ordered set \(\mathcal {P}_M\) of all submodules of a non-free finitely generated module \({}_RM\) over a finite chain ring R. We demonstrate that the partially ordered set \(\mathcal {P}_M\) is not necessarily of Sperner type and solve the problem for modules of shape \(2^11^n\). This result is further generalized for modules of shape \(m^11^n\) over a chain ring of length m.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data availability

The authors declare that no datasets were generated or analysed during the current study.

References

  1. Birkhoff G.: Subgroups of abelian groups. Proc. London Math. Soc. 38(2), 385–401 (1934).

    MathSciNet  Google Scholar 

  2. Dilworth R.P.: A decomposition theorem for partially ordered sets. Ann. Math. 51(2), 161–166 (1950).

    Article  MathSciNet  Google Scholar 

  3. Engel K.: Sperner theory. Cambridge University Press, Cambridge (1997).

    Book  Google Scholar 

  4. Feng C., Nóberga R.W., Kschischang F.R., Silva D.: Communication over finte-chain-ring matrix channels. IEEE Trans. Inf. Theory 60(10), 5899–5917 (2014).

    Article  Google Scholar 

  5. Georgieva N.: Basic algorithms for manipulation of modules over finite chain rings. Serdika J. Comp. 10(3–4), 285–297 (2016).

    MathSciNet  Google Scholar 

  6. Hall P.: On representatives of subsets. J. London Math. Soc. 10, 26–30 (1935).

    Article  MathSciNet  Google Scholar 

  7. Honold T., Landjev I.: Linear codes over finite chain rings and projective Hjelmslev geometries. In P. Solé, editor, Codes Over Rings, volume 6 of Series on Coding Theory and Cryptology. World Scientific, July (2009).

  8. Honold T., Landjev I.: Codes over rings and ring geometries, Chapter 7. In: De Beule J., Storme L. (eds.) Current research topics in Galois geometries, pp. 161–186. Nova Science Publishers, New York (2012).

    Google Scholar 

  9. Lubell D.: A short proof of Sperner’s lemma. J. Combin. Theory 1, 299 (1966).

    Article  MathSciNet  Google Scholar 

  10. McDonald B.R.: Finite rings with Identity. Marcel Dekker, New York (1974).

    Google Scholar 

  11. Meshalkin L.D.: A generalization of Sperner’s theorem on the number of subsets of a finite set (in Russian). Teor. Veroyatnost. i Primenen. 8, 219–220 (1963).

    Google Scholar 

  12. Nechaev A.A.: Finite principal ideal rings. Russian Acad. Sci. Sbornik Math. 20, 364–382 (1973).

    Article  Google Scholar 

  13. Nechaev A.A.: Finite Rings with Applications, in: Handbook of Algebra, Vol. 5 (ed. Hazewinkel, M.:), Elsevier North-Holland, Amsterdam, 213–320 (2008).

  14. Rota G.-C., Harper L. H.: Matching theory, an introduction, In: Advances in Probability Vol. 1, Marcel Dekker, Inc., New York (1971).

  15. Sperner E.: Ein Satz über Untermengen einer endlichen Menge. Mathematische Zeitschrift 27, 544–548 (1928).

    Article  MathSciNet  Google Scholar 

  16. Stanley R.: Some applications of algebra to combinatorics. Discret. Appl. Math. 34, 241–277 (1991).

    Article  MathSciNet  Google Scholar 

  17. van Lint J.H., Wilson R.M.: A course in combinatorics. Cambridge University Press, Cambridge (1992).

    Google Scholar 

  18. Wang J.: Proof of a conjecture on the Sperner property of the subgroup lattice of an Abelian \(p\)-group. Ann. Combin. 2, 85–101 (1998).

    Article  MathSciNet  Google Scholar 

  19. Yamamoto K.: Logarithmic order of free distributive lattices. J. Math. Soc. Japan 6, 343–353 (1954).

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The first author was supported by the Strategic Development Fund of the New Bulgarian University and by the Bulgarian National Science Research Fund under Contract KP-06-Russia/33 and by the Research Fund of Sofia University under Contract 80-10-177/27.05.2022. The second author was supported by the Research Fund of Sofia University under Contract 80-10-52/27.05.2022.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ivan Landjev.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have influenced the work reported in this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue: Finite Geometries 2022”.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Landjev, I., Rogachev, E. Sperner’s theorem for non-free modules over finite chain rings. Des. Codes Cryptogr. (2024). https://doi.org/10.1007/s10623-023-01352-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10623-023-01352-z

Keywords

Mathematics Subject Classification

Navigation