Related papers: Extreme problems for convex curves with given rela…
We introduce and begin the topological study of real rational plane curves, all of whose inflection points are real. The existence of such curves is a corollary of results in the real Schubert calculus, and their study has consequences for…
We estimate the maximal number of integral points which can be on a convex arc in the plane with given length, minimal radius of curvature and initial slope.
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
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$…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Discrete analogs of extrema of curvature and generalizations of the four-vertex theorem to the case of polygons and polyhedra are suggested and developed. For smooth curves and polygonal lines in the plane, a formula relating the number of…
We give a sharp lower bound on the area of a domain that can be enclosed by a closed embedded $\lambda$-convex curve of a given length on the Lobachevsky plane.
We give a sharp lower bound to the largest possible Euclidean norm of signed sums of $n$ vectors in the plane. This is achieved by connecting the signed vector sum problem to the isoperimetric problem for the circumradius of polygons. In…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
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…
The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…
A common representation of a three dimensional object in computer applications, such as graphics and design, is in the form of a triangular mesh. In many instances, individual or groups of triangles in such representation need to satisfy…
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
We consider a problem posed by Erd\H{o}s, Herzog and Piranian on the maximum product of distances of a point set of order $n$ with a given diameter. We prove that it is sufficient to consider convex polygons and obtain results on the…
Notions of directional Chebyshev constant and transfinite diameter have recently been studied on certain algebraic curves in $\mathbb{C}^2$. The theory is extended here to curves in $\mathbb{C}^N$ for arbitrary $N$. The results are…
The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for…
We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…
Solving a long-standing open question in convex geometry, we will show that typical convex surfaces contain points of infinite curvature in all tangent directions. To prove this, we use an easy curvature definition imitating the idea of…
Given a triangulation of a closed topological cube, we show that (under some technical condition) there is an essentially unique tiling of a rectangular parallelepiped by cubes, indexed by the vertices of the triangulation. Moreover, i -…