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 218
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
Modular residue patterns in the iteration of the Collatz-type elevation operator
In the study of integer dynamical systems related to the Collatz map, consider the operator
$$E(n) = \frac{3n+1}{2^{v_2(3n+1)}}$$
and its iterates -
8 days
Size bounds for embeddings of abelian groups without choice
Let $\mathsf{Groups}(X)$ denote the set of groups with underlying set $X$. Cayley's theorem does not use choice: it is a theorem of $\mathsf{ZF}$ that, for every set $X$, there is a function $i:\mathsf{Groups}(X)\rightarrow (S_X)^X$ such that, whenever...
-
0 days
Decidability of a matrix product being rank 1
Given a finite set of $n \times n$ integer matrices it's known (the "Mortality Problem") that for $n > 2$ the problem of determining whether a finite product of them is the 0 matrix is undecidable. I'm interested in an analogous problem: determine...
-
0 days
Confusion concerning the reg/lex and ex/lex constructions on the category of ass...
While trying to gain some understanding on how extensional realizability relates to the reg/lex and ex/lex completions of assemblies, I came to believe the following mutually contradictory statements (definitions to be provided below):
The reg/lex construction $(\mathbf{Ass})_{\mathrm{reg/lex}}$ on the category $\mathbf{Ass}$ of assemblies gives (a category equivalent to) the category $\mathbf{ExtAss}$ of extensional assemblies....
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
