Independent sets in the hypercube revisited

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Independent sets in the discrete hypercube

We describe a proof of A. Sapozhenko that the number of independent sets in the discrete d-dimensional hypercube Qd is asymptotically 2 √ e22 d−1 as d tends to infinity.

متن کامل

LSH on the Hypercube Revisited

LSH (locality sensitive hashing) had emerged as a powerful technique in nearest-neighbor search in high dimensions [IM98, HIM12]. Given a point set P in a metric space, and given parameters r and ε > 0, the task is to preprocess the point set, such that given a query point q, one can quickly decide if q is in distance at most ≤ r or ≥ (1+ε)r from the query point. Once such a near-neighbor data-...

متن کامل

On mobile sets in the binary hypercube

If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k + 3)-dimensional binary hypercube, there exists a mobile set of cardinality 2 · 6 that cannot be split into mobile sets of smaller cardinalities or represented as a natural extension of a mobile set in a hypercube of

متن کامل

Resistant sets in the unit hypercube

Ideal matrices and clutters are prevalent in Combinatorial Optimization, ranging from balanced matrices, clutters of T -joins, to clutters of rooted arborescences. Most of the known examples of ideal clutters are combinatorial in nature. In this paper, rendered by the recently developed theory of cuboids, we provide a different class of ideal clutters, one that is geometric in nature. The advan...

متن کامل

A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube

Let I be an independent set drawn from the discrete d-dimensional hypercube Qd = {0, 1}d according to the hard-core distribution with parameter λ > 0 (that is, the distribution in which each set I is chosen with probability proportional to λ|I|). We show a sharp transition around λ = 1 in the appearance of I: for λ > 1, min{|I∩E|, |I∩O|} = 0 almost surely, where E andO are the bipartition class...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the London Mathematical Society

سال: 2020

ISSN: 0024-6107,1469-7750

DOI: 10.1112/jlms.12331