Related papers: Completely Representable Lattices
In this paper, we show that given a weakly dicomplemented lattice (WDL) $\mathcal{L}=(L; \vee, \wedge, ^{\Delta}, ^{\nabla}, 0, 1)$, $^{\Delta}$ induces a structure of a dual weakly complemented lattice in the lattice $(F(L), \subseteq)$ of…
The set of all subracks $\mathcal{R}(X)$ of a finite rack $X$ form a lattice under inclusion. We prove that if a rack $X$ satisfies a certain condition then the homotopy type of the order complex of $\mathcal{R}(X)$ is a $(m-2)$-sphere,…
Self-similar binary one-dimensional (1D) quasilattices (QLs) are classified into mutual local-derivability (MLD) classes. It is shown that the MLD classification is closely related to the number-theoretical classification of parameters…
Let $L$ be a distributive lattice and $R(L)$ the associated Hibi ring. We compute $\reg R(L)$ when $L$ is a planar lattice and give a lower bound for $\reg R(L)$ when $L$ is non-planar, in terms of the combinatorial data of $L.$ As a…
We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…
A representation embedding between cartesian theories can be defined to be a functor between respective categories of models that preserves finitely-generated projective models and that preserves and reflects certain epimorphisms. This…
Conventional representation learning methods learn a universal representation that primarily captures dominant semantics, which may not always align with customized downstream tasks. For instance, in animal habitat analysis, researchers…
Contact algebra is one of the main tools in the region-based theory of space. It is an extension of Boolean algebra with a relation called contact. The elements of the Boolean algebra are considered as formal representations of physical…
Learned representations are often invariant to rotational transformations, leaving individual dimensions non-identifiable and interchangeable. We study how Matryoshka Representation Learning (MRL) induces a task-aligned privileged basis…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with…
We develop the theory of residuated lattices by introducing and studying several new types of filters and related concepts, including semi-simple filters, essential filters, the socle of a filter, and independent families of filters. Our…
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
Brauer and Thrall conjectured that a finite-dimensional algebra over a field of bounded representation type is actually of finite representation type and a finite-dimensional algebra (over an infinite field) of infinite representation type…
In this paper, the ordered set of rough sets determined by a quasiorder relation $R$ is investigated. We prove that this ordered set is a complete, completely distributive lattice. We show that on this lattice can be defined three different…
In this paper, we investigate the ideals of semidirect products of L-algebras and the structure of simple L-algebras. We provide a precise characterization of the ideals of semidirect products and describe the structure of their prime…
We describe the absolute retracts for the following classes of finite lattices: (1) slim semimodular lattices, (2) finite distributive lattices, and for each positive integer $n$, (3) at most $n$-dimensional finite distributive lattices.…
Causal representation learning (CRL) aims to identify the underlying latent variables from high-dimensional observations, even when variables are dependent with each other. We study this problem for latent variables that follow a…
We investigate the representation and complete representation classes for algebras of partial functions with the signature of relative complement and domain restriction. We provide and prove the correctness of a finite equational…
On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…