On the rank of monoids of endomorphisms of a finite directed path

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider endomorphisms of a finite directed path from monoid generators perspective. Our main aim is to determine the rank of the monoid wEndP→n of all weak endomorphisms of a directed path with n vertices, which is a submonoid of the widely studied monoid n of all order-preserving transformations of an n-chain. Also, we describe the regular elements of wEndP→n and calculate its size and number of idempotents.

Original languageEnglish
Article number2350069
Number of pages10
JournalAsian-European Journal of Mathematics
Volume16
Issue number4
Early online date2022
DOIs
Publication statusPublished - 2023

Keywords

  • generators
  • Graph endomorphisms
  • paths
  • rank

Fingerprint

Dive into the research topics of 'On the rank of monoids of endomorphisms of a finite directed path'. Together they form a unique fingerprint.

Cite this