Related papers: Completely Representable Lattices
By a rectangular distributive lattice we mean the direct product of two non-singleton finite chains. We prove that the retracts (ordered by set inclusion and together with the empty set) of a rectangular distributive lattice $G$ form a…
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
Rule-based models, e.g., decision trees, are widely used in scenarios demanding high model interpretability for their transparent inner structures and good model expressivity. However, rule-based models are hard to optimize, especially on…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…
We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the…
Suppose B is the unital algebra consisting of the algebraic product of full matrix algebras over an index set X. A bijection is set up between the equivalence classes of irreducible representations of B as operators on a Banach space and…
Fair representation learning (FRL) is a popular class of methods aiming to produce fair classifiers via data preprocessing. Recent regulatory directives stress the need for FRL methods that provide practical certificates, i.e., provable…
A join-semilattice $L$ is said to be conjunctive if it has a top element $1$ and it satisfies the following first-order condition: for any two distinct $a,b\in L$, there is $c\in L$ such that either $a\vee c\not=1=b\vee c$ or $a\vee…
We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…
A rotational lattice is a structure (L;\vee,\wedge, g) where L=(L;\vee,\wedge) is a lattice and g is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using J\'onsson's lemma,…
Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…
Disentangled Representation Learning (DRL) aims to learn a model capable of identifying and disentangling the underlying factors hidden in the observable data in representation form. The process of separating underlying factors of variation…
This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…
We start the study of glider representations in the setting of semisimple Lie algebras. A glider representation is defined for some positively filtered ring $FR$ and here we consider the right bounded algebra filtration $FU(\mathfrak{g})$…
For a modular lattice $L$ of finite length, we prove that the distributivity of $L$ is a sufficient condition while its 2-distributivity is a necessary condition that those sublattices of $L$ that are closed under taking relative…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…
We introduce a real vector space composed of set-valued maps on an open set X and note it by S. It is a complete metric space and a complete lattice. The set of continuous functions on X is dense in S as in a metric space and as in a…
A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…
In [A. Stolz and A. Thom, On the lattice of normal subgroups in ultraproducts of compact simple groups, PLMS 108(1), 2014] it was stated that the lattice of normal subgroups of an ultraproduct of finite simple groups is always linearly…