MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Péter Komjáth

3,653
Reputation
1113 views
Is this your account?

Registered User 

Name Péter Komjáth
Member for 3 years
Seen 34 mins ago
Website
Location Budapest
Age 60
I am professor and head of department at the Eotvos University, Budapest, Hungary. I do research in set theory.
4h
 answered Why does the generalised Galvin-Prikry Theorem only hold at Ramsey cardinals?
2d
 accepted Upper Limit on the Central Binomial Coefficient
Jun
14
 answered Upper Limit on the Central Binomial Coefficient
Jun
8
 awarded ● Yearling
May
31
 answered If $\kappa \rightarrow (\alpha)^r_2$ holds for every $r\in \omega$, then is $\kappa$ an $\alpha$-Erdős cardinal?
May
29
 comment Can all aleph_2-dense subsets of R be isomorphic?
Shelah also mentions it among the most important open problems in "On what I do not understand (and have something to say): I"shelah.logic.at/files/666.pdf
May
24
 answered What is the least ordinal than cannot be embedded in $\mathbb{R}^\mathbb{R}$?
May
20
 comment Yitang Zhang’s preprint on Landau-Siegel zeros
Good point. .
May
16
 awarded ● Nice Answer
May
16
 comment Cardinals without choice: interpolation (reference wanted)
I just heard this nice result from Fred Galvin a few weeks ago. My understanding is that he proved it without knowing a reference.
May
14
 answered Proof of the weak Goldbach Conjecture
May
13
 answered collapsing successor of singular
Apr
23
 comment Resources on Wolstenholme’s theorem
Did you try Dickson's "Theory of Numbers"?
Apr
17
 accepted Examples of stationary set preserving forcings that are not semiproper?
Apr
17
 answered Examples of stationary set preserving forcings that are not semiproper?
Apr
9
 revised Countable coloring of a plane
added 2333 characters in body
Apr
9
 answered Countable coloring of a plane
Feb
12
 awarded ● Necromancer
Jan
21
 comment Compactness of the Hilbert cube without the Axiom of Choice
Similarly to Andrej's argument above, one can give an AC-free proof of the following result: if $X$ is a countable graph, every finite subgraph of $X$ has a good coloring with $k$ colors ($k$ is finite) then so has $X$.
Jan
15
 comment Axiom of Choice and Number Theory
Hindman's theorem has a proof using Zorn's lemma. See, e.e., here: math.toronto.edu/lgoldmak/Hindman.pdf