Related papers: A note on cover free families

The HRT (Heil-Ramanathan-Topiwala) conjecture asks whether a finite collection of time-frequency shifts of a non-zero square integrable function on $\mathbb{R}$ is linearly independent. This longstanding conjecture remains largely open even…

Let $\gamma^d_m(K)$ be the smallest positive number $\lambda$ such that the convex body $K$ can be covered by $m$ translates of $\lambda K$. Let $K^d$ be the $d$-dimensional crosspolytope. It will be proved that $\gamma^d_m(K^d)=1$ for…

For a family ${\mathcal F}$ of $r$-graphs, let $\mathrm{ex}(n,{\mathcal F})$ denote the maximum number of edges in an ${\mathcal F}$-free $r$-graph on $n$ vertices. Let ${\mathcal F}_r(v,e)$ denote the family of all $r$-graphs with $e$…

The Tur\'{a}n number $T(n,\alpha+1,r)$ is the minimum number of edges in an $n$-vertex $r$-graph whose independence number does not exceed $\alpha$. For each $r\geq 2$, there exists $t_*(r)$ such that $T(n,\alpha+1,r) = t_*(r) \: n^r \:…

A system of distinct representatives (SDR) of a family $F = (A_1, \cdots, A_n)$ is a sequence $(x_1, \cdots, x_n)$ of $n$ distinct elements with $x_i \in A_i$ for $1 \le i \le n$. Let $N(F)$ denote the number of SDRs of a family $F$; two…

A well known consequence of the Borsuk-Ulam theorem is that if the $d$-dimensional sphere $S^d$ is covered with less than $d+2$ open sets, then there is a set containing a pair of antipodal points. In this paper we provide lower and upper…

In 2001, Woodall conjectured that for every pair of integers $s,t \ge 1$, all graphs without a $K_{s,t}$-minor are $(s+t-1)$-choosable. In this note we refute this conjecture in a strong form: We prove that for every choice of constants…

The Hadwiger-Debrunner number $HD_d(p,q)$ is the minimal size of a piercing set that can always be guaranteed for a family of compact convex sets in $\mathbb{R}^d$ that satisfies the $(p,q)$ property. Hadwiger and Debrunner showed that…

Families of boxes in $\mathbb R^d$ are considered. In the paper an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the given family was improved.

Let a and b be positive integers with a \leq b. An (a,b)-triple is a set {x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive integer n such that any r-coloring of {1,2...,n} contains a monochromatic (a,b)-triple.…

We study Okada's conjecture on $(q,t)$-hook formula of general $d$-complete posets. Proctor classified $d$-complete posets into 15 irreducible ones. We try to give a case-by-case proof of Okada's $(q,t)$-hook formula conjecture using the…

Hadwiger's Conjecture states that every $K_{t+1}$-minor-free graph is $t$-colourable. It is widely considered to be one of the most important conjectures in graph theory. If every $K_{t+1}$-minor-free graph has minimum degree at most…

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. A well-known conjecture of Erd\H{o}s and Hajnal states that for any fixed…

We give a new construction of difference families generalizing Szekeres's difference families \cite{Sze}. As an immediate consequence, we obtain some new examples of difference families with several blocks in multiplicative subgroups of…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

Let $q$ be a prime power of the form $q=12c^2+4c+3$ with $c$ an arbitrary integer. In this paper we construct a difference family with parameters $(2q^2;q^2,q^2,q^2,q^2-1;2q^2-2)$ in ${\mathbb Z}_2\times ({\mathbb F}_{q^2},+)$. As a…

Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as…

We show that 138 odd values of n less than 10000 for which one knows how to construct a Hadamard matrix of order 4n have been overlooked in the recent handbook of combinatorial designs. There are four additional odd n, namely 191, 5767,…

For $n\leq d$, a family ${\cal F}=\{C_0,C_1,\ldots, C_n\}$ of compact convex sets in $R^d$ is called an $n$-critical family provided any $n$ members of ${\cal F}$ have a non-empty intersection, but $\bigcap_{i=0}^n C_i=\varnothing$. If…

A family $F$ of sets is said to satisfy the $(p,q)$-property if among any $p$ sets of $F$ some $q$ intersect. The celebrated $(p,q)$-theorem of Alon and Kleitman asserts that any family of compact convex sets in $\mathbb{R}^d$ that…