English
Related papers

Related papers: On convex closed planar curves as equidistant sets

200 papers

Given a connected graph $G$, the equidistant dimension of $G$ represents the cardinality of the smallest set of vertices $S$ of $G$ such that for any two vertices $x,y\notin S$ there is at least one vertex in $S$ equidistant to both $x,y$…

Combinatorics · Mathematics 2025-12-09 Adria Gispert-Fernandez , Juan A. Rodriguez-Velazquez , Ismael G. Yero

One considers geometry with the intransitive equaivalence relation. Such a geometry is a physical geometry, i.e. it is described completely by the world function, which is a half of the squared distance function. The physical geometry…

General Mathematics · Mathematics 2009-03-30 Yuri A. Rylov

A set $L$ of straight lines and a set $P$ of points in the Euclidean plane define an arrangement $\mathcal{A}$ = ($L$, $P$) of construction lines and registration marks, if and only if: (1) any point in $P$ is a point of intersection of at…

General Mathematics · Mathematics 2024-10-14 Alexandros Haridis

We consider the set of pairs of orthogonal vectors in Hilbert space, which is also called the cross because it is the union of the horizontal and vertical axes in the Euclidean plane when the underlying space is the real line. Crosses,…

Optimization and Control · Mathematics 2022-02-04 Heinz H. Bauschke , Manish Krishan Lal , Xianfu Wang

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

Metric Geometry · Mathematics 2019-06-26 Oleg R. Musin

We show that if a planar graph $G$ has a plane straight-line drawing in which a subset $S$ of its vertices are collinear, then for any set of points, $X$, in the plane with $|X|=|S|$, there is a plane straight-line drawing of $G$ in which…

Combinatorics · Mathematics 2021-05-11 Vida Dujmović , Fabrizio Frati , Daniel Gonçalves , Pat Morin , Günter Rote

By using the metric projection onto a closed self-dual cone of the Euclidean space, M. S. Gowda, R. Sznajder and J. Tao have defined generalized lattice operations, which in the particular case of the nonnegative orthant of a Cartesian…

Functional Analysis · Mathematics 2013-01-28 A. B. Németh , S. Z. Németh

The Cornu spirals on plane are the curves whose curvatures are linear. Generalized planar cornu spirals and Euler spirals in E^3, the curves whose curvatures are linear are defined in [1,5]. In this study, these curves are presented as the…

Differential Geometry · Mathematics 2012-02-01 Semra Saracoglu

Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…

Optimization and Control · Mathematics 2025-01-29 Adrian S. Lewis , Adriana Nicolae , Tonghua Tian

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…

Metric Geometry · Mathematics 2025-10-23 William Verreault

If $K$ and $L$ are mutually dual closed convex cones in a Hilbert space with the metric projections onto them denoted by $P_K$ and $P_L$ respectively, then the following two assertions are equivalent: (i) $P_K$ is isotone with respect to…

Functional Analysis · Mathematics 2013-09-20 S. Z. Németh

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the…

Computational Geometry · Computer Science 2010-07-19 Keiko Imai , Akitoshi Kawamura , Jiří Matoušek , Daniel Reem , Takeshi Tokuyama

Ulam asked in 1945 if there is an everywhere dense \emph{rational set}, i.e. a point set in the plane with all its pairwise distances rational. Erd\H os conjectured that if a set $S$ has a dense rational subset, then $S$ should be very…

Combinatorics · Mathematics 2014-04-22 Jozsef Solymosi , Frank de Zeeuw

The paper is devoted to differential geometric invariants determining a Frenet curve in up to a direct similarity These invariants can be presented by the Euclidean curvatures in terms of an arc lengths of the spherical indicatrices. Then,…

Differential Geometry · Mathematics 2017-11-30 Fatma Gökçelik , Seher Kaya , Yusuf Yayli , F. Nejat Ekmekci

In this paper we study a class of convex sets which are called closed pseudo-cones and study a new duality of this class. It turns out that the duality characterizes closed pseudo-cones and is essentially the only possible abstract duality…

Metric Geometry · Mathematics 2023-08-15 Yun Xu , Jin Li , Gangsong Leng

Given $2k-1$ convex sets in $R^2$ such that no point of the plane is covered by more than $k$ of the sets, is it true that there are two among the convex sets whose union contains all $k$-covered points of the plane? This question due to…

Combinatorics · Mathematics 2019-12-18 Adam S. Jobson , André E. Kézdy , Jenő Lehel , Timothy J. Pervenecki , Géza Tóth

A holomorphic map from the complex line to a complex projective space is called normal (a. k. a. Brody curve) if it is uniformly continuous from the Euclidean metric to the Fubini--Study metric. The paper contains a survey of known results…

Complex Variables · Mathematics 2007-10-08 Alexandre Eremenko

A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly independent. In this paper, we give some lower bounds of the dimension of the ambient Euclidean space for complex…

Algebraic Topology · Mathematics 2016-10-05 Shiquan Ren

In this study, we define the generalized normal ruled surface of a curve in the Euclidean 3-space $E^3$. We study the geometry of such surfaces by calculating the Gaussian and mean curvatures to determine when the surface is flat or minimal…

Differential Geometry · Mathematics 2020-06-02 Onur Kaya , Mehmet Önder

A subset $S$ of vertices, in a connected graph $G$, is called a distance-equalizer set if for every pair of distinct vertices outside $S$, there exists a vertex in $S$ equidistant to both. The equidistant dimension, denoted by $\xi(G)$, is…