Related papers: Egan conjecture holds

To embed the bouquet of $g$ circles $B_g$ into the $n$-sphere $S^n$ so that its full symmetry group action extends to an orthogonal actions on $S^n$, the minimal $n$ is $2g-1$. This answers a question raised by B. Zimmermann.

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…

We present a self-contained proof that the number of diameter pairs among n points in Euclidean 3-space is at most 2n-2. The proof avoids the ball polytopes used in the original proofs by Grunbaum, Heppes and Straszewicz. As a corollary we…

Denote by r(n) the length of a shortest integer sequence on a circle containing all permutations of the set {1,2,...,n} as subsequences. Hansraj Gupta conjectured in 1981 that r(n) <= n^2/2. In this paper we confirm the conjecture for the…

Every graph G can be embedded in a Euclidean space as a two-distance set. This allows us to reformulate the analogue of Borsuk's conjecture for two-distance sets in terms of graphs. This conjecture remains open for dimensions from 4 to 63.…

The medial axis of a smoothly embedded surface in $\mathbb{R}^3$ consists of all points for which the Euclidean distance function on the surface has at least two minima. We generalize this notion to the mid-sphere axis, which consists of…

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

Let $K$ be an $n$-dimensional symmetric convex body with $n \ge 4$ and let $K\dual$ be its polar body. We present an elementary proof of the fact that $$(\Vol K)(\Vol K\dual)\ge \frac{b_n^2}{(\log_2 n)^n},$$ where $b_n$ is the volume of the…

Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…

Let $\mathbb{L}$ be a lattice in $n$-dimensional Euclidean space $\mathbb{R}^n$ reduced in the sense of Korkine and Zolotareff and having a basis of the form $~(A_1,0,0,\cdots$ $,0),$ ~$(a_{2,1},A_2,0,\cdots,0),\cdots,$…

In this paper we consider the problem of how large the Hausdorff dimension of $E\subset\R^d$ needs to be in order to ensure that the radii set of $(d-1)$-dimensional spheres determined by $E$ has positive Lebesgue measure. We also study the…

The investigation of the relation among the distances of an arbitrary point in the Euclidean space $\mathbb{R}^n$ to the vertices of a regular $n$-simplex in that space has led us to the study of simplices having a regular facet. Calling an…

Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a…

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…

The classical Heawood inequality states that if the complete graph $K_n$ on $n$ vertices is embeddable in the sphere with $g$ handles, then $g \ge\dfrac{(n-3)(n-4)}{12}$. A higher-dimensional analogue of the Heawood inequality is the…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

Let $G$ be a graph of radius $r$ and diameter $d$ with $d\leq 2r-2$. We give a new proof that $G$ contains a cycle of length at least $4r-2d$, i.e. for its circumference it holds $c(G)\geq 4r-2d$.

The paths on the {\bf R$^3$} real Euclidean manifold are defined as 2-dimensional simplicial strips; points are replaced by 2-simplexes and the orbits of the action of a one discrete-parameter group on the base manifold becomes a convex…