arXiv subjects

Tudor Zamfirescu

Publications and source records attributed to Tudor Zamfirescu.

8 recordsLinked to original sources

arXiv2026

On the m-point convexity

Let $S\subset \mathbb{R}^d$ $(d\geq 2)$. A set $S$ is said to be $m$-point convex, if for every $m$ distinct points in $S$, at least one of the line-segments determined by them lies in $S$. We also say that $S$ has property $P_m$. Let ${x,y,z}\in \mathbb{R}^{d}$. If $\mathrm{conv}\{x,y,z\}$ is a right triangle, then $\{x,y,z\}$ is called a {\it right triple}. A set $S$ is said to have the right-$3$-point property,if, for every right triple of $S$, at least one of the line-segments determined by them belongs to $S$. In particular, it has the double right-$3$-point property, if, for every right triple in $S$, at least two of the line-segments determined by them belong to $S$. In this paper, we further investigate $m$-point convex sets and establish the relationship between the sets with the double right-$3$-point property and convex sets in $\mathbb{R}^d$.

math.CO↗

arXiv2026

The orthogonal connectedness of polyhedral surfaces

Using the orthogonal connectedness, we introduce the notion of orthogonal decomposability of convex polytopes and study it in the case of Platonic and Archimedean solids. While doing so, we also encounter polytopes which are not orthogonally decomposable.

math.CO↗

arXiv2025

Excursions in Sylvester-Gallai land

The Sylvester-Gallai theorem states that for a finite set of points in the plane, if every line determined by any two of these points also contains a third, then the set is necessarily made of collinear points. In this paper, we first provide a counterexample in the plane when the point set is countably infinite but bounded. Then we consider a variant of the Sylvester-Gallai theorem where instead of a finite point set we have a finite family of convex sets in $\mathbb{R}^d$ ($d\geq 2$). Finally, we present another variant of the Sylvester-Gallai theorem, when instead of point sets we have a finite family of line-segments in the plane.

math.CO↗

arXiv2025

Orthogonally connected sets

In this paper, we further investigate the orthogonally connected sets and establish necessary and sufficient conditions for a set to be staircase connected.

math.CO↗

arXiv2019

Locating diametral points

Let $K$ be a convex body in $\mathbb{R} ^d$, with $d = 2,3$. We determine sharp sufficient conditions for a set $E$ composed of $1$, $2$, or $3$ points of ${\rm bd}K$, to contain at least one endpoint of a diameter of $K$ (for $d=2,3$). We extend this also to convex surfaces, with their intrinsic metric. Our conditions are upper bounds on the sum of the complete angles at the points in $E$. We also show that such criteria do not exist for $n\geq 4$ points.

math.MG↗

arXiv2019

With respect to whom are you critical?

For any compact Riemannian surface $S$ and any point $y$ in $S$, $Q_y^{-1}$ denotes the set of all points in $S$, for which $y$ is a critical point. We proved \cite{BIVZ} together with Imre Bárány that card$Q_y^{-1} \geq 1$, and that equality for all $y\in S$ characterizes the surfaces homeomorphic to the sphere. Here we show, for any orientable surface $S$ and any point $y \in S$, the following two main results. There exist an open and dense set of Riemannian metrics $g$ on $S$ for which $y$ is critical with respect to an odd number of points in $S$, and this is sharp. Card$Q_y^{-1} \leq 5$ for the torus and card$Q_y^{-1} \leq 8g-5$ if the genus $g$ of $S$ is at least $2$. Properties involving points at globally maximal distance on $S$ are eventually presented.

math.GT↗

arXiv2018

Double normals of most convex bodies

We consider a typical (in the sense of Baire categories) convex body $K$ in $\mathbb{R}^{d+1}$. The set of feet of its double normals is a Cantor set, having lower box-counting dimension $0$ and packing dimension $d$. The set of lengths of those double normals is also a Cantor set of lower box-counting dimension $0$. Its packing dimension is equal to $\frac{1}{2}$ if $d=1$, is at least $\frac{3}{4}$ if $d=2$, and equals $1$ if $d\geq3$. We also consider the lower and upper curvatures at feet of double normals of $K$, with a special interest for local maxima of the length function (they are countable and dense in the set of double normals). In particular, we improve a previous result about the metric diameter.

math.MG↗

arXiv2003

Total curvature and spiralling shortest paths

This paper gives a partial confirmation of a conjecture of P. Agarwal, S. Har-Peled, M. Sharir, and K. Varadarajan that the total curvature of a shortest path on the boundary of a convex polyhedron in the 3-dimensional Euclidean space cannot be arbitrarily large. It is shown here that the conjecture holds for a class of polytopes for which the ratio of the radii of the circumscribed and inscribed ball is bounded. On the other hand, an example is constructed to show that the total curvature of a shortest path on the boundary of a convex polyhedron can exceed 2 π. Another example shows that the spiraling number of a shortest path on the boundary of a convex polyhedron can be arbitrarily large.

math.MG↗