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 |
Finite or discrete collections of geometric objects. Packings, tilings, polyhedra, polytopes, intersection, arrangements, rigidity.
5
votes
Shortest grid-graph paths with random diagonal shortcuts
I think this should be equivalent to a directed, site first-passage percolation (FPP) model where each site takes a passage time of $1$ or $\sqrt{2}$, each with probability $1/2$. I'm not convinced o …
0
votes
3
answers
499
views
The symmetry group of $\mathbb Z^d$
Let $d \ge 1$, and consider the integer lattice $\mathbb Z^d$. This is a homogeneous space, in the manner of the Erlangan Programm.
I would like to write $\mathbb Z^d = G / H$, where $G$ is the symm …
8
votes
Random Walks in $Z^2$/$Z^2$-intrinsic characterization of Euclidean distance Part II
By Donsker's theorem, this should converge to a Brownian motion in the scaling limit. This means that the shapes Robby McKilliam plotted will converge to a circle (when properly scaled), since the di …