Results 1 to 10 of about 63 (57)
On Conditions for Distributivity or Modularity of Congruence Lattices of Commutative Unary Algebras
Izvestiya of Saratov University New Series Series: Mathematics Mechanics Informatics, 2013 The paper is devoted to the problem of describing unary algebras whose congruence lattices have a given property. By now this problem has been solved for algebras with one unary operation. In the paper it is shown that this problem is much more difficult for arbitrary commutative unary algebras. We give some necessary conditions for such lattices to be
V. K. Kartashov +2 more
exaly +2 more sources
Relatively congruence distributive subquasivarieties of a congruence modular variety [PDF]
Bulletin of the Australian Mathematical Society, 1990 We characterise the relatively congruence distributive subquasivarieties of a modular variety using the modular commutator. Our characterisation allows us to extend the results of Dziobiak concerning relatively congruence distributive quasivarieties of nonassociative R-algebras.
openaire +1 more source
, 2017 Congruence lattices of semiprime algebras from semi--degenerate congruence--modular varieties fulfill the equivalences from B. A. Davey`s well--known characterization theorem for $m$--Stone bounded distributive lattices, moreover, changing the cardinalities in those equivalent conditions does not change their validity.
openaire +2 more sources
Some of the next articles are maybe not open access.
On congruence distributivity and modularity
Algebra Universalis, 1983Let \(\epsilon\) be a lattice equation. We say that \(\epsilon\) implies congruence modularity (congruence distributivity) if whenever \({\mathcal K}\) is a variety of algebras all of whose congruence lattices satisfy \(\epsilon\) then all of these lattices are modular (distributive).
Ralph Freese +2 more
exaly +3 more sources
Congruence modularity is permutability composed with distributivity
Archiv Der Mathematik, 1981exaly +2 more sources
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2021
The asynchronous master-worker model is a classic method used to distribute evolutionary algorithms, as it can allow for decoupling of population size from the number of available processors while at the same time being naturally load balanced. While easy to implement, it suffers from an unavoidable choke point: the master process, which must process ...
Joshua Karns, Travis Desell
openaire +1 more source
The asynchronous master-worker model is a classic method used to distribute evolutionary algorithms, as it can allow for decoupling of population size from the number of available processors while at the same time being naturally load balanced. While easy to implement, it suffers from an unavoidable choke point: the master process, which must process ...
Joshua Karns, Travis Desell
openaire +1 more source
Distributed Algorithms for Solving Modular Congruences over Networks
2020 American Control Conference (ACC), 2020This paper presents a family of discrete-time distributed algorithms that enable nodes in an undirected, connected network to solve, in a fully decentralized fashion, a system of modular congruences whose residues and pairwise coprime moduli are locally known to the nodes.
Xiang Li, Choon Yik Tang
openaire +1 more source
A congruence modular variety that is neither congruence distributive nor 3-permutable
Soft Computing, 2013We present an example of a variety of algebras which is congruence modular but not congruence distributive or congruence n-permutable for each n ? 2.
openaire +1 more source
Finitely based modular congruence varieties are distributive
Algebra Universalis, 1994\textit{R. Dedekind} introduced the modular law, a lattice equation true in most of the lattices associated with classical algebraic systems [Ueber Zerlegungen von Zahlen durch ihre grössten gemeinsamen Teiler'', Braunschw. Festschr. 1-40 (1897), reprinted in ``Gesammelte mathematische Werke, Vol. 2'', pp. 103-148, Chelsea, New York (1968)].
openaire +2 more sources