SearcharxivSearch

arXiv · 2307.11596

The structure of End($\mathcal{T}_n$)

Abstract

The full transformation semigroups $\mathcal{T}_n$, where $n\in \mathbb{N}$, consisting of all maps from a set of cardinality $n$ to itself, are arguably the most important family of finite semigroups. This article investigates the endomorphism monoid End($\mathcal{T}_n$) of $\mathcal{T}_n$. The determination of the elements of End($\mathcal{T}_n$) is due Schein and Teclezghi. Surprisingly, the algebraic structure of End($\mathcal{T}_n$) has not been further explored. We describe Green's relations and extended Green's relations on End($\mathcal{T}_n$), and the generalised regularity properties of these monoids. In particular, we prove that $\mathcal{H}=\mathcal{L} \subseteq \mathcal{R}= \mathcal{D}=\mathcal{J}$ (with equality if and only if $n=1$); the idempotents of End($\mathcal{T}_n$) form a band (which is equal to End($\mathcal{T}_n$) if and only if $n=1$) and also the regular elements of End($\mathcal{T}_n$) form a subsemigroup (which is equal to End($\mathcal{T}_n$) if and only if $n\leq 2$). Further, the regular elements of End($\mathcal{T}_n$) are precisely the idempotents together with all endomorphisms of rank greater than $3$. We also provide a presentation for End($\mathcal{T}_n$) with respect to a minimal generating set.

Explore related subjects

Keep this discovery

BibTeXRIS

Victoria Gould, Ambroise Grau, Marianne Johnson. 2023-07-21. The structure of End($\mathcal{T}_n$). https://arxiv.org/abs/2307.11596

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

KEEP EXPLORING

Related papers

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA