相关论文: Algebraic duality for partially ordered sets

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…

We revisit the problem of Stone duality for lattices with various quasioperators, first studied in [14], presenting a fresh duality result. The new result is an improvement over that of [14] in two important respects. First, the…

We introduce two partially ordered sets, $P^A_n$ and $P^B_n$, of the same cardinalities as the type-A and type-B noncrossing partition lattices. The ground sets of $P^A_n$ and $P^B_n$ are subsets of the symmetric and the hyperoctahedral…

A plane poset is a finite set with two partial orders, satisfying a certain incompatibility condition. The set PP of isoclasses of plane posets owns two products, and an infinitesimal Hopf algebra structure is defined on the vector space…

Given a simply connected space $X$, there are several, a priori different, algebraic groups whose groups of $\mathbb Q$-points are isomorphic to the group of homotopy classes of homotopy automorphisms of the rationalization of $X$. We will…

We show how to obtain the dual of any lattice model with inhomogeneous local interactions based on an arbitrary Abelian group in any dimension and on lattices with arbitrary topology. It is shown that in general the dual theory contains…

We reduce the set of classic relational algebra operators to two binary operations: natural join and generalized union. We further demonstrate that this set of operators is relationally complete and honors lattice axioms.

We obtain partial affirmative answers to the question whether isomorphism of the unitary groups of two C*-algebras, either as topological groups or as discrete groups, implies isomorphism of the C*-algebras as real C*-algebras.

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

This article is to give an infinite dimensional analogue of a result of Choi and Effros. We say that an (not necessarily unital) operator system $T$ is \emph{dualizable} if one can find an equivalent dual matrix norm on the dual space $T^*$…

Let $\mathbb{A} = (A, \cdot)$ be a semigroup. We generalize some recent results by G. A. Freiman, M. Herzog and coauthors on the structure theory of set addition from the context of linearly orderable groups to linearly orderable…

Structured optimization uses a prescribed set of atoms to assemble a solution that fits a model to data. Polarity, which extends the familiar notion of orthogonality from linear sets to general convex sets, plays a special role in a simple…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

We study a class of evolutionary partial differential systems with two components related to second order (in time) non-evolutionary equations of odd order in spatial variable. We develop the formal diagonalisation method in symbolic…

A P-set of a symmetric matrix $A$ is a set $\alpha$ of indices such that the nullity of the matrix obtained from $A$ by removing rows and columns indexed by $\alpha$ is $|\alpha|$ more than that of $A$. It is known that each subset of a…

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…

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

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…

P-algebras are a non-commutative, non-associative generalization of Boolean algebras that are for quantum logic what Boolean algebras are for classical logic. P-algebras have type <X, 0, ', .> where 0 is a constant, ' is unary and . is…