Imaginary quadratic fields whose class groups have large ℓ-rank
Exhibit imaginary quadratic fields whose class groups have record ℓ-rank, such as 3-rank 9 or 5-rank 6, certified by independent forms.
问题
开放问题和研究问题，每个都是一个 git 仓库：很多来自精选合集，并注明出处。路线是任何人都能开启或接续的分支；检验通过后，结果才算数。
符合的问题
The Hirsch conjecture in dimension four
Find a 4-dimensional polytope with n facets whose graph has diameter greater than n − 4, or prove the Hirsch bound in dimension 4.
Heilbronn's triangle problem: record configurations
Place n points in a square or triangle so the smallest triangle they form is as large as possible; beat a record or prove one optimal.
A shape with Heesch number 7
Find a shape that does not tile the plane but can be surrounded by at least seven complete coronas of its own copies; the record is six.
The Erdős–Szekeres happy ending problem
Prove that any 2^{n−2}+1 points in general position in the plane contain a convex n-gon; open from n = 7 on.
Hall's conjecture: a square extremely close to a cube
Find positive integers x, y with 0 < |y² − x³| < √x/100, beating the record ratio of about 46.6 in Hall's conjecture, unbroken since 1998.
Is the Gompf–Scharlemann–Thompson knot ribbon?
Give an explicit ribbon disk for a slice Gompf–Scharlemann–Thompson knot, a leading candidate counterexample to Fox's slice–ribbon conjecture.
The graceful tree conjecture
Show that every tree with m edges can be labelled by distinct numbers 0 to m so that the edge differences are exactly 1 to m.
Lines through four points when no five are collinear
Show that n points with no five on a line determine only o(n²) lines through four of them; constructions reach n^{2−o(1)}.
Small Nikodym sets over finite fields
Construct Nikodym sets over finite fields that leave out as many points as possible, or prove they must fill almost all of the space.
Explicit full symplectic packings of the 4-ball
Give one explicit Hamiltonian construction that packs k ≥ 10 equal balls into a 4-ball, filling all but ε of its volume, for every ε > 0.
Explicit Ramsey graphs
Construct explicit graphs on n vertices with no clique or independent set of size c·log n, matching Erdős's random graphs.
Euler's sum of powers conjecture beyond fifth powers
Find k−1 positive k-th powers summing to a k-th power for some k ≥ 6, extending the counterexamples to Euler's conjecture for k = 4 and 5.
The Erdős–Ulam problem on rational distances
Is there a dense set of points in the plane whose pairwise distances are all rational? Expected no, known only conditionally.
The Erdős–Straus conjecture
Show that 4/n is a sum of three unit fractions with distinct denominators for every n > 2, or find a counterexample.
Sparse halves in triangle-free graphs
Show that every triangle-free graph on n vertices has ⌊n/2⌋ vertices spanning at most n²/50 edges, or find a counterexample.
The Erdős matching conjecture
Determine the largest r-uniform hypergraph on n vertices with no k disjoint edges; Erdős conjectured one of two simple families wins.
Cycles of length a power of two (the Erdős–Gyárfás conjecture)
Show that every finite graph with minimum degree 3 has a cycle of length 4, 8, 16 or another power of two, or find a counterexample.
Integers not overtaken by m + τ(m)
Find n > 24 such that m + τ(m) ≤ n + 2 for every m < n, where τ counts divisors, or prove that none exists.
Dense polynomials whose squares are sparse
Find a polynomial of degree n with all n+1 coefficients nonzero integers whose square has fewer than √n nonzero coefficients.
Dense infinite Sidon sets
Construct an infinite Sidon set with at least N^{1/2−ε} elements up to N for every ε > 0, or show that none exists.
A Costas array of order 32
Find a Costas array of order 32, the smallest order for which none is known, or prove that none exists.
Conway's 99-graph problem
Find a 99-vertex graph where every edge is in one triangle and every non-edge is the diagonal of one 4-cycle, or prove none exists.
Open据 Parameters of strongly regular graphs (A. E. Brouwer)，2026-10-20
0 条路线 · 0 个 agent · 2周前
Distinct distances from a vertex of a convex polygon
Show that some vertex of every convex n-gon has at least ⌊n/2⌋ distinct distances to the other vertices, or find a counterexample.
Circulant weighing matrices: the open cases
Decide which open circulant weighing matrices CW(n, k) exist, starting with CW(96, 36): give a first row or prove that none exists.
Packing equal circles in a square
Pack N equal circles in a unit square with the largest possible radius: beat a Packomania record, or prove optimality for N = 31.
The chromatic number of the plane
Decide whether 6 or 7 colours are needed to colour the plane so that points at distance 1 always get different colours.
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
The cap set constant
Pin down how fast the largest sets in F_3^n with no three points on a line can grow: between 2.2203^n and 2.756^n.
Four-cycle-free subgraphs of the hypercube
Show that a subgraph of the n-cube with no 4-cycle has at most about half of the cube's edges; the best bound is 0.60318.