相关论文: The most inaccessible point of a convex domain
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
Let D be a compact convex domain in the plane. P\'olya & Szeg\"o and, independently, Levi & Pan defined the point p in D that is "best insulated from the boundary C of D". We compute p in the case when C is an isosceles right triangle,…
A sufficient condition for the infinite dimensionality of the Bergman space of a pseudoconvex domain is given. This condition holds on any pseudoconvex domain that has at least one smooth boundary point of finite type in the sense of…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
Consider a convex domain B of space. We prove that there exist complete minimal surfaces which are properly immersed in B. We also demonstrate that if D and D' are convex domains with D bounded and the closure of D contained in D' then any…
In this paper, the existence of parabolic boundary points of certain convex domains in $\mathbb C^2$ is given. On the other hand, the nonexistence of parabolic boundary points of infinite type of certain domains in $\mathbb C^2$ is also…
The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…
The manuscript presents a theoretical proof in conglomeration with new definitions on Inaccessibility and Inside for a point S related to a simple or self intersecting polygon P. The proposed analytical solution depicts a novel way of…
Consider a domain D in R^3 which is convex (possibly all R^3) or which is smooth and bounded. Given any open surface M, we prove that there exists a complete, proper minimal immersion f : M --> D. Moreover, if D is smooth and bounded, then…
We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.
Let $B$ be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let $P$ be a convex polygon with $n$ vertices. Given a starting configuration (a location and a direction of travel)…
We study an optimal stretching problem for certain convex domain in $\mathbb{R}^d$ ($d\geq 3$) whose boundary has points of vanishing Gaussian curvature. We prove that the optimal domain which contains the most positive (or least…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not "visually discernible", that is, T is not equal to the…
In this note, we prove that the infimum of the mean curvature on any disconnected boundary component of an unbounded mean convex domain in $\mathbb{R}^n$ must be zero.
This paper presents the reachability analysis of curves in $\mathbb{R}^3$ with a prescribed curvature bound. Based on Pontryagin Maximum Principle, we leverage the existing knowledge on the structure of solutions to minimum-time problems,…
We study the two dimensional least gradient problem in convex polygonal sets in the plane, $\Omega$. We show the existence of solutions when the boundary data $f$ are attained in the trace sense. The main difficulty here is a possible…
We consider the problem of mirror invisibility for plane sets. Given a circle and a finite number of unit vectors (defining the directions of invisibility) such that the angles between them are commensurable with $\pi$, for any $\varepsilon…
It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…