Skip to main content
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
Results tagged with
Search options not deleted user 29873

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

6 votes

Sums of squared distances between points on an $n$-sphere

The sum of squares of chords has proven to be particularly useful in studying arrangements of lines for redundant linear encodings of data. Suppose $n=\binom{d+1}{2}$. In this case, we may identify $ …
Dustin G. Mixon's user avatar
20 votes
3 answers
1k views

How can I randomly draw an ensemble of unit vectors that sum to zero?

Inspired by this question, I would like to determine the probability that a random knot of 6 unit sticks is a trefoil. This naturally leads to the following question: Is there a way to sample unifor …
Dustin G. Mixon's user avatar
1 vote

Probabilistic Johnson-Lindenstrauss Lemma for arbitrary points

This is more of a long comment than an answer: Let's assume $f$ is a $k\times d$ matrix with orthogonal rows, each with norm $\sqrt{d/k}$ (random $f$'s of this form are known to satisfy JL). Consider …
Dustin G. Mixon's user avatar
2 votes
1 answer
220 views

When is Euclidean distortion finitely determined?

The Euclidean distortion of a metric space $X$, denoted $c_2(X)$, is the infimum of $c$ for which there exists a map $f\colon X\to\ell^2$ such that $$d_X(x,y) \leq \|f(x)-f(y)\|_{\ell^2} \leq c\cdot d …
Dustin G. Mixon's user avatar
2 votes

Is $0$ a member of the following special kind of a convex compact set?

Without loss of generality, $K$ is a polytope with its vertices in the $B_i$'s. By Farkas' lemma, it's equivalent for the vertices to reside on the same side of a subspace of codimension $1$. With thi …
Dustin G. Mixon's user avatar
2 votes

Packing obtuse vectors in $\mathbb{R}^d$

Without loss of generality, the vectors are in general position. Take $d$ vectors with pairwise obtuse angles and rotate them so that they form the columns of a $d\times d$ upper-triangular matrix wit …
Dustin G. Mixon's user avatar
5 votes
Accepted

Maximal $\pi/2$-separated subset of the sphere

You can pack at most $d+1$ pairwise obtuse vectors in $\mathbb{R}^d$. Several proofs of this fact can be found here.
Dustin G. Mixon's user avatar
1 vote
0 answers
56 views

Are sharper lower bounds known for these potentials on the sphere?

Fix a positive integer $\ell$. For $x_1,\dotsc,x_n\in S^{d-1}$, Venkov proved that $$ \sum_{i=1}^n\sum_{j=1}^n(x_i\cdot x_j)^{2\ell}\geq\frac{(2\ell-1)!!(d-2)!!}{(d+2\ell-2)!!}\cdot n^2, $$ with equal …
Dustin G. Mixon's user avatar
18 votes

How to explain the concentration-of-measure phenomenon intuitively?

Take iid Gaussian random variables $X_1,\ldots,X_d$ with mean $0$ and variance $1/d$. Normalizing the vector $X=(X_1,\ldots,X_d)$ will produce a random point on the unit sphere, but it's already close …
Dustin G. Mixon's user avatar
1 vote

Geometrical interpretation of pictures transforms and other "high dimensional everyday objects"

The wall that separates me from my neighbor acts as a low-pass filter. That means I get to listen to the projection of Justin Bieber onto the subspace of low-frequency audio signals.
Dustin G. Mixon's user avatar
7 votes

Graph metric approximating Euclidean metric

Pick some small $\epsilon>0$, take the dilated integer lattice $\epsilon^2\cdot\mathbb{Z}^2$ to be our vertex set, and draw an edge between two vertices if their Euclidean distance is between $\epsilo …
Dustin G. Mixon's user avatar
1 vote
Accepted

Conditions for Lipschitzness of boundary normal vector, almost everywhere

Given a nonempty closed set $C\subseteq\mathbb{R}^n$, let $S_C\subseteq\mathbb{R}^n$ denote the set of points for which the closest point in $C$ is not unique. Suppose $C$ satisfies each of the follow …
Dustin G. Mixon's user avatar
17 votes
Accepted

What's that shape? Inferring a 3D shape from random shadows

This is very similar to the cryo-electron microscopy problem: You want to image a certain macromolecule, and the scale of the macromolecule requires the use of an electron microscope. Unfortunately, s …
Dustin G. Mixon's user avatar