Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1309.0564

On monoids, 2-firs, and semifirs

George M. Bergman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Several authors have studied the question of when the monoid ring DM of a monoid M over a ring D is a right and/or left fir (free ideal ring), a semifir, or a 2-fir (definitions recalled in section 1). It is known that for M nontrivial, a necessary condition for any of these properties to hold is that D be a division ring. Under that assumption, necessary and sufficient conditions on M are known for DM to be a right or left fir, and various conditions on M have been proved necessary or sufficient for DM to be a 2-fir or semifir. A sufficient condition for DM to be a semifir is that M be a direct limit of monoids which are free products of free monoids and free groups. W.Dicks has conjectured that this is also necessary. However F.Ced\'o has given an example of a monoid M which is not such a direct limit, but satisfies the known necessary conditions for DM to be a semifir. It is an open question whether for this M, the rings DM are semifirs. We note some reformulations of the known necessary conditions for DM to be a 2-fir or a semifir, motivate Ced\'o's construction and a variant, and recover Ced\'o's results for both constructions. Any homomorphism from a monoid M into \Z induces a \Z-grading on DM, and we show that for the two monoids in question, the rings DM are "homogeneous semifirs" with respect to all such nontrivial \Z-gradings; i.e., have (roughly) the property that every finitely generated homogeneous one-sided ideal is free. If M is a monoid such that DM is an n-fir, and N a "well-behaved" submonoid of M, we obtain results on DN. Using these, we show that for M a monoid such that DM is a 2-fir, mutual commutativity is an equivalence relation on nonidentity elements of M, and each equivalence class, together with the identity element, is a directed union of infinite cyclic groups or infinite cyclic monoids. Several open questions are noted.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

George M. Bergman. 2013-09-03. On monoids, 2-firs, and semifirs. https://doi.org/10.1007/s00233-014-9586-z

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↗