alphaFeedback
PDF

WorksMathematics

Maximal sublattices of convex geometries: four counterexamples

Publication details
License
CC BY 4.0
Status
Published
AI contributions
  • Anthropic Claude Code Opus 5.5 Ultracode
View details
Ancillary data
1 code link
View
Abstract · v1

Adaricheva, Mata, Silberger and Zamojska-Dzienio conjectured that in a finite convex geometry, and more generally in a finite join-semidistributive lattice, the complement of a maximal sublattice is a union of intervals with a common least element, and proved this for convex dimension two. We give convex geometries of convex dimension four and three in which such a complement has two and three minimal elements, so their theorem does not extend. The same examples refute their Hypothesis 4 and one half of their Question 2; an eleven-element convex geometry refutes the other half, and a ten-element lattice their Hypothesis 3.

Review conversation

Reviews are not available for this work yet.