1999
DOI: 10.1515/dma.1999.9.4.403
|View full text |Cite
|
Sign up to set email alerts
|

On congruences of finite multibasic universal algebras

Abstract: The subset of congruences of a finite multibasic universal algebra (called the set of maximal conguences) which determines the whole set of congruences is found. The optimality of some method of equation solving with the use of maximal congruences is demonstrated; congruences of quasigroups which are isotopic and cross-isotopic to groups are described. The existence of simple (having no non-trivial congruences) universal algebras defined on sets of any finite orders is proved. With the use of wreath product co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2004
2004
2024
2024

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 1 publication
0
5
0
Order By: Relevance
“…The last proposition shows that our notion of inverse homomorphisms has some new properties, since there exist n-quasigroups that have no nontrivial homomorphisms (see [7]). It also shows that homomorphic relations cannot be reduced to homomorphisms of algebraic systems.…”
Section: Proposition 3 Let F Be a Boolean Function In Two Variables mentioning
confidence: 97%
See 3 more Smart Citations
“…The last proposition shows that our notion of inverse homomorphisms has some new properties, since there exist n-quasigroups that have no nontrivial homomorphisms (see [7]). It also shows that homomorphic relations cannot be reduced to homomorphisms of algebraic systems.…”
Section: Proposition 3 Let F Be a Boolean Function In Two Variables mentioning
confidence: 97%
“…A homomorphic relation can be applied in the same way as homomorphisms [7], π-homomorphisms [3], and crossed homomorphisms [4], for example, for solution of equations over algebras.…”
Section: Definition and Properties Of Homomorphic Relations Of Algebrmentioning
confidence: 99%
See 2 more Smart Citations
“…Therefore we should have easily generated objects (cyclic group, abelian group, group), fast and complicate methods of their transformation (parastrophy, isotopy, isostrophy, crossed isotopy [109], homotopy, generalized isotopy), their glue and blowing (direct product, semi-direct product, wreath product [66], crossed product, generalized crossed product). For these aims various linear quasigroups (especially n-ary quasigrous) are quite suitable [7,85,113].…”
Section: Generation Of Quasigroups For Cryptographical Needsmentioning
confidence: 99%