Search arXivSearch

arXiv · 2606.10629

On the semigroups of fence-decreasing and fence-preserving transformations on a finite fence

Abstract

For a natural number $n$, a fence $[n]=\{1\prec 2\succ 3\prec 4\succ 5\prec \cdots n\}$ is a partial ordered set. A partial transformation $α$ is called fence-decreasing if $xα\preceq x$ for all $x$ in the domain of $α$, and fence-preserving if $x\prec y$ implies $xα\preceq yα$ for all $x$ and $y$ in the domain of $α$. In this paper, we consider the monoids $\mathcal{DF}_{n}$ ($\mathcal{PDF}_{n})$ of all fence-decreasing full (partial) transformations as well as the monoid $\mathcal{PCF}_{n}$ of all fence-preserving transformations of $\mathcal{PDF}_{n}$. For these three monoids and some of their ideals, we determine the unique minimal generating set. Moreover, we calculate the rank of $\mathcal{DF}_{n}$, $\mathcal{PDF}_{n}$, and $\mathcal{PCF}_{n}$. Additional, we provide several combinatorial results concerning these three monoids.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gonca Ayık, Hayrullah Ayık, Ilinka Dimitrova, Jörg Koppitz. 2026-06-09. On the semigroups of fence-decreasing and fence-preserving transformations on a finite fence. https://arxiv.org/abs/2606.10629

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On solutions of singular Sylvester equations in quaternions

The quaternionic equations ax-xb=0 and ax-xb=c are investigated, which are called homogeneous and inhomogeneous Sylvester equations, respectively. Conditions for the existence of solutions are provided. In addition, the general and nonzero solutions to these equations are derived applying quaternion square roots.

math.RA

Positivity preservers over finite fields II

We say that a matrix over a finite field $\mathbb{F}_q$ is positive definite if it is symmetric and each of its leading principal minors is a nonzero square in $\mathbb{F}_q$. In previous work of the authors [J. Algebra, 2025], the entrywise positivity preservers on $M_n(\mathbb{F}_q)$ were classified in every case except when $n=2$, $q\equiv1\pmod4$, and $q$ is not a square. We settle this remaining case, thereby completing the classification of entrywise positivity preservers over every finite field and in every dimension $n\ge2$. Our proof is based on a novel idempotent reduction that not only resolves the remaining case but also yields a self-contained proof of the complete classification, while avoiding several technical results used in the earlier arguments. As a further application of the same reduction, we classify the entrywise preservers of strongly nonsingular matrices, i.e., matrices whose leading principal minors are all nonzero. We also prove a more general theorem in odd characteristic: for every prescribed sign pattern of nonzero leading principal minors of matrices of a fixed dimension $n\ge2$, the entrywise preservers are precisely the positive scalar multiples of field automorphisms. Thus, in odd characteristic, preserving any nonzero leading-principal-minor sign pattern surprisingly forces the preservation of every such sign pattern.

math.RA

Graphs of Moore-Penrose inverse of matrices possessing the treeangle property

It is known that the inverse of an invertible real square matrix satisfying the treeangle property, is a treediagonal matrix. A converse statement also holds. We show that the verbatim analogues are not true for the Moore-Penrose inverse, and obtain the precise structure of graphs corresponding to the Moore-Penrose inverse of matrices possessing the treeangle property.

math.RA