On the monoid of all order-decreasing partial transformations

A partial transformation ? on an n-element set n = {1,..., n} is called order-decreasing if x? ? x for all x ? dom(?). The set of all partial order-decreasing transformations on n forms a monoid PDn. In this paper, we determine the maximal subsemigroups as well as the maximal idempotent generated subsemigroups of PDn. Furthermore, we investigate the abundance of the ideals of PDn, and characterize the structure of the left (right) abundant principal ideal of PDn.

Authors

Institutions

Publication Details

Journal
Filomat
Published
2025-01-01
DOI
https://doi.org/10.2298/fil2504149z
Primary Topic
semigroups and automata theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the monoid of all order-decreasing partial transformations

Huabi Hu, Ping Zhao
Filomat
semigroups and automata theory
article

On the monoid of all order-decreasing partial transformations

Huabi Hu, Ping Zhao
article en

Abstract

A partial transformation ? on an n-element set n = {1,..., n} is called order-decreasing if x? ? x for all x ? dom(?). The set of all partial order-decreasing transformations on n forms a monoid PDn. In this paper, we determine the maximal subsemigroups as well as the maximal idempotent generated subsemigroups of PDn. Furthermore, we investigate the abundance of the ideals of PDn, and characterize the structure of the left (right) abundant principal ideal of PDn.

FilomatVol. 39(4)
Guiyang Medical University (CN), Guizhou Normal University (CN)
Openalex Percentile: Top 80%
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.