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 286
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, ...
-
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...
Mathoverflow.net news digest
-
0 days
How do I solve this progression problem?
On a board, a sequence of n + 1 real numbers is written, with n ≥ 1,formed by the number 1 followed by a geometric progression of n terms whose firstterm is equal to 1 and whose common ratio is equal to √2, that is, the numbers written on the board are...
-
0 days
Forcing with strong binary trees
A strong subtree $T \subseteq 2^{<\omega}$ is a perfect tree of infinite height such that for all $s,t \in T$ for which $|s| = |t|$, $s$ splits in $T$ iff $t$ splits in $T$. The Ramsey theory of strong subtrees was studied by Milliken in A Partition...
-
0 days
Natural numbers as sums of powers of distinct numbers #2
Find the smallest number $n$ such that almost all natural numbers can be represented as the sum $$a_1^{a_{p(1)}}+a_2^{a_{p(2)}}+\dots+a_n^{a_{p(n)}}$$ where $a_1,\dots,a_n$ are pairwise distinct natural numbers, $p$ is a permutation of the set $\{1,...
-
8 days
Non-increasing property of a norm-like function over matrices
Let $P,Q$ be two real orthogonal projections on $\mathbb R^n$, and assume that they are permutation similar. More specifically, assume that each of them is permutation similar to a block diagonal matrix of the form
$$\operatorname{diag}\!\left(\frac1m J_m,\frac1m J_m,\dots,\frac1m J_m\right).$$...
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
