SearcharxivSearch

arXiv · 2412.12082

$F$-birestriction monoids in enriched signature

Abstract

Motivated by recent interest to $F$-inverse monoids, on the one hand, and to restriction and birestriction monoids, on the other hand, we initiate the study of $F$-birestriction monoids as algebraic structures in the enriched signature $(\cdot, \, ^*, \,^+, \, ^{\mathfrak{m}},1)$ where the unary operation $(\cdot)^{\mathfrak{m}}$ maps each element to the maximum element of its $\sigma$-class. We find a presentation of the free $F$-birestriction monoid ${\mathsf{FFBR}}(X)$ as a birestriction monoid ${\mathcal F}$ over the extended set of generators $X\cup\overline{X^+}$ where $\overline{X^+}$ is a set in a bijection with the free semigroup $X^+$ and encodes the maximum elements of (non-projection) $\sigma$-classes. This enables us to show that ${\mathsf{FFBR}}(X)$ decomposes as the partial action product $E({\mathcal I})\rtimes X^*$ of the idempotent semilattice of the universal inverse monoid ${\mathcal I}$ of ${\mathcal F}$ partially acted upon by the free monoid $X^*$. Invoking Sch\"utzenberger graphs, we prove that the word problem for ${\mathsf{FFBR}}(X)$ and its strong and perfect analogues is decidable. Furthermore, we show that ${\mathsf{FFBR}}(X)$ does not admit a geometric model based on a quotient of the Margolis-Meakin expansion $M({\mathsf{FG}}(X), X\cup \overline{X^+})$ over the free group ${\mathsf{FG}}(X)$, but the free perfect $X$-generated $F$-birestriction monoid admits such a model.

Explore related subjects

Keep this discovery

BibTeXRIS

Ganna Kudryavtseva, Ajda Lemut Furlani. 2024-12-16. $F$-birestriction monoids in enriched signature. https://doi.org/10.1007/s40840-025-01995-2

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