Related papers: Rough Sets Determined by Quasiorders

In this paper, we prove that the set of triangulations of a polygon can be equipped with an order to become a lattice. First, we define this order. In [HN99], authors defined the flip operator and then prove some properties of the graph of…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We characterize well-founded algebraic lattices by means of forbidden subsemilattices of the join-semilattice made of their compact elements. More specifically, we show that an algebraic lattice $L$ is well-founded if and only if $K(L)$,…

In this paper, we introduce a partial order on rings with involution, which is a generalization of the partial order on the set of projections in a Rickart *-ring. We prove that a *-ring with the natural partial order form a sectionally…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

Expanding the library of self-assembled superstructures provides insight into the behavior of atomic crystals and supports the development of materials with mesoscale order. Here we build upon recent findings of soft matter quasicrystals…

Applying (enriched) categorical structures we define the notion of ordered sheaf on a quantaloid Q, which we call `Q-order'. This requires a theory of semicategories enriched in the quantaloid Q, that admit a suitable Cauchy completion.…

We perform a general study of spin ordering on the pyrochlore lattice with a 3:1 proportionality of two spin polarizations. Equivalently, this describes valence bond solid conformations of a quantum dimer model on the diamond lattice. We…

This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…

In 2004 Anna Maria Radzikowska et al \cite{RK2004} investigated the fuzzy rough sets where the set of truth values is an arbitrary residuated lattice. In this paper, we extend their work by considering a residuated multilattice $M$ as the…

In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…

Traditional scoring approaches on hesitant fuzzy sets often lack a formal base in order theory. This paper proposes a unified framework, where each score is explicitly defined with respect to a given order. This order-oriented perspective…

We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner…

This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

A proper merging of two disjoint quasi-ordered sets $P$ and $Q$ is a quasi-order on the union of $P$ and $Q$ such that the restriction to $P$ and $Q$ yields the original quasi-order again and such that no elements of $P$ and $Q$ are…

Let $\mathcal{CT}_n$ be the semigroup of full contraction mappings on $[n]=\{1,2,\ldots,n\}$, and let $\mathcal{OCT}_n$ and $\mathcal{ODCT}_n$ be the subsemigroups consisting of all order-preserving full contraction and subsemigroup of…

Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees.…

We consider monoids equipped with a compatible quantale valued relation, to which we call quantale enriched monoids, and study semidirect products of such structures. It is well-known that semidirect products of monoids are closely related…

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…