SearcharxivSearch

arXiv · 2607.28656

Typed Congruences and Quotient-Critical Irreducibility in Complete Ternary $\Gamma$-Semirings

Abstract

We study congruences and binary reducibility in completely additive ternary $\Gamma$-semirings through their two-sorted atomic cores. For an odd $m\geq3$, an abelian group $G$ of exponent dividing $m-1$, and $u,v\in G$, we construct a two-branch symmetric $m$-ary band $F_m(G;u,v)$. We prove \[ \Con(F_m(G;u,v))\cong\operatorname{Sub}(G)\times B_2 \] and classify every carrier--index congruence pair: $(\theta,\phi)$ is typed exactly when $\theta$ is an ordinary congruence and $\phi$ refines $\theta$. We also give a quotient-by-quotient reducibility criterion. In the finite case, $F_m(G;u,v)$ is quotient-critically irreducible exactly when $G$ is a cyclic $p$-group and $u-v$ has order $p$. The specialization $G=\mathbb Z_2$ yields a four-point family $H_m$ extending the irreducible ternary example of Devillet and Mathonet. Its congruence lattice is $B_3$, its alternating core has exactly $36$ typed congruence pairs, and its automorphism group is $C_2$. Its seven proper quotients are reducible and form five isomorphism types; in arity five their exact reduction counts are determined. The powerset lift of $H_5$ is a $16$-element atom-total complete atomic Boolean ternary $\Gamma$-semiring with no atomic binary collapse, whereas each proper diagonal strong atom-saturated quotient has one. Its parity congruence is recovered on atoms by one explicitly specified depth-one polynomial inequation.

Explore related subjects

Keep this discovery

BibTeXRIS

Chandrasekhar Gokavarapu, Madhusudhana Rao Dasari. 2026-07-14. Typed Congruences and Quotient-Critical Irreducibility in Complete Ternary $\Gamma$-Semirings. https://arxiv.org/abs/2607.28656

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