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 15516

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

17 votes
2 answers
982 views

Placing points on a sphere so that no 3 lie close to the same plane

Motivation I am working with arbitrary parallelopiped tilings given by projection from a higher dimensional space. The collection of tiles, and some properties of the higher dimensional space are spe …
Edmund Harriss's user avatar
16 votes
4 answers
2k views

Point sets in Euclidean space with a small number of distinct distances

It is well known and not hard to prove that the regular simplex in n-dimensions is the only way to place n+1 points so that the distance between distinct pairs of points is always the same. My general …
Edmund Harriss's user avatar
11 votes
Accepted

Not quite regular polyhedra

It turns out that these polyhedra that have congruent vertices and faces have a name. They are the Noble Polyhedra. If one insists that they also be convex the Noble polyhedra are the regular polyhedr …
Edmund Harriss's user avatar
7 votes
3 answers
861 views

Not quite regular polyhedra

Take a naive interpretation of regular polyhedra: All vertices (including epsilon ball) congruent All edges congruent All faces congruent We can now find interesting families by removing one requi …
Edmund Harriss's user avatar