Answers are grounded in this paper and cite their sources.
We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense, between two given algebras in the class in hand; with the possibility that this distance may take the value ∞ ∞ . We display a number of inspirational examples from different areas of algebra, e.g., group theory and monounary algebras, to show that this research direction can be quite remarkable.
No takes yet. Share an insight, caveat, or question.
Aslan et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: