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
  • 20 095

    Alexa rank

Mathoverflow.net news digest

  • 0 days

    Set theory for multisets

    Often, one deals with objects that can have a certain multiplicity attached to it. In the case of graphs, the multiplicity of vertices connected by an edge gives rise to a hypergraph. Now, in set theory, the axioms are usually stated for sets, and not...

  • 1 month

    On two conditions on a bilinear form over $\mathbf{F}_2$

    Let $k$ be a positive integer. Let $n$ and $m$ be positive integers with $m$ roughly $\log_2 n$, let $V$ be an $n$-dimensional vector space over $\mathbb{F}_2$, let $W$ be an $m$-dimensional vector space over $\mathbb{F}_2$, where $\mathbb{F}_2$ is the...

  • 9 years

    Copylefted introduction to topology

    Is there a topology textbook with a copyleft license?
    Postscript.
    You may check my notes now.

  • 0 days

    Some unique coefficients with row sums equal $2$

    Let
    $T(n,k)$ be an unique coefficients (represented as an irregular triangle) such that for all $n,m \in \mathbb{N}$ we have $$ \sum\limits_{k=1}^{2n} 2^{k-1} \binom{m+k}{k} T(n,k) = (m+2)^{2n} - 1. $$
    I conjecture that $$ \sum\limits_{k=1}^{2n} T(n,k) = 2. $$ More precisely, I conjecture that $$ \sum\limits_{k=3}^{2n} T(n,k) = 0. $$ I also conjecture that $T(n,k)$ are integer coefficients for all $1 \leqslant k \leqslant 2n$ iff $2n$ is a power of...

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