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 275
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
Counting real rooted polynomials
I am interested in counting real rooted polynomials with nonnegative integer coefficients, linear term k and constant term 1. For a fixed k it is not too hard to show why there are only finitely many all them all of degree less than or equal k. There...
-
0 days
Bounding the derivative of a threshold-crossing probability for a signed compoun...
Let Nk∼Pois(μk/k!)N_k \sim \text{Pois}(\mu^k/k!)Nk∼Pois(μk/k!) independently for k=1,2,3,4k = 1,2,3,4k=1,2,3,4, and define the signed linear combination
S(μ)=1−N1+9N2−16N3+8N4.S(\mu) = 1 - N_1 + 9N_2 - 16N_3 + 8N_4.S(μ)=1−N1+9N2−16N3+8N4.Let Pacc(μ)=P(S(μ)>0)P_{\text{acc}}(\mu) = \mathbb{P}(S(\mu) > 0)Pacc(μ)=P(S(μ)>0). I am interested in bounding the derivative D=dPacc/dμD = dP_{\text... -
0 days
Does every finite direct category have filtered colimits?
I noticed that many of the "walking structure" categories (walking morphism, walking fork, walking span, etc.) have filtered colimits. I would like to generalize this result.
At first I thought that every finite category will do, but the walking idempotent is a counterexample. It has not all filtered colimits.... -
0 days
Equality of two sequences from numbers of the form $p^nq^m$
Let $p,q>1$ be multiplicatively independent positive integers. Consider the set
$$S=\{p^n q^m:n,m\in\mathbb{N}\cup\{0\}\}$$sorted in strictly increasing order: $s_1<s_2<s_3<\cdots.$ Define the adjacent ratios $r_k=\frac{s_{k+1}}{s_k},\quad k\ge 1,$ and let $(a_k)_{k\ge 1}$ be the sequence obtained by deleting repeated...
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
