منابع مشابه
Density near zero
Let $S$ be a dense subsemigroup of $(0,+infty)$. In this paper, we state definition of thick near zero, and also we will introduce a definition that is equivalent to the definition of piecewise syndetic near zero which presented by Hindman and Leader in [6]. We define density near zero for subsets of $S$ by a collection of nonempty finite subsets of $S$ and we investigate the conditions un...
متن کاملZero sets in pointfree topology and strongly $z$-ideals
In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...
متن کاملIndependent Zero-Knowledge Sets
We define and construct Independent Zero-Knowledge Sets (ZKS) protocols. In a ZKS protocols, a Prover commits to a set S, and for any x, proves non-interactively to a Verifier if x ∈ S or x / ∈ S without revealing any other information about S. In the independent ZKS protocols we introduce, the adversary is prevented from successfully correlate her set to the one of a honest prover. Our notion ...
متن کاملClosed Measure Zero Sets
We study the relationship between the σ-ideal generated by closed measure zero sets and the ideals of null and meager sets. We show that the additivity of the ideal of closed measure zero sets is not bigger than covering for category. As a consequence we get that the additivity of the ideal of closed measure zero sets is equal to the additivity of the ideal of meager sets.
متن کاملZero-Knowledge Sets
We show how a polynomial-time prover can commit to an arbitrary finite set S of strings so that, later on, he can, for any string x, reveal with a proof whether x 2 S or x 62 S, without revealing any knowledge beyond the verity of these membership assertions. Our method is non interactive. Given a public random string, the prover commits to a set by simply posting a short and easily computable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1968
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1968-11992-5