Stack Exchange Network

Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [mg.metric-geometry]

Euclidean, hyperbolic, discrete, convex, coarse geometry, comparisons in Riemannian geometry, symmetric spaces.

1
vote
2answers
4k views

If a quadratic form is positive definite on a convex set, is it convex on that set?

Consider a real symmetric matrix $A\in\mathbb{R}^{n \times n}$. The associated quadratic form $x^T A x$ is a convex function on all of $\mathbb{R}^n$ iff $A$ is positive semidefinite, i.e., if $x^T A ...
12
votes
3answers
1k views

distance regular metric spaces

A metric space (V,d) will be called distance regular if for every distances a>0, b, c a nonnegative integer p(a,b,c) is defined, so that whenever d(B,C)=a, there are precisely p(a,b,c) points A ...
13
votes
7answers
5k views

Uniformly Sampling from Convex Polytopes

How to choose a point uniformly from a convex polytope $P \subset [0,1]^n$ defined by some inequalities, $Ax < b$? (Here $A$ is an $m \times n$ matrix, $x \in \mathbb{R}^n$, and $b \in \mathbb{R}^...
-4
votes
4answers
618 views

What is the max number of points in R^3, interconnected by generic curves?

The largest complete graph that embeds in 2 dimensions is $K_4$, while the largest complete graph that embeds in 3 dimensions is $K_{\infty}$, right? However, I don't know any constructive proof of it....
8
votes
6answers
1k views

Combinatorial distance ≡ Euclidean distance

Definition: A polytope has property X iff there is a function f:N+ → R+ such that for each pair of vertices vi, vj the following holds: disteuclidean(vi, vj) = f(distcombinatorial(vi, vj)) with ...
7
votes
1answer
1k views

Why is 3 a bad constant in the Vitali covering lemma?

Hi, recently I had to do with the Hardy-Littlewood maximal function and we used there the Vitali covering lemma with constant 5. Then, given an advice, I proved it with constant k>3. But I cannot ...
9
votes
1answer
700 views

what was Hilbert's geometric construction in his 17th problem?

Hilbert's 17th problem asked if a nonnegative real polynomial is the sum of squares of rational functions. It was answered affirmative by Artin in around 1920. However, in his speech, he also asked if ...
15
votes
5answers
1k views

Diameter of universal cover

Let $M$ be Riemannian manifold and $\tilde M$ be its universal cover (with induced metric). What is the upper bound for $k=\mathop{diam}\tilde M/\mathop{diam} M$ in terms of $m=|\pi_1(M)|$ (or $\pi_1(...
9
votes
2answers
978 views

Characterization of Riemannian metrics

This is probably an insanely hard question, but given an abstract metric space, is there some way to determine whether it's a manifold with a Riemannian, or more generally a Finslerian, metric? If ...
6
votes
2answers
1k views

Example of non-closed convex hull in a CAT(0) space

this is related to this question but is simpler, and hopefully is well-known. There are a number of references that say that the convex hull of a collection of points in a CAT(0) space need not be ...
3
votes
1answer
395 views

Convex n-polytope general position vectors to general position vectors of tetrahedron

I asked this question in a comment to this question, but got no response. I thought that perhaps it needed more exposure, so I made it a question in itself. Define a set of general position vectors $...
76
votes
20answers
7k views

One-step problems in geometry

I'm collecting advanced exercises in geometry. Ideally, each exercise should be solved by one trick and this trick should be useful elsewhere (say it gives an essential idea in some theory). If you ...
19
votes
2answers
1k views

Four Dimensional Origami Axioms

What are the axioms of four dimensional Origami. If standard Origami is considered three dimensional, it has points, lines, surfaces and folds to create a three dimensional form from the folded ...
83
votes
11answers
11k views

Is it possible to capture a sphere in a knot?

You and I decide to play a game: To start off with, I provide you with a frictionless, perfectly spherical sphere, along with a frictionless, unstretchable, infinitely thin magical rope. This rope ...
8
votes
5answers
2k views

Feasibility of a list of prescribed distances in R^3

I am puzzled with the following problem: Given $n$ real numbers it is to obtain a Yes/No answer to: "whether it is possible to arrange different points in the Euclidean $\mathbb{R}^3$ so that every ...
29
votes
3answers
1k views

Diameter of m-fold cover

Let $M$ be a closed Riemannian manifold. Assume $\tilde M$ is a connected Riemannian $m$-fold cover of $M$. Is it true that $$\mathop{diam}\tilde M\le m\cdot \mathop{diam} M\ ?\ \ \ \ \ \ \ (*)$$ ...
3
votes
2answers
2k views

Break Polyhedron into Tetrahedron

Given a polyhedron consists of a list of vertices (v), a list of edges (e), and a list of surfaces connecting those edges (...
22
votes
2answers
2k views

Is there a neat formula for the volume of a tetrahedron on $S^3$?

There is a nice formula for the area of a triangle on the 2-dimensional sphere; If the triangle is the intersection of three half spheres, and has angles $\alpha$, $\beta$ and $\gamma$, and we ...
14
votes
1answer
897 views

Tropical mathematics and enriched category theory

Is there a connection between tropical mathematics and the Lawvere enriched category theory approach to metric spaces? I guess I will give a partial answer to this below, but I mean can they be ...
27
votes
6answers
2k views

When shorter means smaller?

Assume a convex figure $F\subset \mathbb R^2$ satisfies the following property: if $f:F\to \mathbb R^2$ is a distance-non-increasing map then its image $f(F)$ is congruent to a subset of $F$. Is it ...
18
votes
1answer
566 views

Egalitarian measures

A question I got asked I while ago: If $T$ is a triangle in $\mathbb R^2$, is there a function $f:T\to\mathbb R$ such that the integral of $f$ over each straight segment connecting two points in the ...
7
votes
2answers
661 views

What is known about polyhedra nets that allow overlapping?

It is an open problem that the net of any convex polyhedron can be unfolded onto a flat plane with no overlapping. Is anything known if we allow x faces to overlap? For example, is it known if any ...
23
votes
7answers
4k views

Convex hull in CAT(0)

Let $X$ be complete $\mathop{CAT}(0)$-space and $K\subset X$ be a compact subset. Is it true that convex hull of $K$ is compact? Comments: Convex hull of $K$ = intersection of all closed convex sets ...
9
votes
1answer
551 views

Which changes of metric fix all open balls of a metric space?

In an earlier question, I was interested in counting the number of metric spaces on N points, where I considered two metric spaces to be the same if they had the same collection of open balls. Two ...
11
votes
5answers
2k views

Explanation for gamma function in formula for $n$-ball volume

It is well-known that the volume of the unit ball in n-space is $\pi^{n/2}/\Gamma(n/2+1)$. Do you know of a proof which explains this formula? Any proof which does not treat the cases $n$ even and $n$ ...
9
votes
7answers
902 views

What are some interesting ways of making new metrics out of old metrics?

If $d(x,y)$ and $e(x,y)$ are metrics then $d(x,y)+e(x,y)$ and $\frac{d(x,y)}{1+d(x,y)}$ are metrics. If $d_i(x,y)$ for $i=1,\dots,n$ are metrics then so is $\sqrt{\sum_{i=1}^n{d_i^2(x,y)}}$ Are ...
12
votes
6answers
895 views

How to smootly interpolate between möbius transformations?

If you have two Möbius transformations represented as: $f(z) = \frac{az + b}{cz + d}$ $g(z) = \frac{pz + q}{rz + s}$ where $a, b, c, d, p, q, r, s, z \in \mathbb{C}$ Is it possible to derive a ...
8
votes
8answers
2k views

Side-Angle-Side Congruence and the Parallel Postulate

Is there a link between the side-angle-side congruence of triangles and the parallel postulate? Specifically, does it follow from Euclid's first four axioms alone? In fact, does it even follow from ...
12
votes
7answers
1k views

Upper bound on the area of a midpoint pentagon?

Starting with a convex pentagon P, we define the "middle polygon" Q, whose vertices are the middle points of the sides of the initial pentagon. The ratio between the areas of this polygons seem to ...
5
votes
2answers
436 views

Historical question re: ellipses obtained by certain geometrical constructions

I am a faculty member in the Forensic Science Program at PennState (UP). I am trying to obtain information of a historical nature concerning two closely related topics. I seek historical references ...
40
votes
12answers
2k views

Can a discrete set of the plane of uniform density intersect all large triangles?

Let S be a discrete subset of the Euclidean plane such that the number of points in a large disc is approximately equal to the area of the disc. Does the complement of S necessarily contain triangles ...
18
votes
4answers
2k views

Minkowski sum of small connected sets

Suppose that the convex hull of the Minkowski sum of several compact connected sets in $\mathbb R^d$ contains the unit ball centered at the origin and the diameter of each set is less than $\delta$. ...
3
votes
1answer
1k views

How to find the Fermat Point using the construction of the tangent to ellipse?

Be done the triangle ABC, it is known the method to finding the point Q that minimises the sum QA+QB+QC among all points Q in the plane (The Fermat point). I want a hint for solving this problem using ...
2
votes
2answers
339 views

High dimensional Steiner tree

Given n affinely independent points in n-1 dimensional Euclidean space, how is the minimum Steiner tree constructed? Or assuming that the topology of the Steiner tree is given, is there an easy way ...
9
votes
4answers
519 views

What is the right way to think about / represent general tilings?

For periodic/symmetric tilings, it seems somewhat "obvious" to me that it just comes down to working out the right group of symmetries for each of the relevant shapes/tiles, but its not clear to me if ...
35
votes
10answers
16k views

Algorithm for finding the volume of a convex polytope

It's easy to find the area of a convex polygon by division into triangles, but what is the optimal way of finding the volume of higher-dimensional convex bodies? I tried a few methods for dividing ...
16
votes
5answers
2k views

How Does One Find the “Loneliest Person on the Planet”?

I'm looking for the algorithm that efficiently locates the "Loneliest Person on the Planet", where "loneliest" is defined as: Maximum minimum distance to another person -- that is, the person for ...
1
vote
4answers
2k views

Closest grid square to a point in spherical coordinates

I am programming an algorithm where I have broken up the surface of a sphere into grid points (for simplicity I have the grid lines are parallel and perpendicular to the meridians). Given a point A on ...
22
votes
4answers
3k views

Largest hyperbolic disk embeddable in Euclidean 3-space?

Hilbert proved that there's no complete regular ($C^k$ for sufficiently large $k$) isometric embedding of the hyperbolic plane into $\mathbb{R}^3$. On the other hand, the pseudosphere is locally ...