Related papers: Relational lattices via duality
The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…
For a presentation $\mathcal{A}$ of a transversal matroid $M$, we study the set $T_{\mathcal{A}}$ of single-element transversal extensions of $M$ that have presentations that extend $\mathcal{A}$; we order these extensions by the weak…
A lattice L is spatial if every element of L is a join of completely join-irreducible elements of L (points), and strongly spatial if it is spatial and the minimal coverings of completely join-irreducible elements are well-behaved.…
We propose a lattice action for two dimensional super Yang-Mills theory with a twisted N=2 supersymmetry. The extended supersymmetry is fully and exactly realized on the lattice. The method employed is quite general and its extension to the…
The duality between a class of the Davey-Stewartson type coupled systems and a class of two-dimensional Toda type lattices is discussed. For the recently found integrable lattice the hierarchy of symmetries is described. Second and third…
The bulk-boundary and a new bulk-defect correspondence principles are formulated using groupoid algebras. The new strategy relies on the observation that the groupoids of lattices with boundaries or defects display spaces of units with…
Let A be a subspace arrangement with a geometric lattice such that codim(x) > 1 for every x in A. Using rational homotopy theory, we prove that the complement M(A) is rationally elliptic if and only if the sum of the orthogonal subspaces is…
Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem of of distributive bounded lattices expanded by modalities (functions distributing over joins) as the continuous sections of sheaves. Our…
We show how to construct Hamiltonian lattice theories with one exact supersymmetry on arbitrary triangulations of curved space in any number of dimensions. Both bosons and fermions satisfy discrete K\"{a}hler-Dirac equations. The…
Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual…
In this paper, a subclass of bounded distributive lattices, that is, finitely disjunctive distributive lattices (FDD-lattices) have been introduced. Then we apply it to establish a Stone duality for Lawson compact algebraic L-domains.…
The relation triples extraction method based on table filling can address the issues of relation overlap and bias propagation. However, most of them only establish separate table features for each relationship, which ignores the implicit…
Given two linear relations $A$ and $B$ we characterize the existence of a linear relation (operator) $C$ such that $A\subseteq BC$, respectively $A\subseteq CB.$ These factorizations extend and improve well-known results by R.G. Douglas and…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
In this paper we investigate iteration of maps on lattices and the corresponding polynomial-like iterative equation. Since a lattice need not have a metric space structure, neither the Schauder fixed point theorem nor the Banach fixed point…
In the study of algebras related to non-classical logics, (distributive) semilattices are always present in the background. For example, the algebraic semantic of the $\{\rightarrow,\wedge,\top\}$-fragment of intuitionistic logic is the…
We define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of Eilenberg \cite{Ei}, it is versatile (one can vary the letters, the words and the coefficients). We derive from this…
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
We introduce residuated ortholattices as a generalization of -- and environment for the investigation of -- orthomodular lattices. We establish a number of basic algebraic facts regarding these structures, characterize orthomodular lattices…