相关论文: On the circumradius of a special class of n-simpli…

We prove in special cases the following. $\bullet_{Sc}$ Bounds on the {\it injectivity radii} of "topologically complicated" Riemannian $n$-manifolds $X$, where the scalar curvatures of $X$ are bounded from below, $Sc(X)\geq \sigma>0$.…

We provide several characterizations of ring-shaped rotationally symmetric solutions to the Serrin problem in arbitrary dimensions.

In this paper we prove classification results to elliptic fully nonlinear conformal equations on certain subdomains of the sphere with prescribed constant mean curvature on its boundary. Such subdomains are the hemisphere (or a geodesic…

The edge-to-edge tilings of the sphere by congruent polygons, where all edges are straight, have been completely classified. We classify the curvilinear version of the similar triangular tilings, where the edges may not be straight, and…

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

The ratio of convexity radius over injectivity radius may be made arbitrarily small within the class of compact Riemannian manifolds of any fixed dimension at least two. This is proved using Gulliver's method of constructing manifolds with…

A pseudocircle is a simple closed curve on some surface; an arrangement of pseudocircles is a collection of pseudocircles that pairwise intersect in exactly two points, at which they cross. Ortner proved that an arrangement of pseudocircles…

A graph is diameter two edge-critical if its diameter is two and the deletion of any edge increases the diameter. Murty and Simon conjectured that the number of edges in a diameter two edge-critical graph on $n$ vertices is at most $\lfloor…

The edge clique cover number $ecc(G)$ of a graph $G$ is the size of the smallest set of complete subgraphs whose union covers all edges of $G$. It has been conjectured that all the simple graphs with independence number two satisfy…

It is well known that a compact two dimensional surface is homeomorphic to a polygon with the edges identified in pairs. This paper not only presents a new proof of this statement but also generalizes it for any connected n-dimensional…

In this article a class of closed convex sets in the Euclidean $n$-space which are the convex hull of their profiles is described. Thus a generalization of Krein-Milman theorem\cite{Lay:1982} to a class of closed non-compact convex sets is…

Let t_a be the Dehn twist about a circle a on an orientable surface. It is well known that for each circle b and an integer n, I(t_a^n(b),b)=|n|I(a,b)^2, where I(,) is the geometric intersection number. We prove a similar formula for…

Toeplitz's Square Peg Problem asks whether every continuous simple closed curve in the plane contains the four vertices of a square. It has been proved for various classes of sufficiently smooth curves, some of which are dense, none of…

Let $q(H)$ be the signless Laplacian spectral radius of a graph $H$. In this paper, we prove that \\1. Let $H$ be a proper subgraph of a $\Delta$-regular graph $G$ with $n$ vertices and diameter $D$. Then $$2\Delta -…

The smallest hyperconvex metric space containing a given metric space X is called the tight span of X. It is known that tight spans have many nice geometric and topological properties, and they are gradually becoming a target of research of…

We show that round hemispheres are the only compact 2 dimensional Riemannian manifolds (with or without boundary) such that almost every pair of complete geodesics intersect once and only once. We prove this by establishing a sharp…

An explicit expression is obtained for the generating series for the number of ramified coverings of the sphere by the double torus, with elementary branch points and prescribed ramification type over infinity. Thus we are able to prove a…

A closed Riemannian manifold is said to have cross blocking if whenever distinct points p and q are at distance less than the diameter, all light rays from p can be shaded away from q with at most two point shades. Similarly, a closed…

A $k$-cycle in a graph is a cycle of length $k.$ A graph $G$ of order $n$ is called edge-pancyclic if for every integer $k$ with $3\le k\le n,$ every edge of $G$ lies in a $k$-cycle. It seems difficult to determine the minimum size $f(n)$…

Given a planar straight-line graph $G=(V,E)$ in $\mathbb{R}^2$, a \emph{circumscribing polygon} of $G$ is a simple polygon $P$ whose vertex set is $V$, and every edge in $E$ is either an edge or an internal diagonal of $P$. A circumscribing…