SearcharxivSearch

arXiv · 1805.05272

Two-sided expansions of monoids

Abstract

We initiate the study of expansions of monoids in the class of two-sided restriction monoids and show that generalizations of the Birget-Rhodes prefix group expansion, despite the absence of involution, have rich structure close to that of respective relatively free inverse monoids. For a monoid $M$, we define ${\mathcal{FR}}_R(M)$ to be the freest two-sided restriction monoid generated by a bijective copy, $M'$, of the underlying set of $M$, such that the inclusion map $\iota\colon M\to {\mathcal{FR}}_R(M)$ is determined by a set of relations, $R$, so that $\iota$ is a premorphism which is weaker than a homomorphism. Our main result states that ${\mathcal{FR}}_R(M)$ can be constructed, by means of a partial action product construction, from $M$ and the idempotent semilattice of ${\mathcal{FI}}_R(M)$, the free $M'$-generated inverse monoid subject to relations $R$. In particular, the semilattice of projections of ${\mathcal{FR}}_R(M)$ is isomorphic to the idempotent semilattice of ${\mathcal{FI}}_R(M)$. The result by Fountain, Gomes and Gould on the structure of the free two-sided restriction monoid is recovered as a special case of our result. We show that important properties of ${\mathcal{FR}}_R(M)$ are well agreed with suitable properties of $M$, such as being cancellative or embeddable into a group. We observe that if $M$ is an inverse monoid, then ${\mathcal{FI}}_s(M)$, the free inverse monoid with respect to strong premorphisms, is isomorphic to the Lawson-Margolis-Steinberg generalized prefix expansion $M^{pr}$. This gives a presentation of $M^{pr}$ and leads to a model for ${\mathcal{FR}}_s(M)$ in terms of the known model for $M^{pr}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Ganna Kudryavtseva. 2018-05-14. Two-sided expansions of monoids. https://doi.org/10.1142/s0218196719500590

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