16 research outputs found

    Bounded fractional intersecting families are linear in size

    Full text link
    Using the sunflower method, we show that if θ∈(0,1)∩Q\theta \in (0,1) \cap \mathbb{Q} and F\mathcal{F} is a O(n1/3)O(n^{1/3})-bounded θ\theta-intersecting family over [n][n], then ∣F∣=O(n)\lvert \mathcal{F} \rvert = O(n), and that if F\mathcal{F} is o(n1/3)o(n^{1/3})-bounded, then ∣F∣≤(32+o(1))n\lvert \mathcal{F} \rvert \leq (\frac{3}{2} + o(1))n. This partially solves a conjecture raised in (Balachandran et al., Electron J. Combin. 26 (2019), #P2.40) that any θ\theta-intersecting family over [n][n] has size at most linear in nn, in the regime where we have no very large sets.Comment: 7 page

    High dimensional Hoffman bound and applications in extremal combinatorics

    Full text link
    One powerful method for upper-bounding the largest independent set in a graph is the Hoffman bound, which gives an upper bound on the largest independent set of a graph in terms of its eigenvalues. It is easily seen that the Hoffman bound is sharp on the tensor power of a graph whenever it is sharp for the original graph. In this paper, we introduce the related problem of upper-bounding independent sets in tensor powers of hypergraphs. We show that many of the prominent open problems in extremal combinatorics, such as the Tur\'an problem for (hyper-)graphs, can be encoded as special cases of this problem. We also give a new generalization of the Hoffman bound for hypergraphs which is sharp for the tensor power of a hypergraph whenever it is sharp for the original hypergraph. As an application of our Hoffman bound, we make progress on the problem of Frankl on families of sets without extended triangles from 1990. We show that if 12n≤2k≤23n,\frac{1}{2}n\le2k\le\frac{2}{3}n, then the extremal family is the star, i.e. the family of all sets that contains a given element. This covers the entire range in which the star is extremal. As another application, we provide spectral proofs for Mantel's theorem on triangle-free graphs and for Frankl-Tokushige theorem on kk-wise intersecting families

    The Distortion of Locality Sensitive Hashing

    Get PDF
    Given a pairwise similarity notion between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity. LSH is a powerful algorithmic tool for large-scale applications and much work has been done to understand LSHable similarities, i.e., similarities that admit an LSH. In this paper we focus on similarities that are provably non-LSHable and propose a notion of distortion to capture the approximation of such a similarity by a similarity that is LSHable. We consider several well-known non-LSHable similarities and show tight upper and lower bounds on their distortion. We also experimentally show that our upper bounds translate to

    Rostocker Mathematisches Kolloquium. Heft 46 (1993)

    Get PDF

    Global hypercontractivity and its applications

    Get PDF
    The hypercontractive inequality on the discrete cube plays a crucial role in many fundamental results in the Analysis of Boolean functions, such as the KKL theorem, Friedgut's junta theorem and the invariance principle. In these results the cube is equipped with the uniform measure, but it is desirable, particularly for applications to the theory of sharp thresholds, to also obtain such results for general pp-biased measures. However, simple examples show that when p=o(1)p = o(1), there is no hypercontractive inequality that is strong enough. In this paper, we establish an effective hypercontractive inequality for general pp that applies to `global functions', i.e. functions that are not significantly affected by a restriction of a small set of coordinates. This class of functions appears naturally, e.g. in Bourgain's sharp threshold theorem, which states that such functions exhibit a sharp threshold. We demonstrate the power of our tool by strengthening Bourgain's theorem, thereby making progress on a conjecture of Kahn and Kalai and by establishing a pp-biased analog of the invariance principle. Our results have significant applications in Extremal Combinatorics. Here we obtain new results on the Tur\'an number of any bounded degree uniform hypergraph obtained as the expansion of a hypergraph of bounded uniformity. These are asymptotically sharp over an essentially optimal regime for both the uniformity and the number of edges and solve a number of open problems in the area. In particular, we give general conditions under which the crosscut parameter asymptotically determines the Tur\'an number, answering a question of Mubayi and Verstra\"ete. We also apply the Junta Method to refine our asymptotic results and obtain several exact results, including proofs of the Huang--Loh--Sudakov conjecture on cross matchings and the F\"uredi--Jiang--Seiver conjecture on path expansions.Comment: Subsumes arXiv:1906.0556

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    LIPIcs, Volume 244, ESA 2022, Complete Volume

    Get PDF
    LIPIcs, Volume 244, ESA 2022, Complete Volum

    29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan

    Get PDF
    corecore