Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let P and Q be simple polygons with m and n sides, respectively, in general position, where m,n≥ 3 are odd. An intersection point is a crossing between a side of P and a side of Q. Odd-sided intersection bound. There are at most mn-(m+n)+3…
Let S be the boundary of a convex polyhedron. Two source points are equivistal if their vistal trees are isomorphic and corresponding nodes represent the same facet sequences. Equivistal subdivision conjecture. The equivalence relation…
Let C be a convex body and let k≥ 3 be an integer. The decision problem C-k-COVER asks whether a given point set can be covered by homothets of C with each homothet containing at most k points; similarly, C-k-PACK asks whether a prescribed…
Let S be the boundary of a convex polyhedron, and let a shortest path γ in S have both endpoints in the interiors of facets. Its combinatorial type is the facet sequence L_γ traversed by γ. Polynomial combinatorial-type conjecture. The…
Let d be a positive integer. Let X be an even set of distinct points in R^d with minimum distance r>0, and let M be a max-sum matching of X. The closed balls induced by M are the balls having the matched pairs as diameters. Quantitative…
Let A ⊆ R^2 be finite and generic. A level-k hypertriangulation is maximal if no other hypertriangulation of the same level subdivides it, and it is maximum if no other hypertriangulation of the same level has more triangles. Maximality…
Let g(n) denote the minimum number of distinct radial orderings determined by a set of n points in strong general position in the plane. Quartic growth conjecture. g(n)=Θ(n^4). The paper proves bounds of Ω(n^3) and O(n^4), so this…
A simple polygon is a polygonal region whose boundary is a simple polygonal curve. In weak conflict-free vertex-to-vertex chromatic guarding, guards are placed at polygon vertices and a vertex is guarded when it sees a guard of a color…
Let δ be an initial curve, and let γ_0 be the shortest curve homotopic to it among curves avoiding the obstacle set P_n=( Z/n)^2. For t>0, write δ'=δ(t) for the curve obtained from δ under affine curve-shortening flow (ACSF), whenever it…
Let N be a set of terminals embedded in the Euclidean plane, and let G be any tree topology on N whose Steiner points have degree at least three. Fixed-topology bead-minimization conjecture. Finding a tree T on N with the same topology as…
Let A_1,…,A_n∈R^3 be charge locations, and let VcolonR^3∖A_1,A_2,…,A_n→R be the electrostatic potential defined in the source. An equilibrium of a restriction is a critical point of that restriction. Linear slice conjecture. The…
Let the locus generation algorithm operate on a real algebraic locus, using complex detours around ramification points and sufficiently small steps on those detours. Termination conjecture. The locus generation algorithm terminates if it…
Suppose that a median-dual region is constructed around an interior point p_j ∈ R^d, and let the generic adjacent edge be p_k - p_j. For each d-simplex T sharing this edge, let n_j^T be a normal vector associated with the (d-1)-facet of T…
Let P_n consist of n independent random points uniformly distributed in [0,1]^2. Probabilistic upper-bound conjecture. The maximum EMST-ratio of P_n is less than 2 with probability tending to 1 as n→∞. The conjecture is motivated by…
Let S be a set of n points in general position in the plane, meaning that no three points are collinear. General-position quartic lower-bound conjecture. S has at least Ω(n^4) distinct radial orderings. The proved lower bound assumes…
Let F:[-1,1]^3→R^3 be a trilinear map defining a hexahedral finite element, and let J_F(x)=det DF(x) be its Jacobian determinant. If J_F(x)>0 for every x∈∂([-1,1]^3), then J_F(x)>0 for every x∈[-1,1]^3.
Let v be a root vertex with children v_1, …, v_k, where k ≥ 2, the angles between children with respect to v are at least 60^∘, and all children have radial distance 1. Let P be the optimal bottleneck path that starts at v and visits all…
Let P and Q be two arbitrary point sets in general position with |P|=|Q|. Write CH(P) and CH(Q) for their convex hull vertex sets, and let a triangulation be a maximal set of pairwise non-intersecting segments joining pairs of points. A…