arXiv · 2112.12587
On the networks of large embeddings
Abstract
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 $\infty$. 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Tuğba Aslan, Mohamed Khaled, Gergely Székely. 2021-12-20. On the networks of large embeddings. https://arxiv.org/abs/2112.12587
Cite the original work for its findings. Save a collection to share your selection of sources.