Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.22923

Left Ehresmann monoids with a proper basis

Gracinda Gomes·Victoria Gould·Yanhui Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Left Ehresmann monoids, and their two-sided counterpart of Ehresmann monoids, were so named by Lawson, who elucidated their connection to the work of Ehresmann in differential geometry. This article is dedicated to building a theory for left Ehresmann monoids inspired by that for inverse semigroups; in order to do so we must develop substantially different ideas and techniques. It is known that every left Ehresmann monoid has a cover, that is, a projection separating preimage, of the form $\mathcal{P}_{\ell}(T,X)$, where $\mathcal{P}_{\ell}(T,X)$ is a left Ehresmann monoid constructed from a monoid $T$ and an order-preserving action of $T$ on a semilattice $X$ with identity. We introduce the notion of a proper basis, and show that $\mathcal{P}_{\ell}(T,X)$, and consequently any free left Ehresmann monoid, possesses a proper basis. We show that any left Ehresmann monoid with a proper basis displays properties close to those of two-sided Ehresmann monoids. Next, we exhibit a class of subsemigroups $\mathcal{Q}_{\ell}(T,X,Y)$ (properly, biunary monoid subsemigroups) of the monoids $\mathcal{P}_{\ell}(T,X)$, which are also left Ehresmann with a proper basis. We prove that any left Ehresmann monoid with a proper basis is isomorphic to some $\mathcal{Q}_{\ell}(T,X,Y)$. Our results can be regarded as being analogous to those for proper inverse semigroups, due to McAlister and O'Carroll, the $\mathcal{Q}_{\ell}(T,X,Y)$ playing the role of the $P$-semigroups and the $\mathcal{P}_{\ell}(T,X)$ the role of the semidirect products of a semilattice by a group. In the process of proving our main theorems we present a globalisation result for an order-preserving partial action of a monoid on a partially ordered set or semilattice.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Gracinda Gomes, Victoria Gould, Yanhui Wang. 2026-01-30. Left Ehresmann monoids with a proper basis. https://arxiv.org/abs/2601.22923

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗