Related papers: Rough sets determined by tolerances
Rough sets induced by quasiorders appear in several constructions using binary relations in computer science. In this paper, a structural characterisation of rough sets induced by quasiorders is given. These rough sets form Nelson algebras…
We show that all finite lattices, including non-distributive lattices, arise as stable matching lattices when all agents have path-independent choice functions. This result answers an open question of Blair~\cite{blair1988lattice}. In the…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a combinatorial generalization of linear independence in vector spaces. In this paper, we define a parametric set…
Among the nondegenerate C^4 hypersurfaces M in R^n, we characterize the rational quadrics as the hypersurfaces that are the least well approximated by rational points. Given M other than a rational quadric, we prove a heuristically sharp…
Let R be a von Neumann algebra acting on a Hilbert space H and let R_sa be the set of selfadjoint elements of R. It is well known that R_sa is a lattice with respect to the usual partial order ≤ if and only if R is abelian. We define…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
Let $L$ denote a finite lattice with at least two points and let $A$ denote the incidence algebra of $L$. We prove that $L$ is distributive if and only if $A$ is an Auslander regular ring, which gives a homological characterisation of…
Using ideas of Olson \cite{Ols} who showed that the system of effect operators of a Hilbert space can be ordered by the so-called spectral order such that the system of effect operators is a complete lattice. Using his ideas, we introduce a…
Let $H < G$ both be noncompact connected semisimple real algebraic groups where the former is maximal proper and $\Gamma < G$ be a lattice. Building on the work of Gorodnik-Weiss, we refine their techniques and obtain effective results.…
We construct examples of Delone sets of the plane (that is, discrete subsets that are uniformly separated and coarsely dense) that are repetitive (each patch of the set appears in every large-enough ball) though non-rectifiable (i.e. non…
Sorting is one of the most basic primitives in many algorithms and data analysis tasks. Comparison-based sorting algorithms, like quick-sort and merge-sort, are known to be optimal when the outcome of each comparison is error-free. However,…
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…
Let L_1 and L_2 be complete atomistic lattices. In a previous paper, we have defined a set S=S(L_1,L_2) of complete atomistic lattices, the elements of which are called weak tensor products of L_1 and L_2. S is defined by means of three…
We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of $\mathbb{N}$. Along the way, we discuss all relevant results about lattices, Boolean algebras and…
It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…
Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection between elements of a distributive lattice and the family of upper sets of an associated poset. Although not used explicitly, this result is at the backbone of the…
This paper is concerned with certifying that a given point is near an exact root of an overdetermined or singular polynomial system with rational coefficients. The difficulty lies in the fact that consistency of overdetermined systems is…
Let $A$ be a basic finite-dimensional algebra and denote by $\operatorname{tors} A$ the collection of all all torsion classes of $A$. It has been proved in \cite{Demonet} that $\operatorname{tors} A$ is always a completely semidistributive…
We show that linearly repetitive weighted Delone sets in groups of polynomial growth have a uniquely ergodic hull. This result applies in particular to the linearly repetitive weighted Delone sets in homogeneous Lie groups constructed in…