MathOverflow
Math Overflow. Q&A for professional mathematicians.
Read Mathoverflow.net news digest here: view the latest Math Overflow articles and content updates right away or get to their most visited pages. Mathoverflow.net belongs to a group of fairly successful websites, with more than 458K visitors from all over the world monthly. It seems that Math Overflow content is notably popular in USA, as 32.4% of all users (148K visits per month) come from this country. We haven’t detected security issues or inappropriate content on Mathoverflow.net and thus you can safely use it. Mathoverflow.net is hosted with Stack Exchange, Inc. (United States) and its basic language is English.
Content verdict: Safe
Website availability: Live
Language: English
Last check:
-
15 260
Visitors daily -
54 936
Pageviews daily -
6
Google PR -
21 146
Alexa rank
Best pages on Mathoverflow.net
-
Q&A for professional mathematicians
-
Hottest Questions Today - MathOverflow
Skip to main content Stack Exchange Network Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, ...
-
I hope everyone is doing well. Let $K \subset \mathbb{R}^n$ be a centrally symmetric convex body $(K = -K)$. Denote by $K \mid H$ the orthogonal projection of $K$ onto $H$, where $H$ is an $n - 1$
Mathoverflow.net news digest
-
0 days
Purported proof of the cycle double cover conjecture
Wikipedia says:
On July 10, 2026, OpenAI released a preprint claiming a positive resolution of the conjecture, the proof of which they claim was generated by its GPT 5.6 large language model.
Has any graph theorist verified this purported proof? -
0 days
This is a question about validity of the Godel sentence in PM
The Godel sentence is a formula ~p(G(~p(n))) [Breathwait 1931] , // a.k.a a formula of an unprovabilty predicate with a free variable, substituted with a composite numerical reference G(~p(n)) to a formula ~p(n). // The composite reference function G...
-
6 days
User friendly exposition of the theory of mixed Hodge modules
I am looking for an exposition of this theory that includes its foundations, the construction of pure Hodge structures and the proof of the hard Lefschetz theorem for intersection cohomology, as well as the decomposition theorem. Background material...
-
2 months
placing $n \cdot m$ coins on an $n \times n$ board generalizing the $n$-queens p...
It is a well known fact that, with the exception of $n = 2$ and $n = 3$, it is possible to place $n$ queens on an $n \times n$ chessboard that cannot attack each other.
The fact that the queens cannot attack each other boils down to the fact that there are no more than $1$ queens on any $0^{\circ}$ horizontal line, no more than $1$ queens on any $90^{\circ}$ vertical line, no more than $1$ queens on any $45^{\circ}...
Domain history
| Web host: | Stack Exchange, Inc. |
| Registrar: | GoDaddy.com, LLC |
| Registrant: | Registration Private (Domains By Proxy, LLC) |
| Updated: | May 11, 2026 |
| Expires: | July 14, 2026 |
| Created: | July 14, 2009 |
Whois record
Visitor gender
Male
Female
Safety scores
Trustworthiness
ExcellentChild safety
Excellent
