Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tolerances induced by irredundant coverings (1404.5184v3)

Published 21 Apr 2014 in math.RA and cs.DM

Abstract: In this paper, we consider tolerances induced by irredundant coverings. Each tolerance $R$ on $U$ determines a quasiorder $\lesssim_R$ by setting $x \lesssim_R y$ if and only if $R(x) \subseteq R(y)$. We prove that for a tolerance $R$ induced by a covering $\mathcal{H}$ of $U$, the covering $\mathcal{H}$ is irredundant if and only if the quasiordered set $(U, \lesssim_R)$ is bounded by minimal elements and the tolerance $R$ coincides with the product ${\gtrsim_R} \circ {\lesssim_R}$. We also show that in such a case $\mathcal{H} = { {\uparrow}m \mid \text{$m$ is minimal in $(U,\lesssim_R)$} }$, and for each minimal $m$, we have $R(m) = {\uparrow} m$. Additionally, this irredundant covering $\mathcal{H}$ inducing $R$ consists of some blocks of the tolerance $R$. We give necessary and sufficient conditions under which $\mathcal{H}$ and the set of $R$-blocks coincide. These results are established by applying the notion of Helly numbers of quasiordered sets.

Citations (7)

Summary

We haven't generated a summary for this paper yet.