Related papers: Bounded-- yes, but 4?

The Erd\H{o}s-Szekeres conjecture states that any set of more than $2^{n-2}$ points in the plane with no three on a line contains the vertices of a convex $n$-gon. Erd\H{o}s, Tuza, and Valtr strengthened the conjecture by stating that any…

In this paper we prove the Kneser-Poulsen conjecture for the case of large radii. Namely, if a finite number of points in Euclidean space $E^n$ is rearranged so that the distance between each pair of points does not decrease, then there…

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area and mean width -- are studied. These…

We study the pointwise convergence of some weighted averages linked to averages along cubes. We show that if $(X,\mathcal{B},\mu, T_i)$ are not necessarily commuting measure preserving systems on the same finite measure space and if $f_i,$…

We count rational points of bounded height on the non-normal senary quartic hypersurface x 4 = (y 2 1 + $\times$ $\times$ $\times$ + y 2 4)z 2 in the spirit of Manin's conjecture.

We provide an asymptotic estimate for the number of rational points of bounded height on a non-singular conic over the rationals. The estimate is uniform in the coefficients of the underlying quadratic form.

We consider online packing problems where we get a stream of axis-parallel rectangles. The rectangles have to be placed in the plane without overlapping, and each rectangle must be placed without knowing the subsequent rectangles. The goal…

Let $X$ be a minimal surface of general type and maximal Albanese dimension with irregularity $q\geq 2$. We show that $K_X^2\geq 4\chi(\mathcal O_X)+4(q-2)$ if $K_X^2<\frac92\chi(\mathcal O_X)$, and also obtain the characterization of the…

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

We consider continuous-time quantum walks on distance-regular graphs of small diameter. Using results about the existence of complex Hadamard matrices in association schemes, we determine which of these graphs have quantum walks that admit…

Call a curve $C \subset \mathbb{P}^2$ defined over $\mathbb{F}_q$ transverse-free if every line over $\mathbb{F}_q$ intersects $C$ at some closed point with multiplicity at least 2. In 2004, Poonen used a notion of density to treat Bertini…

Chen and Chv\'atal conjectured in 2008 that in any finite metric space either there is a line containing all the points - a universal line -, or the number of lines is at least the number of points. This is a generalization of a classical…

In 3-d the average projected area of a convex solid is 1/4 the surface area, as Cauchy showed in the 19th century. In general, the ratio in n dimensions may be obtained from Cauchy's surface area formula, which is in turn a special case of…

The triangular ratio metric is studied in a domain $G\subsetneq\mathbb{R}^n$, $n\geq2$. Several sharp bounds are proven for this metric, especially, in the case where the domain is the unit disk of the complex plane. The results are applied…

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

In 1989, Rota made the following conjecture. Given $n$ bases $B_{1},\dots,B_{n}$ in an $n$-dimensional vector space $V$, one can always find $n$ disjoint bases of $V$, each containing exactly one element from each $B_{i}$ (we call such…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Starting from an arbitrary sequence of polygons whose total perimeter is $2n$, we can build an (oriented) surface by pairing their sides in a uniform fashion. Chmutov and Pittel (arXiv:1503.01816) have shown that, regardless of the…