Related papers: On Tomaszewski's Cube Vertices Problem
We introduce a conjecture that we call the {\it Two Hyperplane Conjecture}, saying that an isoperimetric surface that divides a convex body in half by volume is trapped between parallel hyperplanes. The conjecture is motivated by an…
Each packing of R^d by translates of the unit cube [0,1)^d admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.
We study the geometry, Hodge theory and derived category of cubic fourfolds containing several planes and their associated twisted K3 surfaces. We focus on the case of two planes intersecting along a line.
The classical Steinitz theorem asserts that if the origin lies within the interior of the convex hull of a set $S \subset \mathbb{R}^d$, then there are at most $2d$ points in $S$ whose convex hull contains the origin within its interior.…
Cylindric algebras, or concept algebras in another name, form an interface between algebra, geometry and logic; they were invented by Alfred Tarski around 1947. We prove that there are 2 to the alpha many varieties of geometric (i.e.,…
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…
We obtain an optimal upper bound for the normalised volume of a hyperplane section of an origin-symmetric d-dimensional cube. This confirms a conjecture posed by Imre Barany and Peter Frankl.
An $n$-dimensional algebraic variety in $({\mathbb C}^\times)^{2n}$ covers its amoeba as well as its coamoeba generically finite-to-one. We provide an upper bound for the volume of these amoebas as well as for the number of points in the…
We prove Vojta's abc conjecture for projective space ${\Bbb P}^n({\Bbb C})$, assuming that the entire curves in ${\Bbb P}^n({\Bbb C})$ are highly ramified over the coordinate hyperplanes. This extends the results of Guo Ji and the…
Let $X$ be a configuration of $n$ points in $\mathbb{R}^d$. What is the maximum number of vertices that $conv(T(X))$ can have among all the possible permissible projective transformations $T$? In this paper, we investigate this and…
We show that in any subset of the vertices of $n$-dimensional cube that contains at least $2^{n-1}+1$ vertices ($n\geq 4$), there are four vertices that induce a claw, or there are eight vertices that induce the cycle of length eight.
This paper studies a problem of Erd\"{o}s concerning lattice cubes. Given an $N \times N \times N$ lattice cube, we want to find the maximum number of vertices one can select so that no eight corners of a rectangular box are chosen…
We prove that at least $\Omega(n^{0.51})$ hyperplanes are needed to slice all edges of the $n$-dimensional hypercube. We provide a couple of applications: lower bounds on the computational complexity of parity, and a lower bound on the…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…
We describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
A quasigeodesic is a curve on the surface of a convex polyhedron that has $\le \pi$ surface to each side at every point. In contrast, a geodesic has exactly $\pi$ to each side and so can never pass through a vertex, whereas quasigeodesics…
\footnotesize B\"{o}r\"{o}czky, Lutwak, Yang and Zhang recently conjectured a certain strengthening of the Brunn-Minkowski inequality for symmetric convex bodies, the so-called log-Brunn-Minkowski inequality. We establish this inequality…
$\mathbb B$-convexity was defined in [7] as a suitable Kuratowski-Painlev\'e upper limit of linear convexities over a finite dimensional Euclidean vector space. Excepted in the special case where convex sets are subsets of $\mathbb R^n_ +$,…
We examine packing of $n$ congruent spheres in a cube when $n$ is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rceil$ spheres. For this family of packings, the previous…