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 -
23 192
Alexa rank
Best pages on Mathoverflow.net
-
Q&A for professional mathematicians
-
Let $A$ be a $C^*$-algebra and $(a_{ij}) \in M_n(A)$ be a positive matrix. Does there exist a constant $C \ge 0$ (not depending on the $a_{ij}$) such that $$\lVert(a_{ij})\rVert \le C \Bigl\lVert\s...
-
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
$x^2 + 71 y^2$ and Weber's Lehrbuch
The primes $ p = u^2 + 71 v^2 $ (other than $71$ itself), up to $12345,$ are precisely the primes $q$ up to that bound for which$$ x^7 - 2 x^6 - x^5 + x^4 + x^3 + x^2 - x - 1 \equiv 0 \pmod q $$
has seven distinct roots.
In Cox, Primes of the Form $x^2 + n y^2$, Theorem 9.2 says that there is a polynomial of degree $h(-4n)$ that does the job. Indeed, class numbers 3 and 4 are dealt with in two papers by K. S. Williams. Oh, Cox refers to Weber.... -
0 days
What is the strength of projective determinacy?
Consider the following theories:
$T_1$: $\mathsf{ZFC+PD}$ where $\mathsf{PD}$ is stated as a schema.
$T_2$: $\mathsf{ZFC+PD}$ where $\mathsf{PD}$ is a single sentence in the language of set theory. -
0 days
Bounding norm of Jacobi fields given end point values
I posted this question on MSE first but it seems I'm not getting an answer.I'm reading the paper on the generalized sphere theorem by Grove and Shiohama, and there is an observation they made that I'm struggling to prove.
We have two unit geodesics $\tau,\sigma:[0,L]\to M$, where $M$ has sectional curvatures $sec\geq\delta>0$, and let $c_t:[0,1]\to M$ be the geodesic joining $\tau(t)$ to $\sigma(t)$, for $t\in[0,L]$. Here $\tau$ and $\sigma$ are close, in the sense... -
0 days
Is the product of "non-coding" forcings also "non-coding"?
Say that a forcing notion $\mathbb{P}$ is slow iff there is some $f:\mathbb{R}\rightarrow\mathbb{R}$ (in $V$) such that for every $\mathbb{P}$-name for a real, $\nu$, we have $\Vdash_\mathbb{P}\exists r\in V(\nu\oplus \check{r}\not\ge_Tf(r))$. For example...
Domain history
| Web host: | Stack Exchange, Inc. |
| Registrar: | GoDaddy.com, LLC |
| Registrant: | Registration Private (Domains By Proxy, LLC) |
| Updated: | July 07, 2025 |
| Expires: | July 14, 2026 |
| Created: | July 14, 2009 |
Whois record
Visitor gender
Male
Female
Safety scores
Trustworthiness
ExcellentChild safety
Excellent
