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 | |
Results tagged with co.combinatorics
Search options not deleted
user 89672
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
5
votes
Solution to Erdos-Ulam problem
The error is in this sentence:
As a circle with its centre on the Base Plane, $T_{n-1}$ will have at least two points on the Base Plane.
Circles in an ambient space of more than three dimensions don …
- 3,068
8
votes
Tiling with ten-fold symmetry and (unoriented) Penrose tiles?
If you impose no other restrictions, something like this works just fine:
For a slightly more complicated variant incorporating both tile shapes:
- 3,068
5
votes
Tiling planar integer lattice by finite point sets
Every such $S$ has a periodic tiling, in which finitely many disjoint copies form a set with one representative for each translate of some discrete lattice $L$ - see Bhattacharya 2016 or Greenfeld and …
- 3,068
3
votes
On cutting tetrahedrons into mutually congruent pieces
This MSE question exhibits two non-regular tetrahedra which can be decomposed into 8 smaller copies congruent to themselves; this yields $8^n$ for any $n$.
- 3,068