Author:
Aslan Tuğba,Khaled Mohamed,Székely Gergely
Abstract
AbstractWe 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.
Funder
National University of Public Service
Publisher
Springer Science and Business Media LLC
Reference28 articles.
1. Beaumont, R.A., Zuckerman, H.S.: A characterization of the subgroups of the additive rationals. Pacific J. Math. 1, 169–177 (1951)
2. Berthiaume, P.: The injective envelope of S-sets. Canad. Math. Bull. 10, 261–273 (1967)
3. Černegová, M., Jakubíková-Studenovská, D.: The lattice of convexities of partial monounary algebras. Algebra Univ. 79, 10 (2018)
4. Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, vol. II. American Mathematical Soc, Providence (1967)
5. Dwinger, Ph., Yaqub, F.M.: Generalized free products of Boolean algebras with an amalgamated subalgebra. Indag. Math. 25, 225–231 (1963)