相关论文: A note on cover free families

An $(r,w;d)$ cover-free family $(CFF)$ is a family of subsets of a finite set such that the intersection of any $r$ members of the family contains at least $d$ elements that are not in the union of any other $w$ members. The minimum number…

An (r;w; d) -cover-free family (CFF) is a family of subsets of a finite set such that the intersection of any r members of the family contains at least d elements that are not in the union of any other w members. The minimum number of…

Let ${\cal F}$ be a set of blocks of a $t$-set $X$. $(X,{\cal F})$ is called $(w,r)$-cover-free family ($(w,r)-$CFF) provided that, the intersection of any $w$ blocks in ${\cal F}$ is not contained in the union of any other $r$ blocks in…

A Hadamard matrix is a scaled orthogonal matrix with $\pm 1$ entries. Such matrices exist in certain dimensions: the Hadamard conjecture is that such a matrix always exists when $n$ is a multiple of 4. A conjecture attributed to Ryser is…

We show that an $n\times n$ circulant Hadamard matrix must satisfy a family of congruence equations that have solutions only when $n \leq 4$, proving Ryser's 1963 conjecture that no such matrices exist for $n>4$.

Hadamard matrices are $(-1, +1)$ square matrices with mutually orthogonal rows. The Hadamard conjecture states that Hadamard matrices of order $n$ exist whenever $n$ is $1$, $2$, or a multiple of $4$. However, no construction is known that…

A family of subsets of a $t$-set is a \emph{$d$-cover-free family} or $d$-CFF if no subset in the family is contained in the union of any $d$ other subsets. Let $t(d, n)$ denote the minimum $t$ for which there exists a $d$-CFF on a $t$-set…

Eberhard and Pohoata conjectured that every $3$-cube-free subset of $[N]$ has size less than $2N/3+o(N)$. In this paper we show that if we replace $[N]$ with $\mathbb{Z}_N$ the upper bound of $2N/3$ holds, and the bound is tight when $N$ is…

Let $HD_d(p,q)$ denote the minimal size of a transversal that can always be guaranteed for a family of compact convex sets in $\mathbb{R}^d$ which satisfy the $(p,q)$-property ($p \geq q \geq d+1$). In a celebrated proof of the…

Let $d$ be a square-free positive integer and $h(d)$ the class number of the real quadratic field $\mathbb{Q}{(\sqrt{d})}.$ In this paper we give an explicit lower bound for $h(n^2+r)$, where $r=1,4$, and also establish an equivalent…

The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg…

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term…

We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we…

It is shown that if $H$ is a circulant Hadamard $4n\ti 4n $ then $n=1$. This proves the Hadamard circulant conjecture.

We show that the maximal determinant D(n) for $n \times n$ ${\pm 1}$-matrices satisfies $R(n) := D(n)/n^{n/2} \ge \kappa_d > 0$. Here $n^{n/2}$ is the Hadamard upper bound, and $\kappa_d$ depends only on $d := n-h$, where $h$ is the maximal…

We study the problem of determining the minimum number $f(n,k,d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}\}$ at least $k$ times while covering the origin at most…

We elaborate on the intimate connection between the largest volume of an empty axis-parallel box in a set of $n$ points from $[0,1]^d$ and cover-free families from the extremal set theory. This connection was discovered in a recent paper of…

Let $({\bf U},{\bf S},d)$ be an instance of Set Cover Problem, where ${\bf U}=\{u_1,...,u_n\}$ is a $n$ element ground set, ${\bf S}=\{S_1,...,S_m\}$ is a set of $m$ subsets of ${\bf U}$ satisfying $\bigcup_{i=1}^m S_i={\bf U}$ and $d$ is a…

In this paper, we generalize classical constructions of skew Hadamard difference families with two or four blocks in the additive groups of finite fields given by Szekeres (1969, 1971), Whiteman (1971) and Wallis-Whiteman (1972). In…

Cover-free families are set systems used as solutions for a large variety of problems, and in particular, problems where we deal with $n$ elements and want to identify $d$ invalid ones among them by performing only $t$ tests ($t \leq n$).…