Related papers: Algebraic duality for partially ordered sets
For a lattice L with 0 and 1, let Princ L denote the ordered set of principal congruences of L. For {0,1}-sublattices A subseteq B of L, congruence generation defines a natural map from Princ A to Princ B. In this way, we obtain a small…
We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…
For a group $G$, we construct a quasi morphism from its left orderings and the map from the space of left orderings to the second bounded cohomology. We show that these maps reflect various properties of the group orderings.
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
A well-known and old result of Hazewinkel and Koszul states that the cohomology of a finite-dimensional Lie algebra is isomorphic, up to a suitable shift, to its twisted homology, a Lie-theoretical version of Poincare duality. This paper…
We continue our study of topological partial *-algebras, focusing our attention to *-semisimple partial *-algebras, that is, those that possess a {multiplication core} and sufficiently many *-representations. We discuss the respective roles…
We prove a certain duality relation for orthogonal polynomials defined on a finite set. The result is used in a direct proof of the equivalence of two different ways of computing the correlation functions of a discrete orthogonal polynomial…
We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…
It has long been known in universal algebra that any distributive sublattice of congruences of an algebra which consists entirely of commuting congruences yields a sheaf representation of the algebra. In this paper we provide a…
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…
It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
A closure endomorphism of a Hilbert algebra A is a mapping that is simultaneously an endomorphism of and a closure operator on A. It is known that the set CE of all closure endomorphisms of A is a distributive lattice where the meet of two…
The set of all transformation monoids on a fixed set of infinite cardinality \lambda, equipped with the order of inclusion, forms a complete algebraic lattice Mon(\lambda) with 2^{\lambda} compact elements. We show that this lattice is…
We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…
In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…
We develop a common semantic framework for the interpretation both of $\mathbf{IPC}$, the intuitionistic propositional calculus, and of logics weaker than $\mathbf{IPC}$ (substructural and subintuitionistic logics). This is done by proving…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The paper deals with $C^*$-algebras generated by a net of Hilbert spaces over a partially ordered set. The family of those algebras constitutes a net of $C^*$-algebras over the same set. It is shown that every such an algebra is graded by…