Substructures with an almost division algorithm in Euclidean commutator lattices

zbMATH Open1492.13025MaRDI QIDQ5084040FDOQ5084040

Authors: Elham Mehdi-Nezhad, Amir M. Rahimi 

Publication date: 23 June 2022

Full work available at URL: https://pjm.ppu.edu/sites/default/files/papers/PJM_November_2021_243_to_250.pdf

Recommendations

• Semirings with an almost division algorithm.
• scientific article; zbMATH DE number 515505
• Left Euclidean (2, 2)-Algebras
• scientific article; zbMATH DE number 3895255
• scientific article; zbMATH DE number 4051839

zbMATH Keywords

ideallower setcommutator latticealmost division algorithmEuclidean commutator latticejoin absorptive subsets of order \(t\) (a fixed positive integer)

Mathematics Subject Classification ID

Euclidean rings and generalizations (13F07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Euclidean semimodules.
• Title not available (Why is that?)
• Euclidean modules
• Title not available (Why is that?)
• Semirings with an almost division algorithm.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The annihilation graphs of commutator posets and lattices with respect to an ideal
• The annihilation graphs of commutator posets and lattices with respect to an element
• What Happens When the Division Algorithm “Almost” Works

Cited In (2)

• Title not available (Why is that?)
• Semirings with an almost division algorithm.

This page was built for publication: Substructures with an almost division algorithm in Euclidean commutator lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084040)