Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.11321

Forbidden configurations for coherency

Victoria Gould·Marianne Johnson
View original source ↗Read source document ↗Export metadata ↓

Abstract

Right (and left) coherency and right (and left) weak coherency are natural finitary conditions for monoids. Determining whether or not a given monoid has any of these properties is historically a difficult problem. This paper has several aims, centering around the well-studied class of right (and dually left) $E$-Ehresmann monoids, being one of the broadest classes of monoids containing a semilattice of idempotents. First, we exhibit a particular configuration of elements in a monoid subsemigroup of a right (respectively, left) $E$-Ehresmann monoid, relative to the Ehresmann structure of the overmonoid, that prohibits left (respectively, right) coherence. Second, we apply this technique in a number of different situations. We show that the free Ehresmann monoid of rank at least $2$ is neither left nor right coherent, and that the free left Ehresmann monoid is not left coherent. We demonstrate the utility of our technique in the case where the overmonoid is an $E$-unitary inverse monoid, and apply this to both new situations and to recover the existing results. Namely, free inverse monoids and free ample monoids of rank at least 2 are neither left nor right coherent, and free left ample monoids of rank at least $2$ is are not left coherent. Next, in a positive direction, we demonstrate that every free left Ehresmann monoid is weakly coherent. Our final result is of a different nature. Ehresmann monoids form a variety of monoids with an enriched signature. Viewed as a bi-unary monoid (respectively, unary monoid), a free Ehresmann monoid (respectively, free left Ehresmann monoid) does not embed into an inverse monoid. We show that viewed as a monoid (the standpoint of this paper) every free Ehresmann monoid (and hence also every free left Ehresmann monoid) embeds into an $E$-unitary inverse monoid.

Explore related subjects

math.RAmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victoria Gould, Marianne Johnson. 2025-06-12. Forbidden configurations for coherency. https://arxiv.org/abs/2506.11321

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↗