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 -
20 847
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
Due diligence in the age of AI: is this Laurent polynomial parity lemma in the l...
A core principle in the use of AI for research (something we might want to add to our AI policy), is "Put effort into proper attribution". In that spirit I would like to ask if the following result on Laurent polynomials, handed to me with a proof by...
-
10 years
How undecidable is the spectral gap?
Nature just published a paper by Cubitt, Perez-Garcia and Wolf titled Undecidability of the Spectral Gap, there is an extended version on arxiv which is 146 pages long. Here is from the abstract:"Many challenging open problems, such as the Haldane conjecture...
-
14 years
Ordinals and complexity classes
What is the least recursive ordinal $\alpha$ such that there is no algorithm in complexity class $\mathsf{P}$ which implements a well-ordering of $\mathbb{N}$ with order type $\alpha$? (where the size of input is the total number of digits in numbers...
-
16 years
Efficient way of determining isomorphism
Suppose you are given two isomorphic graphs $G$ and $H$. Is there an efficient way of defining an isomorphism $\phi:V(G) \to V(H)$ if we already know they are isomorphic? Or is it just a guess and check process?
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
