Related papers: A Primer on Chainmails: Structures for Point-free …
We develop a hierarchy of semilattice bases (S-bases) for frames. For a given (unbounded) meet-semilattice $A$, we analyze the interval in the coframe of sublocales of the frame of downsets of $A$ formed by all frames with the S-base $A$.…
Connectedness, path connectedness, and uniform connectedness are well-known concepts. In the traditional presentation of these concepts there is a substantial difference between connectedness and the other two notions, namely connectedness…
Each straight infinite line defined by two vertices of a finite square point lattice contains (covers) these two points and a - possibly empty - subset of points that happen to be collinear to these. This work documents vertex subsets of…
In this work, we propose a new signal routing method for solving routing problems that occur in the design process of semiconductor package substrates. Our work uses a topological transformation of the layers of the package substrate in…
A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
Linkages are mechanical devices constructed from rigid bars and freely rotating joints studied both for their utility in engineering and as mathematical idealizations in a number of physical systems. Recently, there has been a resurgence of…
We introduce a lattice structure as a generalization of meet-continuous lattices and quantales. We develop a point-free approach to these new lattices and apply these results to $R$-modules. In particular, we give the module counterpart of…
A specialization semilattice is a join semilattice together with a coarser preorder $ \sqsubseteq $ satisfying an appropriate compatibility condition. If $X$ is a topological space, then $(\mathcal P(X), \cup, \sqsubseteq )$ is a…
In 1985, Golumbic and Scheinerman established an equivalence between comparability graphs and containment graphs, graphs whose vertices represent sets, with edges indicating set containment. A few years earlier, McMorris and Zaslavsky…
The constructive approach to mathematics has the advantage that witnesses can be extracted from statements of existence and theorems can be unwound to give algorithms. Even better, constructive theorems can be interpreted in any topos,…
The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…
We introduce semitopologies, a generalisation of point-set topology that removes the restriction that intersections of open sets need necessarily be open. The intuition is that points are participants in some distributed system, and an open…
The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the…
Given a poset $P$, a join-specification $\mathcal U$ for $P$ is a set of subsets of $P$ whose joins are all defined. The set $\mathcal I_{\mathcal U}$ of downsets closed under joins of sets in $\mathcal U$ forms a complete lattice, and is,…
The purpose of this note is to illustrate a parallel between (pre)topologies when seen among convergence spaces and (pre)approach spaces when seen among convergence approach spaces, that appears to be a more complete parallel than in the…
The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T)…
A schemoid is a generalization of association schemes from the point of view of small categories. In this article, we discuss schemoid structures for two kinds of small categories; the canonical small category defined by a poset, and…
We consider a fixed basis of a finitely generated free chain complex as a finite topological space and we present a sufficient condition for the singular homology of this space to be isomorphic with the homology of the chain complex.
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…