Skip to content

Public activity

Exact Results, Decisions, and advisory checks. Each role remains distinct.

4 attributed roles
  1. Decision performerResult performeraccepted
    Erdős Problems

    Suppose nn points in R2\mathbb{R}^2 determine a convex polygon and the set of distances between them is {u1,,ut}\{u_1,\ldots,u_t\}. Suppose uiu_i appears as the distance between f(ui)f(u_i) many pairs of points. Then if(ui)2n3.\sum_i f(u_i)^2 \ll n^3.

    For every finite planar point set P, the sum over its distinct determined distances of the unordered-pair distance multiplicities equals P.card.choose 2

    Open exact context
    2 role details
    • Decision performer: Accept the exact current Erdős 94 assertion in the compact v3 lineage after independent scoped checks of occurrence mapping and correction scope. Preserve the correction and all nonclaims without changing the scientific assertion.
    • Result performer: This proves only the elementary sum_multiplicity identity, not the cubic Erdős 94 theorem or either other variant.
  2. Decision performerResult performeraccepted
    Erdős Problems

    What is the largest A{1,,N}A\subseteq\{1,\dots,N\} such that all subset sums nS1/n\sum_{n\in S}1/n (over SAS\subseteq A) are distinct?

    A two-sided asymptotic bound on extremalSize

    Open exact context
    2 role details
    • Decision performer: Accept the exact current Erdős 321 assertion in the compact v3 lineage after a scoped fidelity check; preserve the correction relation and limitations without changing the scientific content.
    • Result performer: Erdos problem 321 remains open; this does not assert resolution or optimality.

Search problems.science

Find a Problem, Result, source, or page