A. Zamojska-Dzienio | Searcharxiv

arXiv2026

Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond

We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be true for bounded lattices. Since the class of semidistributive lattices is the intersection of classes of join- and meet-semidistributive lattices, we study also complements for these classes, and in particular convex geometries of convex dimension 2, which is a subclass of join-semidistributive lattices. In the latter case, we describe the complements of maximal sublattices completely, as well as the procedure of finding all complements of maximal sublattices.

math.RA↗

arXiv2026

The inverse problem of convex polygon coordinates

Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. Various approaches to this problem have arisen, in various contexts. The most general solution, namely the Gibbs coordinates based on entropy maximization, actually work in the broader setting of barycentric algebras, which constitute semilattice-ordered systems of convex sets. These coordinates involve exponential functions. For convex polytopes, Wachspress coordinates offer solutions which only involve rational functions. The current paper is primarily focused on convex polygons in the plane. After summarizing the Gibbs and Wachspress coordinates, we identify where they agree, and provide comparisons between them when they do not. With an example, we also show how Gibbs coordinates of a polygon with rational vertices may be construed as algebraic functions.

math.MG↗