Related papers: Doubling tolerances and coalition lattices
The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…
Let $L$ be a finite extension of the rational function field over a finite field $\mathbb{F}_q$ and $E$ be a Drinfeld module defined over $L$. Given finitely many elements in $E(L)$, this paper aims to prove that linear relations among…
Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…
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…
Using a simulated annealing, we examine a bipartitioning of small worlds obtained by adding a fraction of randomly chosen links to a one-dimensional chain or a square lattice. Models defined on small worlds typically exhibit a mean-field…
We study several separation axioms for $X$-top-lattices (i.e. a lattice $L$ for which a given subset $X\subseteq L\backslash \{1\}$ admits a \emph{% Zariski-like topology}). Such spaces are $T_{0}$ and usually far away from being $T_{2}.$…
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…
The notion of a semitransitive binary action of a group $G$ on a topological space is introduced. A duality theorem is proved, establishing a bijective correspondence between semitransitive distributive binary $G$-spaces and topological…
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…
A lattice model is used to estimate the self-diffusivity of entangled cyclic and linear polymers in blends of varying compositions. To interpret simulation results, we suggest a minimal model based on the physical idea that constraints…
In a finite group G with subgroup H, the Chermak-Delgado measure of H (in G) is defined as the product of the order of H with the order of the centralizer of H. The Chermak-Delgado lattice of G, denoted CD(G), is the set of all subgroups…
Given a poset $P$ with at least two elements and a group $G$, there exists a selfdual lattice of length 16 such that the collection of its principal congruences is order isomorphic to $P$ while its automorphism group to $G$.
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. The conjecture has been proved under some - rather strong - \emph{structural}…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show…
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional…
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…
We denote by Conc(L) the semilattice of all finitely generated congruences of a lattice L. For varieties (i.e., equational classes) V and W of lattices such that V is contained neither in W nor its dual, and such that every simple member of…