Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1106.6192

Isomorphisms between Morita context rings

C. Boboc·S. Dascalescu·L. van Wyk
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $(R, S,_R\negthinspace M_S,_S\negthinspace N_R, f, g)$ be a general Morita context, and let $T=[{cc} R &_RM_S_SN_R & S]$ be the ring associated with this context. Similarly, let $T'=[{cc} R' & M' N' & S']$ be another Morita context ring. We study the set ${Iso}(T,T')$ of ring isomorphisms from $T$ to $T'$. Our interest in this problem is motivated by: (i) the problem to determine the automorphism group of the ring $T$, and (ii) the recovery of the non-diagonal tiles problem for this type of generalized matrix rings. We introduce two classes of isomorphisms from $T$ to $T'$, the disjoint union of which is denoted by ${Iso}_0(T,T')$. We describe ${Iso}_0(T,T')$ by using the $\Z$-graded ring structure of $T$ and $T'$. Our main result characterizes ${Iso}_0(T,T')$ as the set consisting of all semigraded isomorphisms and all anti-semigraded isomorphisms from $T$ to $T'$, provided that the rings $R'$ and $S'$ are indecomposable and at least one of $M'$ and $N'$ is nonzero; in particular ${Iso}_0(T,T')$ contains all graded isomorphisms and all anti-graded isomorphisms from $T$ to $T'$. We also present a situation where ${Iso}_0(T,T')={Iso}(T,T')$. This is in the case where $R,S,R'$ and $S'$ are rings having only trivial idempotents and all the Morita maps are zero. In particular, this shows that the group of automorphisms of $T$ is completely determined.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

C. Boboc, S. Dascalescu, L. van Wyk. 2011-06-30. Isomorphisms between Morita context rings. https://arxiv.org/abs/1106.6192

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↗