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

We determine the maximum number $N_\alpha(d)$ of equiangular lines with fixed angle $\arccos\alpha$ for $\alpha = 1/(1+2\sqrt2)$ in $d$-dimensional Euclidean space: $2,3,4,6,8,10,14,15,16,17,18,20,22$ for $d \in \{2,\dots,14\}$, and…

Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

We prove a theorem on the relationships between the lengths of sides of a spherical quadrilateral with three right angles. They are analogous to the relationships in the Lambert quadrilateral in the hyperbolic plane. We apply this theorem…

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

In this paper, we prove that minimal hypersurfaces when $n\geq 3$ and nonzero constant mean curvature hypersurfaces when $n\geq2$ foliated by spheres in parallel horizontal hyperplanes in ${\mathbb{H}}^n \times \mathbb{R}$ must be…

We show that if a solution of the defocusing cubic NLS in 3d remains bounded in the homogeneous Sobolev norm of order 1/2 in its maximal interval of existence, then the interval is infinite and the solution scatters. No radial assumption is…

We show that each set of $n\ge 2$ points in the plane in general position has a straight-line matching with at least $(5n+1)/27$ edges whose segments form a connected set, and such a matching can be computed in $O(n \log n)$ time. As an…

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Let T_0=(A_0,..,A_d) be a d-simplex, G_0 its centroid, S its circumsphere, O the center of S. Let (B_i) be the points where S intersects the lines (G_0A_i), T_1 the d-simplex (B_1,..,B_d), and G_1 its centroid. By iterating this…

According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…

We show that the maximum cardinality of an anti-chain composed of intersections of a given set of n points in the plane with half-planes is close to quadratic in n. We approach this problem by establishing the equivalence with the problem…

We study the variation of linear sections of hypersurfaces in $\mathbb{P}^n$. We completely classify all plane curves, necessarily singular, whose line sections do not vary maximally in moduli. In higher dimensions, we prove that the family…

We study flips in hypertriangulations of planar points sets. Here a level-$k$ hypertriangulation of $n$ points in the planes is a subdivision induced by the projection of a $k$-hypersimplex, which is the convex hull of the barycenters of…

Simplex slicing (Webb, 1996) is a sharp upper bound on the volume of central hyperplane sections of the regular simplex. We extend this to sharp bounds in the probabilistic framework of negative moments, and beyond, of centred log-concave…

We show that for each $k\geq 4$ and $n>r\geq k+1$, every $n$-vertex $r$-uniform hypergraph with no Berge cycle of length at least $k$ has at most $\frac{(k-1)(n-1)}{r}$ edges. The bound is exact, and we describe the extremal hypergraphs.…

For $2 < p < p_0 \simeq 26.265$, the hyperplane section of the $l_p^n$-unit ball $B_p^n$ perpendicular to a^(n) = 1/sqrt(n) (1, ... ,1) for large $n$ has larger volume than the one orthogonal to a^(2) = 1/sqrt(2) (1,1,0, ...,0), as shown by…

We investigate the 2-center problem for arbitrary strictly convex, centrally symmetric curves instead of usual circles. In other words, we extend the 2-center problem (from the Euclidean plane) to strictly convex normed planes, since any…

We study translation minimal hypersurfaces and separable minimal hypersurfaces in the ($n+1$)-space with $2m$-norm.

We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant $k$. We consider both the case when the sides of the matrices to which the edges are incident are fixed…