Related papers: A note on cover free families

Hadwiger's conjecture states that every $K_t$-minor free graph is $(t-1)$-colorable. A qualitative strengthening of this conjecture raised by Gerards and Seymour, known as the Odd Hadwiger's conjecture, states similarly that every graph…

J.-P. Roudneff conjectured in 1991 that every arrangement of $n \ge 2d+1\ge 5$ pseudohyperplanes in the real projective space $\mathbb{P}^d$ has at most $\sum_{i=0}^{d-2} \binom{n-1}{i}$ complete cells (i.e., cells bounded by each…

In a celebrated paper of 1893, Hadamard established the maximal determinant theorem, which establishes an upper bound on the determinant of a matrix with complex entries of norm at most $1$. His paper concludes with the suggestion that…

For integers $d \geq 2$ and $k \geq d+1$, a $k$-hole in a set $S$ of points in general position in $\mathbb{R}^d$ is a $k$-tuple of points from $S$ in convex position such that the interior of their convex hull does not contain any point…

Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…

We combine here Tao's slice-rank bounding method and Gr\"obner basis techniques and apply here to the Erd\H{o}s-Rado Sunflower Conjecture. Let $\frac{3k}{2}\leq n\leq 3k$ be integers. We prove that if $\mbox{$\cal F$}$ be a $k$-uniform…

It is shown that a normalized complex Hadamard matrix of order $6$ having three distinct columns, each containing at least one $-1$ entry necessarily belongs to the transposed Fourier family, or to the family of $2$-circulant complex…

Erd\H{o}s and Graham (Erd\H{o}s and Graham, 1980) asked if there exists an $n$ such that the divisors of $n$ greater than 1 are the moduli of a distinct covering system with the following property: If there exists an integer which satisfies…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

Fisher proved in 1940 that any $2$-$(v,k,\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\lambda)$ design with $v \geq k+\lfloor t/2 \rfloor$ has…

Let $\mathcal{R}$ be a family of axis-parallel rectangles in the plane. The transversal number $\tau(\mathcal{R})$ is the minimum number of points needed to pierce all the rectangles. The independence number $\nu(\mathcal{R})$ is the…

Graber, Harris and Starr proved, when n >= 2d, the irreducibility of the Hurwitz space H^0_{d,n}(Y) which parametrizes degree d coverings of a smooth, projective curve Y of positive genus, simply branched in n points, with full monodromy…

The Flat Wall Theorem of Robertson and Seymour states that there is some function $f$, such that for all integers $w,t>1$, every graph $G$ containing a wall of size $f(w,t)$, must contain either (i) a $K_t$-minor; or (ii) a small subset…

A finite family ${\mathcal B}$ of balls with respect to an arbitrary norm in ${\mathbb R}^d$ ($d\geq 2$) is called a non-separable family if there is no hyperplane disjoint from $\bigcup {\mathcal B}$ that strictly separates some elements…

We study orthogonal matrices whose elements have moduli $\leq 1$. This paper shows that the existence of two such families of matrices is equivalent. Specifically we show that the existence of an Hadamard matrix of order $4t$ is equivalent…

For a positive braid $\beta \in \mathrm{Br}^{+}_{k}$, we consider the braid variety $X(\beta)$. We define a family of open sets $\mathcal{U}_{r, w}$ in $X(\beta)$, where $w \in S_k$ is a permutation and $r$ is a positive integer no greater…

We introduce a notion of "freely braided element" for simply laced Coxeter groups. We show that an arbitrary group element $w$ has at most $2^{N(w)}$ commutation classes of reduced expressions, where $N(w)$ is a certain statistic defined in…

We present results and conjectures on the van der Waerden numbers w(2;3,t) and on the new palindromic van der Waerden numbers pdw(2;3,t). We have computed the new number w(2;3,19) = 349, and we provide lower bounds for 20 <= t <= 39, where…

For a binary code $\Gamma$ of length $v$, a $v$-word $w$ produces by a set of codewords $\{w^1,...,w^r\} \subseteq \Gamma$ if for all $i=1,...,v$, we have $w_i\in \{w_i^1, ..., w_i^r\}$ . We call a code $r$-secure frameproof of size $t$ if…

Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$…