Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Euclidean, hyperbolic, discrete, convex, coarse geometry, metric spaces, comparisons in Riemannian geometry, symmetric spaces.
14
votes
2
answers
539
views
Are all well behaved "mean" functions on $\mathbb{R}^+$ equivalent?
Given a set $S$, a function $M: S\times S \rightarrow S$ is a mean if it satisfies the properties:
$M(a,a)=a\qquad$ (identity)
$M(a,b)=M(b,a)\qquad$ (commutativity).
and possibly
$M(M(a,b),M(a,c …
8
votes
Accepted
Can $[0,1]^4$ be partitioned into copies of $(0,1)^3$?
Almost exactly the same picture can be drawn for the 2-dimensional and 3-dimensional cases (simpler than the OP's) and then it's easy to generalize to higher dimensions by induction. Here $I$ indicate …
8
votes
Fair cutting of the plane with lines
CLAIM. The only fair cutting with at least one quadrilateral is the square grid (2). It was already shown in the original answer (below) that there cannot be $n$-agons for $n\ge 5$.
LEMMA. No fair cut …
6
votes
Accepted
Tilting the $d$-cube to vertically separate its vertices
Robert Israel's answer is best possible.
As pointed out there, the problem is equivalent to finding a vector in $\mathbb{R}^d$ with minimal separation $1$ among sums of subsets of entries, and with th …
1
vote
Iterating projections to random halfspaces
This addresses only the easy part.
The unit $(n-1)$-sphere in $\mathbb{R}^n$ is covered by finitely many disks (sectors) each portending an acute cone from the origin. Each projection to a half-space …
5
votes
Blocking visibility with cylinders
Here is one construction. On the horizontal xy plane place a forest of vertical cylinders of radius r<1/2 (or =1/2 if we allow contacts) centered at each point in $(\mathbb{Z} \backslash{\lbrace0\rbra …
3
votes
Is it possible to capture a sphere in a knot?
Since Anton's beautiful solution makes use of the symmetry of the sphere, I wonder how similar
results could be proven, or counterexamples given, for any other convex shape, including
2-dimensional on …
2
votes
Is it possible to capture a sphere in a knot?
Reid, excellent proof. It works for the cube too and even kills the icosahedron. In this last case I don't know what the angles of a triangle are exactly, so let's just say 60+ each.
Then joining ea …
2
votes
Is it possible to capture a sphere in a knot?
It seems that both the 2-agon and the octahedron (which after all is a collection of 3 somewhat constrained 2-agons) can be shrunk off the sphere, but with 0 derivative at the start, which means that …
4
votes
Is it possible to capture a sphere in a knot?
Adding to Zeb's proof that the tetrahedron can be deformed, one should notice that any tassellation of the sphere containing at least one hexagon (fullerene type) won't be rigid either. In fact alrea …