Related papers: Extreme problems for convex curves with given rela…
Consider a rational family of planar rational curves in a certain region of interest. We are interested in finding an approximation to the implicit representation of the envelope. Since exact implicitization methods tend to be very costly,…
We solve a randomized version of the following open question: is there a strictly convex, bounded curve \gamma in the plane such that the number of rational points on \gamma, with denominator $n$, approaches infinity with $n$? Although this…
In this paper we address the question whether in a given Banach space, a Chebyshev center of a nonempty bounded subset can be a farthest point of the set. Our exploration reveals that the answer depends on the convexity properties of the…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
"Most" hypersurfaces in projective space are irreducible, and rather precise estimates are known for the probability that a random hypersurface over a finite field is reducible. This paper considers the parametrization of space curves by…
In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…
In this work we study upper bounds for the ratio of successive inner and outer radii of a convex body K. This problem was studied by Perel'man and Pukhov and it is a natural generalization of the classical results of Jung and Steinhagen. We…
In this survey, we consider the sharp Sobolev inequality in convex cones. We also prove it by using the optimal transport technique. Then we present some results related to the Euler-Lagrange equation of the Sobolev inequality: the…
We present an algebraic study of the projection of plane curves and twisted cubics in space onto multiple images of pinhole cameras. The Zariski closure of the image of the projection of conics is a conic multiview varieties. Extending…
We obtain new examples and the complete list of the rational cuspidal plane curves $C$ with at least three cusps, one of which has multiplicity ${\rm deg}\,C - 2$. It occurs that these curves are projectively rigid. We also discuss the…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains…
This paper is devoted to $C^2$ a priori estimates for strictly locally convex radial graphs with prescribed Weingarten curvature and boundary in space forms. By constructing two-step continuity process and applying degree theory arguments,…
In the optimization of convex domains under a PDE constraint numerical difficulties arise in the approximation of convex domains in $\mathbb{R}^3$. Previous research used a restriction to rotationally symmetric domains to reduce shape…
A closed set of a Euclidean space is said to be Chebyshev if every point in the space has one and only one closest point in the set. Although the situation is not settled in infinite-dimensional Hilbert spaces, in 1932 Bunt showed that in…
By a curve in R^d we mean a continuous map gamma:I -> R^d, where I is a closed interval. We call a curve gamma in R^d at most k crossing if it intersects every hyperplane at most k times (counted with multiplicity). The at most d crossing…
We prove that the (n-2)-dimensional surface area (perimeter) of central hyperplane sections of the n-dimensional unit cube is maximal for the hyperplane perpendicular to the vector (1,1,0,...,0). This gives a positive answer to a question…
This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…
Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…