Related papers: Non-central sections of the regular n-simplex

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 determine the maximal non-central hyperplane sections of the n-dimensional $l_1$-ball if the fixed distance of the hyperplane to the origin is between $1 / \sqrt 3$ and $1 / \sqrt 2$. This adds to a result of Liu and Tkocz who considered…

We state a general formula to compute the volume of the intersection of the regular $n$-simplex with some $k$-dimensional subspace. It is known that for central hyperplanes the one through the centroid containing $n-1$ vertices gives the…

Consider the regular $n$-simplex $\Delta_n$ - it is formed by the convex-hull of $n+1$ points in Euclidean space, with each pair of points being in distance exactly one from each other. We prove an exact bound on the width of $\Delta_n$…

We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume noncentral sections of the cross-polypote by hyperplanes which are at a fixed large distance…

We study the $(n-1)$-dimensional volume of central hyperplane sections of the $n$-dimensional cube $Q_n$. Our main goal is two-fold: first, we provide an alternative, simpler argument for proving that the volume of the section perpendicular…

We prove that the (n-2)-dimensional surface area (perimeter) of central hyperplane sections of the n-dimensional unit cube is maximal for the hyperplane perpendicular to the vector (1,1,0,...,0). This gives a positive answer to a question…

We show that for the regular n-simplex, the 1-codimensional central slice that's parallel to a facet will achieve the minimum area (up to a 1-o(1) factor) among all 1-codimensional central slices, thus improving the previous best known…

The maximal hyperplane section of the $l_\infty^n$-ball, i.e. of the $n$-cube, is the one perpendicular to 1/sqrt 2 (1,1,0, ... ,0), as shown by Ball. Eskenazis, Nayar and Tkocz extended this result to the $l_p^n$-balls for very large $p…

We study the volume of central hyperplane sections of the cube. Using Fourier analytic and variational methods, we retrieve a geometric condition characterizing critical sections which, by entirely different methods, was recently proven by…

It has been shown that the $n$-dimensional unit hypercube contains an $n$-dimensional regular simplex of edge length $c\sqrt n$ for arbitrary $c<1/2$ if $n$ is sufficiently large (Maehara, Ruzsa and Tokushige, 2009). We prove the same…

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

We show that any $3$-connected cubic plane graph on $n$ vertices, with all faces of size at most $6$, can be made bipartite by deleting no more than $\sqrt{(p+3t)n/5}$ edges, where $p$ and $t$ are the numbers of pentagonal and triangular…

The 2-girth of a 2-dimensional simplicial complex $X$ is the minimum size of a non-zero 2-cycle in $H_2(X, \mathbb{Z}/2)$. We consider the maximum possible girth of a complex with $n$ vertices and $m$ 2-faces. If $m = n^{2 + \alpha}$ for…

In this paper, we study complete $\delta$-stable minimal hypersurfaces in $\mathbf R^{n+1}$. We prove that complete two-sided $\delta$-stable minimal hypersurfaces have Euclidean volume growth if $3\leq n\leq 5$ and $\delta>\delta_0(n)$,…

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

A set S of unit vectors in n-dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b, and inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical…

Let $\Delta_n$ and $Q_n$ denote the regular $n$-simplex of side length $\sqrt{2}$ embedded in $\mathbb{R}^{n+1}$ and the volume one cube in $\mathbb{R}^n$, respectively. We derive a closed-form formula for the hyperplane volume projections…

This paper shows that in dimensions n \geq 2 for any partition of the set of points in the standard n-sphere \sum_{i=0}^n x_i^2 =1 in R^{n+1} into (n+3) or more nonempty sets, there exists a hyperplane in R^{n+1} that intersects at least…