Related papers: Acute sets of exponentially optimal size
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…
Let $F(x_1,...,x_n)$ be a form of degree $d\geq 2$, which produces a geometrically irreducible hypersurface in $\mathbb{P}^{n-1}$. This paper is concerned with the number of rational points on F=0 which have height at most $B$. Whenever…
A homogeneous set of $n$ points in the $d$-dimensional Euclidean space determines at least $\Omega(n^{2d/(d^2+1)} / \log^{c(d)} n)$ distinct distances for a constant $c(d)>0$. In three-space, we slightly improve our general bound and show…
A discrete set in the Euclidian space is almost periodic, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We prove the following result: if A is a discrete almost periodic set and the set A-A…
This work continues the study of the properties of finitely constrained groups of binary tree automorphisms in terms of their Hausdorff dimension. We prove that there are exactly $2^{2d-3}$ finitely constrained groups of binary tree…
Let $E^n$ denote the (real) $n$-dimensional Euclidean space. It is not known whether an equilateral set in the $\ell_1$ sum of $E^a$ and $E^b$, denoted here as $E^a \oplus_1 E^b$, has maximum size at least $\dim(E^a \oplus_1 E^b) + 1 = a +…
A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.
In this expository note we describe a proof due to A. Sapozhenko that the number of independent sets in the discrete $d$-dimensional hypercube $Q_d$ is asymptotically $2 \sqrt{e} 2^{2^{d-1}}$ as $d$ tends to infinity.
Let $q$ be any prime power and let $d$ be a positive integer greater than 1. In this paper, we construct a family of $M$-ary sequences of period $q-1$ from a given $M$-ary, with $M|q-1$, Sidelikov sequence of period $q^d-1$. Under mild…
Let $5 \leq k \leq 11$ and $0\leq i \leq k-1$ be integers. We determine all solutions to the equation \begin{align*} n(n+d)(n+2d)\cdots(n+(i-1)d)(n+(i+1)d) \cdots (n+(k-1)d) = y^3 \end{align*} in integers $n,d,y$ with $ny \neq 0$, $d\geq…
We consider the Hilbert scheme Hilb^{d+1}(C^d) of (d+1) points in affine d-space C^d (d > 2), which includes the square of any maximal ideal. We describe equations for the most symmetric affine open subscheme of Hilb^{d+1}(C^d), in terms of…
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…
We solve two related extremal-geometric questions in the $n-$dimensional space $\mathbb{R}^n_{\infty}$ equipped with the maximum metric. First, we prove that the maximum size of a right-equidistant sequence of points in…
Take any $d + 3$ points in $\mathbb{R}^d$. It is known that (a) if $d = 2k + 1$, then there are two linked $(k + 1)$-simplices with the vertices at these points; (b) if $d = 2k$, then there are two disjoint $(k + 1)$-tuples of these points…
We study rational functions $f$ of degree $d+1$ such that $f$ is univalent in the exterior unit disc, and the image of the unit circle under $f$ has the maximal number of cusps ($d+1$) and double points $(d-2)$. We introduce a bi-angled…
Let $d \geq 2$ be a natural number. We show that $$|A-A| \geq \left(2d-2 + \frac{1}{d-1}\right)|A|-(2d^2-4d+3)$$ for any sufficiently large finite subset $A$ of $\mathbb{R}^d$ that is not contained in a translate of a hyperplane. By a…
Given a finite set of red and blue points in $\Rspace^d$, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning…
We introduce a minor variant of the approximate D-optimal design of experiments with a more general information matrix that takes into account the representation of the design space S. The main motivation (and result) is that if S in R^d is…
Fix positive integers $k$ and $d$. We show that, as $n\to\infty$, any set system $\mathcal{A} \subset 2^{[n]}$ for which the VC dimension of $\{ \triangle_{i=1}^k S_i \mid S_i \in \mathcal{A}\}$ is at most $d$ has size at most…