Related papers: Pairwise balanced designs covered by bounded flats

We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as…

Latin squares with a balance property among adjacent pairs of symbols---being "Roman" or "row-complete"---have long been used as uniform crossover designs with the number of treatments, periods and subjects all equal. This has been…

For integers $k\geq 3,d\geq 2,$ we consider the abundance property of pinned $k$-point patterns occurring in $E\subseteq \mathbb R^d$ with positive upper density $\delta(E)$. We show that for any fixed $k$-point pattern $V$, there is a set…

Two axis-aligned boxes in $\mathbb{R}^d$ are \emph{$k$-neighborly} if their intersection has dimension at least $d-k$ and at most $d-1$. The maximum number of pairwise $k$-neighborly boxes in $\mathbb{R}^d$ is denoted by $n(k,d)$. It is…

Suppose that each proper subset of a set $S$ of points in a vector space is contained in the union of planes of specified dimensions, but $S$ itself is not contained in any such union. How large can $|S|$ be? We prove a general upper bound…

A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…

Let $\R$ be a real closed field, $\mathcal{P},\mathcal{Q} \subset \R[X_1,...,X_k]$ finite subsets of polynomials, with the degrees of the polynomials in $\mathcal{P}$ (resp. $\mathcal{Q}$) bounded by $d$ (resp. $d_0$). Let $V \subset \R^k$…

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

We show the birational boundedness of anti-canonical irreducible hypersurfaces which form 3-fold plt pairs. We also treat a collection of Du Val K3 surfaces which is birationally bounded but unbounded.

We give essentially tight bounds for, $\nu(d,k)$, the maximum number of distinct neighbourhoods on a set $X$ of $k$ vertices in a graph with twin-width at most~$d$. Using the celebrated Marcus-Tardos theorem, two independent works [Bonnet…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

Let $k$ be a field of characteristic not 2 or 3. We establish polynomial lower bounds on the ambient dimension $N$ for an intersection $X\subset\mathbb{P}^N$ of quadrics, cubics and quartics to have a dense collection of solvable points,…

Let $P$ be a set $n$ points in a $d$-dimensional space. Tverberg's theorem says that, if $n$ is at least $(k-1)(d+1)+1$, then $P$ can be partitioned into $k$ sets whose convex hulls intersect. Partitions with this property are called {\em…

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…

For each $N\ge C_dt^d$ we prove the existence of a well separated spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $C_d$ is a constant depending only on $d$.

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…

Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…