Related papers: Congruences on posets, relatively pseudocomplement…
Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…
S. I. Agafonov and E. V. Ferapontov have introduced a construction that allows naturally associating to a system of partial differential equations of conservation laws a congruence of lines in an appropriate projective space. In particular…
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations,…
A careful study is made of embeddings of posets which have a convex range. We observe that such embeddings share nice properties with the homomorphisms of more restrictive categories; for example, we show that every order embedding between…
The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…
Given a family $\F$ of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category $\C_{\F}$ called the \emph{incidence category of $\F$}. This category is "nearly abelian" in the sense that all…
We study the equivalence relation on the set of acyclic orientations of an undirected graph G generated by source-to-sink conversions. These conversions arise in the contexts of admissible sequences in Coxeter theory, quiver…
In this paper we discuss the notion of completeness of topologized posets and survey some recent results on closedness properties of complete topologized semilattices.
A number of results related to statistical classification on convex sets are presented. In particular, the focus is on the case where some of the covariates in the data and observation being classified can be missing. The form of the…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…
This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…
Necessary and sufficient conditions for convexity and strong convexity, respectively, of sublevel sets that are defined by finitely many real-valued $C^{1,1}$-maps are presented. A novel characterization of strongly convex sets in terms of…
Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of the present paper in order to establish a useful tool for studying the logic of quantum mechanics. They investigated structural…
We introduce persistence with an emphasis on its algebraic foundations, using the representation theory of posets. Linear representations of posets arise in several areas of mathematics, including the representation theory of quivers and…
Object pose estimation is frequently achieved by first segmenting an RGB image and then, given depth data, registering the corresponding point cloud segment against the object's 3D model. Despite the progress due to CNNs, semantic…
The Lifting Idempotent Property ($LIP$) of ideals in commutative rings inspired the study of Boolean lifting properties in the context of other concrete algebraic structures ($MV$-algebras, commutative l-groups, $BL$-algebras, bounded…
Deep learning techniques have demonstrated significant capacity in modeling some of the most challenging real world problems of high complexity. Despite the popularity of deep models, we still strive to better understand the underlying…
Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…