论文标题
在部分排序的集合中搜索Quicksand Ideass
Searching for quicksand ideals in partially ordered sets
论文作者
论文摘要
我们考虑一个组合问题，要在已知的poset $λ$中搜索未知理想的$μ$。 $λ$的元素可能会以$μ$的价格查询会员资格，但最多可以允许$ k $ pastic查询结果。目标是找到一种搜索策略，以确保查询的最小总数$ m_k（λ）$中的解决方案。我们为$ m_k（λ）$提供紧密的界限，并为$ k = 2 $和$λ$的情况构建最佳搜索策略是完全有限的有限套件的产品poset，其中一种的基数不超过六。
We consider a combinatorial question about searching for an unknown ideal $μ$ within a known poset $λ$. Elements of $λ$ may be queried for membership in $μ$, but at most $k$ positive query results are permitted. The goal is to find a search strategy which guarantees a solution in a minimal total number $m_k(λ)$ of queries. We provide tight bounds for $m_k(λ)$, and construct optimal search strategies for the case where $k=2$ and $λ$ is the product poset of totally ordered finite sets, one of which has cardinality not more than six.
