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
  • English language flagLanguage: English
  • Last check:
  • 15 260

    Visitors daily
  • 54 936

    Pageviews daily
  • 6

    Google PR
  • 21 870

    Alexa rank

Mathoverflow.net news digest

  • 0 days

    Does the vanishing of a deterministic residue force a unique geometric mediation...

    Suppose we have a deterministic sequence$$R_n(s) = S_n(s) - C_n(s)$$where $S_n(s) = \sum_{k=1}^n k^{-s}$ is a discrete Dirichlet sum and $C_n(s) = \frac{n^{1-s}}{1-s}$ is its continuous analytic counterpart.
    This residue $R_n(s)$ represents the structural discrepancy between the discrete summation and the continuous flow of its integral approximation. At a zero-state $\zeta(s)=0$, this discrepancy must be perfectly resolved such that the distance vanishes...

  • 0 days

    Complexes out of Gap objects

    In Higher Algebra, Remark 1.2.2.3, Lurie notes that an object$F \in \operatorname{Gap}(\mathbb{Z},\mathcal{C})$ determines a chain complex in the homotopy category$\mathrm{h}\mathcal{C}$, with terms$$C_n \simeq F(n-1,n)[-n].$$Since the construction of...

  • 0 days

    Perfect Squares as Midpoints of Primes

    Question: Is the following statement known, provable under standard conjectures, or false?
    For every integer $n ≥ 2$, there exist primes $p < n^2$ and $q > n^2$ such that $n^2 = \frac{p+q}{2}$, i.e., $p + q = 2n^2$.
    Verification: Verified computationally up to $n=20$ (e.g., $n=2$: $p=3,q=5$; $n=5$: $p=19,q=31$; $n=10$: $p=97,q=103$). Pairs always exist within small $k$ where $p=n^2-k$, $q=n^2+k$....

  • 1 month

    A question about random walks on $ \mathbb{R}^2$

    Let $\mu$ be a probability measure on $ \mathbb{R}$ with $\mu(\{ 0\})<1$. Otherwise, no further assumptions (e.g. on the existence of moments) are imposed on $\mu$. Let $X_n$ and $Y_n$ denote two independent random walks driven by $\mu$. I am interested...

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