arXiv Open Access 2017

Loop conditions

Miroslav Olšák

Lihat Sumber

Abstrak

We discuss such Maltsev conditions that consist of just one linear equation, we call them loop conditions. To every such condition can be assigned a graph. We provide a classification of conditions with undirected graphs. It follows that the Siggers term is the weakest non-trivial loop condition.

Topik & Kata Kunci

math.LO math.CO

Penulis (1)

Miroslav Olšák

Format Sitasi

APA MLA BibTeX

Olšák, M. (2017). Loop conditions. https://arxiv.org/abs/1701.00260

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2017
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓