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

learn more… | top users | synonyms (1)

0
votes
0answers
13 views

Characterize polytopes resulting from cutting a convex polytope by a hyperplane

We have a convex polytope $P$ for which we know its set of vertices. Using this set we characterize the H-representation of $P$ as: $\mathbf{A}\mathbf{x} < \mathbf{b}$. If a hyperplane defined by ...
5
votes
0answers
43 views

Concavity of mixed volumes and mixed discriminants

For $n\times n$ symmetric matrices $A_1, \ldots, A_n$, the mixed discriminant $D(A_1, \ldots, A_n)$ can be defined as $1/n!$ times the coefficient of $t_1\ldots t_n$ in the homogeneous polynomial ...
0
votes
0answers
44 views

Hexagonal lattice in a disk when the distance between points is $R_l$ [on hold]

Consider a hexagonal tiling of a 2D plane where hexagons are of identical size and of radius $R_l$. I assume we can say that the vertices together with the center of each hexagon form an integer ...
0
votes
0answers
25 views

upper bound and a lower bound on the number of points that are uniformly distributed on a surface [migrated]

Can I calculate an upper bound and a lower bound (or max or min) on the number of points that are uniformly distributed on a surface, knowing the area of the surface ? More precisely, I have a sector ...
11
votes
2answers
265 views

The most number of points that realize only $k$ distinct distances

For $k \ge 1$, let $f_d(k)$ be the largest possible number of points $p_i$ in $\mathbb{R}^d$ that determine at most $k$ distinct (Euclidean) distances, $\|p_i-p_j\|$. Example. For points in the plane ...
18
votes
2answers
570 views

Is every closed curve in 3D a geodesic on a genus-0 surface?

Let $\gamma$ be a smooth, closed, unknotted curve embedded in $\mathbb{R}^3$. Q. Does there always exist a smooth, embedded, genus-zero surface $S \subset \mathbb{R}^3$ such that $\gamma$ is a ...
2
votes
0answers
52 views

Euclidean minimum spanning trees intersecting each unit square

The recent question "Euclidean Minimum Spanning Trees Restricted to One Vertex Per Grid Cell" can be restated in terms of "minimum spanning trees intersecting each (closed) lattice square of an ...
-3
votes
0answers
13 views

Descrition of clipping algorithm in Murta's gpc [on hold]

I have searched but failed to get a algorithmic description of the algorithm used by Alan murta in general polygon clipper.It is NOT vatti,for sure. Unfortunately old versions of his code are also ...
2
votes
1answer
24 views

Algorithm to find the vertices of the equidistant lines between N closed polygonal lines

I have a set $\{C_1, C_2, \ldots, C_N\}$ of $N$ nonintersecting closed piecewise linear curves on the Euclidean plane. For every point $x \in \mathbb{R}^2$ we say it belongs to a territory serviced by ...
2
votes
0answers
113 views

Find the intersection between two convex hulls, in this specific case

We work over $\mathbb{R}^K$. Let $V$ be the set of vectors whose coordinates take values $0$ or $1$, or equivalently the corners of the unit cube $[0,1]^K$. Let $d:\{0, \ldots, K\} \to \mathbb{R}_+$ ...
5
votes
0answers
106 views

Euclidean Minimum Spanning Trees Restricted to One Vertex Per Grid Cell

Given an $n \times n$ grid with unit grid cells, and one point from the interior of each cell, what is are best possible lower and upper bounds for lengths of minimum spanning trees? The lower bound ...
5
votes
1answer
98 views

Pigeonholing Polygons: Can two rigid regions fit in twice the space needed?

This is a tweak of Henry Segerman's question Can an arbitrary collection of circles of total area 1/2 fit into a circle of area 1? , but restricted to the point of possibly having a proof in the ...
4
votes
1answer
109 views

Another 2D theorem which generalizes to higher dimension

I have found a new property of the Tetrahedron. In fact, this is a 3D generalization of theorem 1 in my paper "A Note on Reflection", published by Forum Geometricorum. Consider any Tetrahedron ABCD. ...
1
vote
1answer
81 views

Extreme points of convex hull of Minkowski sum [closed]

Let $\operatorname{conv}(a_1,\ldots,a_m)$ denote the convex hull of $\{a_1,\ldots,a_n\}$. Let $P = \operatorname{conv}(a_1,\ldots,a_p)$ and $Q = \operatorname{conv}(b_1,\ldots,b_q)$ be two convex sets ...
1
vote
3answers
160 views

Isometric imbedding of finite metric space into standards spaces [duplicate]

Is it true that any metric space consisting of $n$ points can be isometrically imbedded into $n-1$ dimensional Euclidean space? Hyperbolic space? (For $n=3$ this is true.) If not, what are ...
23
votes
1answer
420 views

Expected number of vertices of a hypercube slice — is this new/interesting?

I am a (mostly) amateur mathematician, but my education and work have featured a lot of mathematics, and recently I bumped into a mathematical problem for which I can find no references, and I am ...
16
votes
1answer
349 views

What sort of models did Bolyai and Lobachevsky use to demonstrate the consistency of their models of non-Euclidean Geometry?

As is well-known, in the 1820s both Bolyai and Lobachevsky showed, at long last, the independence of the Parallel Postulate from the rest of the axioms of Euclidean geometry by developing what we now ...
2
votes
1answer
95 views

What is the distribution of the maximum nearest-neighbor distance of a point cloud sampled from a solid body like?

Let $\mathcal{B} \subseteq \mathbb{R}^n$ be an $n$-dimensional solid body. Assume that we sample $N$ points, say $S = \{ x_1, ..., x_N \}$, from $\mathcal{B}$ uniformly at random. Consider the ...
1
vote
0answers
36 views

Projection of a ray onto a random polytope

Suppose $P$ is a polytope formed by $p$ (general) random planes in $\mathbb{R}^n$. We assume $p \asymp n$ and $P$ has a diameter $O(\sqrt{n})$. For any $x \in \mathbb{R}^n$, denote by ...
4
votes
2answers
229 views

Breaking a rectangle into smaller rectangles with small diagonals

Say I am given a rectangle with dimensions $a \times b$ and an integer $n$. I'd like to break this rectangle into $n$ smaller rectangles $R_i$, and I'd like to make the maximum diagonal of any of ...
4
votes
2answers
211 views

A (possibly boring) Voronoi Game

The board for this game is a compact convex region $\cal C$ of $\mathbb{R}^2$. Below I illustrate with $\cal C$ an equilateral triangle. Two players, $A$ and $B$, alternate turns. At each turn they ...
4
votes
2answers
236 views

What are the applications of Voronoi diagrams in pure mathematics? [closed]

Voronoi diagrams have interesting mathematical properties and applications in algorithms and modeling. But what are its applications in pure mathematics? For example, what theorems can be proved using ...
6
votes
1answer
173 views

Is the center of gravity in a CAT(0) space contained in the convex hull?

In reading Greg Kuperberg's partial answer to this question Convex hull in CAT(0) , I started wondering if the center of gravity is always contained in the closed convex hull. More precisely, given ...
3
votes
0answers
28 views

Convex hulls of quasi-convex sets in proper CAT(0) spaces

Let $A$ be a quasi-convex set in some proper CAT(0) space, $X$, and let $\mbox{Hull}(A)$ be the intersection of all convex sets containing A. Can we conclude that $\mbox{Hull}(A)$ is in some bounded ...
7
votes
0answers
78 views

What are the extremal CAT(0) metrics?

(Split off from Does every CAT(0) space embed in a product of trees? ) Fix an integer $k \ge 2$, and let $MC0_k \subset \mathbb{R}^{\binom{k}{2}}$ be the set of possible squared-distances between $k$ ...
10
votes
2answers
248 views

Does every CAT(0) space embed in a measurable integral of $\mathbb{R}$-trees?

Question 1. Does every CAT(0) space embed isometrically inside an integral of $\mathbb{R}$-trees? Here an integral of $\mathbb{R}$ trees means the set of functions from a measure space $\mathcal{F}$ ...
5
votes
1answer
229 views

Avoiding mean-curvature flow dumbbell neck-pinch by inflating a surface

It is well known that Grayson's dumbbell neck-pinch1,2 separates into disconnected pieces under mean curvature flow:                     Image ...
8
votes
1answer
307 views

Orthonormal bases of R^3 with components lying in the golden field

Greg Egan proved an interesting theorem about unit vectors in $\mathbb{R}^3$ whose components actually lie in the 'golden field' $\mathbb{Q}[\sqrt{5}]$. He found it in our studies of twin ...
4
votes
1answer
128 views

Can every large point set be connected to a given knot?

Let $K$ be a given knot, and $P$ a set of points in $\mathbb{R}^3$ in general position, general position in the sense that no three points are collinear and no four coplanar. Define the point-set ...
7
votes
2answers
183 views

approximate two different real numbers to order $\frac{1}{z^{3/2}}$

I took this result from Minkowski's book on Geometry of numbers: Two arbitrary real quantitites $a$ and $b$ may be made to approach as near as we wish in value the two fractions $\frac{x}{z}$ and ...
0
votes
0answers
47 views

On the centroid of a triangle [migrated]

There's three different ways to see a triangle in the Euclidean plane: as three non-collinear points, say $A$, $B$, $C$; as the line segments connecting the three points, that we can parametrize as a ...
4
votes
1answer
55 views

Largest regular $k$-simplex inscribed in a $d$-cube, $k < d$

The largest (by edge length) regular simplex inscribed in a unit cube is well known in $\mathbb{R}^2$ and $\mathbb{R}^3$:     Image sources: left: NMSU, right: Mathworld. A recent ...
2
votes
2answers
50 views

Volume of a region given by a Constraint Satisfaction Problem

I have a Linear Constraint Satisfaction Problem i.e. I have variables $ x_1, x_2,...,x_m$, with corresponding domains $D_1,D_2,...,D_m $ satisfying linear constraints $C_1, C_2,...,C_n$ with $n ...
11
votes
2answers
270 views

A measure on the space of probability measures

This question was originaly posted in the stackexchange https://math.stackexchange.com/questions/1226701/a-measure-on-the-space-of-probability-measures but since it only got a comment I decided to ...
1
vote
0answers
26 views

Biggest volume parallelotope inside the union of two parallelotopes

Given a parallelotope $P$ symmetric around the origin, and a vector $v$, such that $(P+v)∩(P−v)$ is not empty, is there a simple way to obtain a parallelotope $Q⊂(P+v)∪(P−v)$, symmetric around the ...
5
votes
2answers
165 views

Biggest parallelogram inside the union of two translated parallelograms

If I have a parallelogram $P$ symmetric around the origin, and a vector $v$, such that $(P+v)\cap (P-v)$ is not empty, is there a simple way to obtain the parallelogram $Q\subset (P+v) \cup (P-v)$, ...
1
vote
1answer
71 views

Alexandrov spaces of constant curvature

Let $X$ be locally compact Alexandrov space whose curvature satisfies both inequalities $\geq K$ and $\leq K$. What can be said about such a space? Is it locally isometric to the standard Riemannian ...
4
votes
3answers
325 views

Must the powers of some element always grow linearly with respect to a word metric?

Suppose we have a group $G$ which is finitely generated , and let $|\cdot |$ denote some word metric on it. Must there be an element $a\in G$ such that $|a^n|\ge c\cdot n$ for some $c>0$? My ...
9
votes
1answer
121 views

bi-Lipschitz gluing

Let $H$ be the Heisenberg group with left invariant sub-Riemannian metric and $\varepsilon>0$ is small. Let us denote by $|x-y|_H$ the distance from $x$ to $y$ in $H$. I have a bi-Lipschitz ...
1
vote
1answer
66 views

4D Duoprisms based on nonconvex polygons

A duoprism is a polytope that can be expressed as the Cartesian product of two polytopes (each of dimension $\ge 2$). Four-dimensional duoprisms in particular have been studied: $$P \times Q = \{ ...
0
votes
1answer
53 views

Existence of shortest paths in complete Alexandrov spaces

Let $X$ be complete finite dimensional Alexandrov space with curvature bounded from below. Is it true that any two points can be connected by a shortest path? If this is not true in general, it it ...
13
votes
2answers
255 views

Can any simplex shadow-project to a regular simplex?

Every triangle $A$ can be oriented in $\mathbb{R}^3$ so that its orthogonal projection (shadow) onto the $xy$-plane is an equilateral triangle $Q$:               ...
1
vote
0answers
130 views

Products between metrics in a product of manifolds

In the "Einstein Manifold" book written by Arthur Besse, chapter 16, there is a notation of a manifold composed by the Cartesian product between two others: $(M_1\times M_2, f^p(g_1 \times g_2))$ ...
17
votes
5answers
404 views

How many unit simplices are needed to cover a unit $n$-cube?

The volume of an $n$-dimensional simplex of unit edge length is $$V(n) = \frac{\sqrt{n+1}}{n! 2^{n/2}} \;,$$ so at least $\lceil 1/V(n) \rceil$ such simplices are needed to cover the unit $n$-cube. ...
4
votes
2answers
331 views

Terminology for metrics?

For some reason, I'm currently interested in the following relation - let $d,\delta$ be two metrics on some space $X$. We call the metrics _______ if there are some constants $C,E>0$ such that for ...
3
votes
1answer
152 views

Find a line such that sum of perpendicular distances of points to the line is minimized

Given a set of points (column vectors) $S = \{p_1, p_2, \cdots, p_n\} \subset \Re^d$, let $A \in \Re^{n \times d}$ be a matrix of which each row is just $p_i^T$. It is easy to find a unit vector $s_1$ ...
3
votes
0answers
60 views

On the modulus of convexity of mixed-norm $\ell_{p_1,p_2}$ spaces

Let $\ell_{p_1,p_2}=(\mathbb{R}^{m\times n},\|\cdot\|_{p_1,p_2})$ be the space of $m\times n$ matrices endowed with the mixed-norm $$ \|X\|_{p_1,p_2} = \left( \sum_{j=1}^n \left( \sum_{i=1}^m ...
0
votes
0answers
70 views

Largest ball with fixed center in a a convex region

Let $x_0$ be a point contained inside a compact, convex set $C\subset\mathbb{R}^d$, which is of the form $C=\{x:f(x)\leq0\}$ for some explicit convex function $f$. Is there a computationally ...
3
votes
2answers
487 views

What's the name of this geometric mathematical modeling problem?

There is a right angle corner with width 1 in both directions. One wants to find the largest area shape which can pass through this corner. I know that this is a famous problem, but what is it called? ...
0
votes
0answers
105 views

How large can a set of nearly equidistant points be?

Suppose that $D$ is a set of points in $\mathbb{R}^{k}$ such that all pairwise distances between them belong to $[1,1+\epsilon]$. It seems that such a set cannot be very large and that its ...