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 -
22 144
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
Proving bounds for function set with similarities to Legendre polynomials
I search to prove ($n\in \mathbb{N}_0$)
$$ |f_n(x)| \le 1 \text{ for } x\in[0,1]$$
where -
0 days
Synthetic $(\infty, 1)$-category theory
When studying motivic homotopy theory, I find that using language of $\infty$-categories often simplifies a lot, comparing to the traditional method using model categories. Although I’m familiar with model categories now, I have only vague notions about...
-
0 days
A Generalization of Andrica Conjecture
Conjecture: Let $\Omega(n)$ be the total number of prime factors of $n$ (with multiplicity). For $k \ge 1$, let $a, b$ be consecutive integers such that $\Omega(a)=\Omega(b)=k$.I propose the inequality: $b^{\frac{1}{k+1}} - a^{\frac{1}{k+1}} < \frac...
-
0 days
Implication of equivalence of categories on exact sequences, Tannakian formalism
Let $F:C_1\to C_2$ be an equivalence of categories. Suppose that $C_1, C_2$ are both exact categories and $F$ sends short exact sequences (SES) in $C_1$ to SES in $C_2$. Let $G$ be the quasi-inverse of $F$.
Question: Are there any conditions we can put on $F$ that ensures that $G$ sends SES in $C_2$ to SES in $C_1$? Or what can we say about $G$ regarding SES? (Or how do you check exactness in the two examples in the motivation below?)...
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
