Skip to main content
MathOverflow
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen's user avatar
Bjørn Kjos-Hanssen
  • Member for 14 years, 9 months
  • Last seen this week
Profile Activity
Stats
24,834
reputation
479k
reached
415
answers
48
questions
Communities
View all
About
Badges
View all badges
3
gold badges
58
silver badges
114
bronze badges
Top tags
View all tags
493
Score
82
Posts
18
Posts %
348
Score
62
Posts
13
Posts %
297
Score
115
Posts
25
Posts %
212
Score
54
Posts
12
Posts %
141
Score
51
Posts
11
Posts %
140
Score
39
Posts
8
Posts %
Top posts
View all questions and answers
answer
58
Is there a measure zero set which isn't meagre?
Oct 25, 2010
answer
43
Suggestions for good notation
Oct 20, 2010
answer
37
Examples of mathematical papers that contain a kind of research report
Nov 21, 2018
answer
36
If all balls at $x$ and $y$ are isometric is there an isometry sending $x$ to $y$?
Oct 6, 2014
answer
33
Is there a known Turing machine which halts if and only if the Collatz conjecture has a counterexample?
Sep 15, 2018
answer
32
On sentences true in all finite groups
May 24, 2015
answer
25
What is the reverse mathematical strength of the fundamental theorem of algebra?
Jun 30, 2015
answer
25
Languages beyond enumerable
Apr 21, 2016
answer
21
Why is the Gaussian so pervasive in mathematics?
Sep 28, 2010
answer
21
History of powers beyond squares and cubes
Sep 19, 2014
Top Meta posts
3
8
38
MO answer formalized in Lean
20
Formatting a citation to a MathOverflow answer
11
Is the question "Why fund the research in pure mathematics?" allowed on MO?
10
MO answer formalized in Lean
8
Best of MathOverflow, or papers inspired by MathOverflow
Top network posts
View all network posts
72
Do you need to read a whole article before citing it?
51
When mentioning the author of a journal I am using in my Literature Review, should I mention author's credentials?
49
Intuition for random variable being $\sigma$-algebra measurable?
48
Do any two spanning trees of a simple graph always have some common edges?
33
Are there any proofs the undecidability of the halting problem that does not depend on self-referencing or diagonalization ?