Table of Contents
Fetching ...

Local structure of idempotent algebras II

Andrei A. Bulatov

TL;DR

The paper advances the local-structure analysis of finite idempotent algebras by enriching the edge-colored graph framework with thick/thin edges and smoothness concepts, then proving strong directed connectivity for maximal elements via asm-paths. It develops rectangularity results for as-components and maximal components within subdirect products, and introduces quasi-2-decomposability with a quasi-majority operation to capture near-Chinese-remainder behavior in the generated variety. The ternary case and a comprehensive inductive framework underpin a broad quasi-2-decomposition theorem, with extensions to general maximal-generated algebras and almost trivial relation structures. Collectively, these results provide structural decompositions and connectivity that inform constraint satisfaction contexts and Mal'tsev-like reasoning in finite algebras.

Abstract

In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful structural features of subdirect products of idempotent algebras such as rectangularity and 2-decomposition.

Local structure of idempotent algebras II

TL;DR

The paper advances the local-structure analysis of finite idempotent algebras by enriching the edge-colored graph framework with thick/thin edges and smoothness concepts, then proving strong directed connectivity for maximal elements via asm-paths. It develops rectangularity results for as-components and maximal components within subdirect products, and introduces quasi-2-decomposability with a quasi-majority operation to capture near-Chinese-remainder behavior in the generated variety. The ternary case and a comprehensive inductive framework underpin a broad quasi-2-decomposition theorem, with extensions to general maximal-generated algebras and almost trivial relation structures. Collectively, these results provide structural decompositions and connectivity that inform constraint satisfaction contexts and Mal'tsev-like reasoning in finite algebras.

Abstract

In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in arXiv:2006.09599. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful structural features of subdirect products of idempotent algebras such as rectangularity and 2-decomposition.

Paper Structure

This paper contains 14 sections, 37 theorems, 31 equations.

Key Result

Theorem 1

Let ${\mathbb A}$ be an idempotent algebra ${\mathbb A}$ such that ${\sf var}({\mathbb A})$ omits type 1. Then

Theorems & Definitions (64)

  • Theorem 1: Theorem 5(2,3) of Bulatov20:graph
  • Theorem 2: Theorem 12 of Bulatov20:graph
  • Theorem 3: Theorem 21, Corollary 22 of Bulatov20:graph
  • Lemma 4: Lemma 23 of Bulatov20:graph
  • Proposition 5: Lemmas 8,10 of Bulatov20:graph
  • Proposition 6: Proposition 24, Bulatov20:graph
  • Lemma 7: Corollaries 25,29,33 Lemmas 28,32, Bulatov20:graph
  • Proposition 8
  • Lemma 9
  • proof
  • ...and 54 more