Related papers: Geodesic stars in random geometry

A graph $G$ is geodetic if between any two vertices there exists a unique shortest path. In 1962 Ore raised the challenge to characterize geodetic graphs, but despite many attempts, such characterization still seems well beyond reach. We…

A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d_G(u,v) is at least…

In this work, we study the geodesic structure for a geometry described by a spherically symmetric four-dimensional solution embedded in a five-dimensional space known as a brane-based spherically symmetric solution. Mainly, we have found…

Let $(\mathcal{M},g)$ be a Riemannian manifold and $\mathcal{N}$ a $\mathcal{C}^2$ submanifold without boundary. If we multiply the metric $g$ by the inverse of the squared distance to $\mathcal{N}$, we obtain a new metric structure on…

This paper investigates sub-Riemannian geodesics within the jet space of curves. We establish the existence of two distinct families of metric lines, that is, globally minimizing geodesics, in the $2$-jet space of plane curves. This result…

We introduce and study the random non-compact metric space called the Brownian plane, which is obtained as the scaling limit of the uniform infinite planar quadrangulation. Alternatively, the Brownian plane is identified as the…

The metric dimension of a graph is the minimum number of landmark vertices required so that every vertex can be uniquely identified by its distances to the landmarks. This parameter captures the fundamental tradeoff between compact…

We have developed a highly accurate numerical code capable of solving the coupled Einstein-Klein-Gordon system, in order to construct rotating boson stars in general relativity. Free fields and self-interacting fields, with quartic and…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Let $G=(V,E)$ be a connected graph and let $d(u,v)$ denote the distance between vertices $u,v \in V$. A metric basis for $G$ is a set $B\subseteq V$ of minimum cardinality such that no two vertices of $G$ have the same distances to all…

Let $M$ be a Riemannian $2$-sphere. A classical theorem of Lyusternik and Shnirelman asserts the existence of three distinct simple non-trivial periodic geodesics on $M$. In this paper we prove that there exist three simple periodic…

We give a few simple methods to geometically describe some polygon and chain-spaces in R^d. They are strong enough to give tables of m-gons and m-chains when m <= 6.

We build analytical models of spherically symmetric stars in the brane-world, in which the external space-time contains both an ADM mass and a tidal charge. In order to determine the interior geometry, we apply the principle of minimal…

With inspiration from the K\"ahler geometry, we introduce a metric structure on the energy class, $\mathcal{E}_{1,m}$, of $m$-subharmonic functions with bounded energy and show that it is complete. After studying how the metric convergence…

The classic Lusternik--Schnirelmann theorem states that there are three distinct simple periodic geodesics on any Riemannian 2-sphere $M$. It has been proven by Y. Liokumovich, A. Nabutovsky and R. Rotman that the shortest three such curves…

We study arrangements of geodesic arcs on a sphere, where all arcs are internally disjoint and each arc has its endpoints located within the interior of other arcs. We establish fundamental results concerning the minimum number of arcs in…

In this paper, we prove, using only elementary geometric arguments and only assuming that the curves are continuous, that the geodesics on a sphere are the minor arcs of the great circles. Our result are valid for any sphere in any inner…

A geometric graph is a graph drawn in the plane so that its vertices and edges are represented by points in general position and straight line segments, respectively. A vertex of a geometric graph is called pointed if it lies outside of the…

In this paper geometry is studied with a novel approach. Every geometrical object is defined as a symbol which satisfies some properties. These symbols are then coded into a class of numbers which are named here as many dots numbers (MDN).…

Short geodesics are important in the study of the geometry and the spectra of Riemann surfaces. Bers' theorem gives a global bound on the length of the first $3g-3$ geodesics. We use the construction of Brooks and Makover of random Riemann…