OpenAI reports a colored-graph criterion for finite congruence lattices

A finite nonempty lattice is the full congruence lattice of some finite algebra exactly when it admits the finite colored-graph witness specified in the manuscript, whose edge colors encode the required congruence relations.

Curated contributions 1

Understand the problem ↓

Understanding the problem

Read the background

A finite nonempty lattice is the full congruence lattice of some finite algebra exactly when it admits the finite colored-graph witness specified in the manuscript, whose edge colors encode the required congruence relations.

Why it matters

If correct, characterizes finite-algebra congruence lattices by a finite combinatorial witness.

What counts as progress

Which finite lattices arise as full congruence lattices of finite algebras?

Website timeline

Publication dates and editorial changes.