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 165
Alexa rank
Best pages on Mathoverflow.net
-
Q&A for professional mathematicians
-
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$
-
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, ...
Mathoverflow.net news digest
-
0 days
Does every mathematical problem have a shortest possible proof?
Suppose we measure the length of a proof by the number of logical steps, symbols, lines, or pages used.
If a theorem has at least one valid proof, does there necessarily exist an absolutely minimal proof within a fixed logical system?
Or is it possible that every proof could always be shortened further through a completely different method or perspective, while still remaining fully rigorous and logically complete?... -
0 days
Is P vs NP a Computational Problem or a Logical Paradox?
I am exploring the hypothesis that the difficulty of the P vs NP problem might stem from a structural analogy to the Liar Paradox and Gödel’s Incompleteness Theorems, rather than solely from a lack of efficient algorithmic ingenuity.If a decision problem...
-
0 days
Is there an "equationally presented" version of Cayley's theorem for abelian gro...
Given a set $A$ and a variety (in the sense of universal algebra) $\mathbb{V}$, let $\mathbb{V}(A)$ be the set of all $\mathbb{V}$-algebras with underlying set $A$. Let $\mathbb{G}$ be the variety of groups. Given a group $G$, I'll write "$\underline...
-
16 years
Is there a bipartite analog of graph theory?
I would like to compile a list of questions about graphs that have a non-trivial analogs for bipartite graphs.
Let me give the following examples:
Cycle vs Even cycle. Most questions about cycles in graphs have analogs in even cycles for bipartite graphs. For instance, it is trivial to show that a bipartite graph on an odd number of vertices cannot have a Hamilton cycle. In such a case the bipartite...
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
