User Zsbán Ambrus - MathOverflow

34 votes

Accepted

Can we three-color a tiling of the plane with Smith, Meyers, Kaplan, and Goodman-Strauss's einstein?

answered Mar 22, 2023 at 2:48

23 votes

Blackbox Theorems

answered Jun 13, 2012 at 22:08

23 votes

Not especially famous, long-open problems which anyone can understand

answered Jun 23, 2012 at 12:10

22 votes

Accepted

(non-)existence of the aperiodic monotile

answered Mar 21, 2023 at 17:31

17 votes

Mathematicians who were late learners?-list

answered May 6, 2011 at 17:21

14 votes

Example of a good Zero Knowledge Proof

answered Nov 14, 2010 at 12:14

14 votes

Open problems in Euclidean geometry?

answered Apr 14, 2015 at 9:37

13 votes

Suggestions for good notation

answered Nov 8, 2010 at 12:41

11 votes

What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs?

answered Apr 14, 2015 at 9:48

8 votes

Is every graph an edge-crossing graph?

answered Apr 13, 2015 at 6:17

8 votes

Accepted

Graphs with circulant distance matrices

answered Jan 25, 2013 at 15:17

8 votes

Structures that turn out to exhibit a symmetry even though their definition doesn't

answered Jan 13, 2014 at 13:29

7 votes

Blackbox Theorems

answered Jun 13, 2012 at 22:21

7 votes

Pairwise intersecting sets of fixed size

answered Apr 16, 2010 at 15:55

7 votes

Accepted

ultrapowers and higher order logic

answered May 7, 2011 at 21:19

6 votes

Pseudonyms of famous mathematicians

answered Nov 8, 2010 at 10:49

5 votes

covering disks with smaller disks

answered May 25, 2012 at 17:29

4 votes

Awfully sophisticated proof for simple facts

answered Mar 4, 2012 at 13:54

4 votes

Visualizing polyhedra from their 1-skeletons

answered Mar 28, 2013 at 10:11

3 votes

Accepted

Paralel bezier curve

answered Aug 12, 2013 at 15:38

3 votes

Blackbox Theorems

answered Jun 14, 2012 at 10:09

3 votes

Accepted

Large bicliques in r-partite graphs containing no independent sets having one vertex from each class

answered Mar 26, 2012 at 12:54

3 votes

Complexity of matching red and blue points in the plane.

answered Jan 28, 2012 at 19:48

3 votes

Accepted

How can I embed an N-points metric space to a hypercube with low distortion?

answered Apr 14, 2010 at 11:02

3 votes

What is the easiest randomized algorithm to motivate to the layperson?

answered May 9, 2011 at 12:22

3 votes

Pairwise intersecting sets of fixed size

answered Feb 7, 2011 at 15:32

3 votes

Majority vote of total orders

answered Jan 18, 2013 at 10:02

2 votes

Generalizations of Planar Graphs

answered Mar 8, 2011 at 16:10

2 votes

Elementary + short + useful

answered Apr 4, 2011 at 9:14

Stack Exchange Network

45 Answers

Can we three-color a tiling of the plane with Smith, Meyers, Kaplan, and Goodman-Strauss's einstein?

Blackbox Theorems

Not especially famous, long-open problems which anyone can understand

(non-)existence of the aperiodic monotile

Mathematicians who were late learners?-list

Example of a good Zero Knowledge Proof

Open problems in Euclidean geometry?

Suggestions for good notation

What is the minimum N for which there exist N points in the plane that cannot be covered by any number of non-overlapping closed unit discs?

Is every graph an edge-crossing graph?

Graphs with circulant distance matrices

Structures that turn out to exhibit a symmetry even though their definition doesn't

Blackbox Theorems

Pairwise intersecting sets of fixed size

ultrapowers and higher order logic

More open problems

Pseudonyms of famous mathematicians

covering disks with smaller disks

Awfully sophisticated proof for simple facts

Visualizing polyhedra from their 1-skeletons

Paralel bezier curve

Blackbox Theorems

Large bicliques in r-partite graphs containing no independent sets having one vertex from each class

Complexity of matching red and blue points in the plane.

How can I embed an N-points metric space to a hypercube with low distortion?

What is the easiest randomized algorithm to motivate to the layperson?

Pairwise intersecting sets of fixed size

Majority vote of total orders

Generalizations of Planar Graphs

Elementary + short + useful