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).

  • Content verdict: Safe
  • Website availability: Live
  • Last check:
  • 15 260

    Visitors daily
  • 54 936

    Pageviews daily
  • 6

    Google PR
  • 22 670

    Alexa rank

Mathoverflow.net news digest

  • 0 days

    Eilenberg-Watts for module spectra

    The Eilenberg-Watts theorem gives an equivalence of categories between the category of cocontinuous additive functors between module categories $\mathrm{Mod}_R\xrightarrow{} \mathrm{Mod}_S$ for two unital rings $R$ and $S$ and the category ${}_{R}\mathrm...

  • 0 days

    The happy village problem

    In a brand new village of $N$ people, villagers work together daily in shifts of $S \geq 2$ people, selected uniformly at random from all possible $K$ subsets of villagers. During the shifts, all villagers involved get to know each other.
    What is the expected time taken until at least $M$ villagers mutually know each other?...

  • 0 days

    Do vector bundles of sufficiently high rank over compact metric spaces with fini...

    If $E$ is a $k$-dimensional complex vector bundle over an $n$-dimensional CW-complex $X$, such that $n\leq 2k-1$, then $E$ has a one-dimensional trivial subbundle (or equivalently, a global non-vanishing section). This is Proposition 1.1 in Chapter ...

  • 0 days

    Simplifying a combinatorial expression involving Stirling numbers and Bernoulli ...

    I hope this is a suitable MO question. As a project I've been trying to simplify down an inclusion-exclusion style combinatorial expression:
    \begin{equation}f(n) = \sum\limits_{k=1}^{\Omega(n)} \frac{(-1)^{(k+1)} H(n, k)}{k+1}\end{equation}
    where $H(n, k)$ is the number of ordered ways to express $n$ as a product of $k$ integer multipliers greater than 1. Let $n$ have the following factorization: $n=p_1^{\alpha_1}p_2^{\alpha_2}...p_T^{\alpha_T}$ and $\Omega(n)=\alpha_1 + \alpha_2 + ......

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

Excellent

Child safety

Excellent