With a view toward studying the homotopy type of spaces of Boolean formulae, we introduce a simplicial complex, called the theta complex, associated to any hypergraph. In particular, the set of satisfiable formulae in k-conjunctive normal form with ≤ n variables has the homotopy type of Θ(Cube(n, n− k)), where Cube(n, n− k) is a hypergraph associated to the (n− k)-skeleton of an n-cube. We make...

In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous with certain partitions into powers of 2. In this paper we give a simple bijective proof of this result and a geometric generalization to equality of Ehrhart polynomials between two convex polytopes. We then apply our results to give a new proof of Braun’s conjecture proved recently by the authors [K...

Consider a hypergraph whose vertex set is family of $n$ lines in general position the plane, and hyperedges are induced by intersections with pseudo-discs. We prove that number $t$-hyperedges bounded $O_t(n^2)$ total $O(n^3)$. Both bounds tight.

Generation problems are the problems of enumerating all configurations that satisfy a given specification. Our research is focused on the generation of all maximal satisfying truth assignments of arbitrary Boolean expressions in Conjunctive Normal Form, a generalization of the well-known transversal hypergraph problem, that is, the problem of generating all minimal hitting sets (transversals) o...

A triangle $T'$ is $\varepsilon$-similar to another $T$ if their angles pairwise differ by at most $\varepsilon$. Given a $T$, $\varepsilon>0$ and $n\in\mathbb{N}$, B\'ar\'any F\"uredi asked determine the maximum number of triangles $h(n,T,\varepsilon)$ being in planar point set size $n$. We show that for almost all there exists $\varepsilon=\varepsilon(T)>0$ such $h(n,T,\varepsilon)=n^3/24 (1+...

Let q be a prime power. It is shown that for any hypergraph ~,~ = {F~,..., Fdtq_~)+~ } whose maximal degree is d, there exists Z ¢ ~o c ~, such that IUF~oFI =-0 (rood q). For integers d, m __ 1 let fe(m) denote the minimal t such that for any hypergraph -~ = {Fz . . . . . Ft} whose maximal degree is d, there exists ~ ¢ o~ o c Y, such that I~F~ ~oFI -= 0 (mod m). Here we determine fd(m) when m i...

Let T be a simple k-uniform hypertree with t edges. It is shown that if H is any k-uniform hypergraph with n vertices and with minimum degree at least n k−1 2k−1(k−1)! (1+o(1)), and the number of edges of H is a multiple of t then H has a T -decomposition. This result is asymptotically best possible for all simple hypertrees with at least two edges. Mathematics Subject Classification (1991): 05...

Let 1 ≤ t ≤ 7 be an integer and let F be a k-uniform hypergraph on n vertices. Suppose that |A∩B∩C∩D| ≥ t holds for all A,B,C,D ∈ F . Then we have |F | ≤ (n−t k−t ) if | k n − 2 |< ε holds for some ε > 0 and all n > n0(ε). We apply this result to get EKR type inequalities for “intersecting and union families” and “intersecting Sperner families.”