Related papers: The maximum diameter of 2-dimensional simplicial c…
We present an approximation algorithm for computing the diameter of a point-set in $\Re^d$. The new algorithm is sensitive to the ``hardness'' of computing the diameter of the given input, and for most inputs it is able to compute the exact…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
In this paper, we show that the maximum number of points in $d\geq3$ dimensions determining exactly 2 distinct triangles is $2d$. We further show that this maximum is uniquely achieved by the vertices of the $d$-orthoplex. We build upon the…
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…
A 2-dimensional framework is a straight line realisation of a graph in the Euclidean plane. It is radically solvable if the set of vertex coordinates is contained in a radical extension of the field of rationals extended by the squared edge…
A graph is called radially maximal if it is not complete and the addition of any new edge decreases its radius. In 1976 Harary and Thomassen proved that the radius $r$ and diameter $d$ of any radially maximal graph satisfy $r\le d\le 2r-2.$…
We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive…
In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the $d$-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with $d+2$ vertices…
A two-dimensional simplicial complex is called $d$-{\em regular} if every edge of it is contained in exactly $d$ distinct triangles. It is called $\epsilon$-expanding if its up-down two-dimensional random walk has a normalized maximal…
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is central in fine-grained complexity. In undirected graphs, the Strong Exponential Time Hypothesis (SETH) yields a lower bound on the time vs.…
We study simple graphs for which the maximal homogeneous ideal is an associated prime of the second power of their closed neighborhood ideals. In particular, we show that such graphs must have diameter at most $6$, and that those with…
The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…
We study the relationship between the sizes of two sets $B, S\subset\mathbb{R}^2$ when $B$ contains either the whole boundary, or the four vertices, of a square with axes-parallel sides and center in every point of $S$, where size refers to…
New constructions in group homology allow us to manufacture high-dimensional manifolds with controlled simplicial volume. We prove that for every dimension bigger than 3 the set of simplicial volumes of orientable closed connected manifolds…
Self-dual 2-forms in D=2n dimensions are characterised by an eigenvalue criterion. The equivalence of various definitions of self-duality is proven. We show that the self-dual 2-forms determine a n^2-n+1 dimensional manifold S_{2n} and the…
The spectral diameter of a symplectic ball is shown to be equal to its capacity; this result upgrades the known bound by a factor of two and yields a simple formula for the spectral diameter of a symplectic ellipsoid. We also study the…
Let $n=2^k-1$ and $m=2^{k-2}$ for a certain $k\ge 3$. Consider the point-line geometry of $2m$-element subsets of an $n$-element set. Maximal singular subspaces of this geometry correspond to binary simplex codes of dimension $k$. For $k\ge…
We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
We establish the sharp growth rate, in terms of cardinality, of the $L^p$ norms of the maximal Hilbert transform $H_\Omega$ along finite subsets of a finite order lacunary set of directions $\Omega \subset \mathbb R^3$, answering a question…