30 research outputs found
A generalization of the Erdös–Ko–Rado theorem
AbstractIn this note, we investigate some properties of local Kneser graphs defined in [János Körner, Concetta Pilotto, Gábor Simonyi, Local chromatic number and sperner capacity, J. Combin. Theory Ser. B 95 (1) (2005) 101–117]. In this regard, as a generalization of the Erdös–Ko–Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we provide an upper bound for their chromatic number
Shadows and intersections in vector spaces
AbstractWe prove a vector space analog of a version of the Kruskal–Katona theorem due to Lovász. We apply this result to extend Frankl's theorem on r-wise intersecting families to vector spaces. In particular, we obtain a short new proof of the Erdős–Ko–Rado theorem for vector spaces
Cameron-Liebler sets of k-spaces in PG(n,q)
Cameron-Liebler sets of k-spaces were introduced recently by Y. Filmus and F.
Ihringer. We list several equivalent definitions for these Cameron-Liebler
sets, by making a generalization of known results about Cameron-Liebler line
sets in PG(n, q) and Cameron-Liebler sets of k-spaces in PG(2k + 1, q). We also
present a classification result
High dimensional Hoffman bound and applications in extremal combinatorics
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 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 -wise intersecting families
The Distortion of Locality Sensitive Hashing
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
Algebraic shifting of cyclic polytopes and stacked polytopes
AbstractGil Kalai introduced the shifting-theoretic upper bound relation as a method to generalize the g-theorem for simplicial spheres by using algebraic shifting. We will study the connection between the shifting-theoretic upper bound relation and combinatorial shifting. Also, we will compute the exterior algebraic shifted complex of the boundary complex of the cyclic d-polytope as well as of a stacked d-polytope. It will turn out that, in both cases, the exterior algebraic shifted complex coincides with the symmetric algebraic shifted complex
Cameron-Liebler sets of k-spaces in PG(n,q)
Cameron-Liebler sets of k-spaces were introduced recently by Y. Filmus and F.
Ihringer. We list several equivalent definitions for these Cameron-Liebler
sets, by making a generalization of known results about Cameron-Liebler line
sets in PG(n, q) and Cameron-Liebler sets of k-spaces in PG(2k + 1, q). We also
present a classification result