Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2405.08471

Varieties of MV-monoids and positive MV-algebras

Marco Abbadini·Paolo Aglianò·Stefano Fioravanti
View original source ↗Read source document ↗Export metadata ↓

Abstract

MV-monoids are algebras $\langle A,\vee,\wedge, \oplus,\odot, 0,1\rangle$ where $\langle A, \vee, \wedge, 0, 1\rangle$ is a bounded distributive lattice, both $\langle A, \oplus, 0 \rangle$ and $\langle A, \odot, 1\rangle$ are commutative monoids, and some further connecting axioms are satisfied. Every MV-algebra in the signature $\{\oplus,\neg,0\}$ is term equivalent to an algebra that has an MV-monoid as a reduct, by defining, as standard, $1:= \neg 0$, $x \odot y := \neg(\neg x \oplus\neg y)$, $x \vee y := (x \odot \neg y) \oplus y$ and $x \wedge y := \neg(\neg x \vee \neg y)$. Particular examples of MV-monoids are positive MV-algebras, i.e. the $\{\vee, \wedge, \oplus, \odot, 0, 1\}$-subreducts of MV-algebras. Positive MV-algebras form a peculiar quasivariety in the sense that, albeit having a logical motivation (being the quasivariety of subreducts of MV-algebras), it is not the equivalent quasivariety semantics of any logic. In this paper, we study the lattices of subvarieties of MV-monoids and of positive MV-algebras. In particular, we characterize and axiomatize all almost minimal varieties of MV-monoids, we characterize the finite subdirectly irreducible positive MV-algebras, and we characterize and axiomatize all varieties of positive MV-algebras.

Explore related subjects

math.RAmath.LO

Keep this discovery

BibTeXRIS

Marco Abbadini, Paolo Aglianò, Stefano Fioravanti. 2024-05-14. Varieties of MV-monoids and positive MV-algebras. https://arxiv.org/abs/2405.08471

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↗