115 problems
For each dimension , determine whether the following implication holds: for every domain , every , and eve…
Let and satisfy the assumptions in Section 1. Suppose also that is convex and . An optimal-density uniqueness and convexity conjecture asserts that the…
Let be a convex domain, and let be an optimal configuration in . Write for its complement and let denote the t…
Hadamard-type conjecture. (i) is concave if and only if for every . (ii) is -concave, meaning that has convex level s…
Maximum colourful simplicial depth conjecture. The maximum colourful simplicial depth of any point in the interior of the core is
Let and let be finite sets of points in , with … for . A common convex-hull transversal is a -flat meeting ea…
A quadrisecant of a knot is a straight line that intersects the knot four times. It is alternating when the four intersection points alternate between the north and south poles of…
Consider a domain bounded by a connected smooth hypersurface . Suppose that the second fundamental form of is non-degenerate at every point and has…
Let be a contact Hamiltonian manifold, where is a contact Hamiltonian structure on . A heterodimensional cycle is a pair of heteroclinic trajectories…
Let be a uniformly convex domain in with , and let denote its Gutt--Hutchings capacities. The first capacity is the syst…
Let be positive integers and let be a non-negative integer. A Tverberg -partition of a finite point set is a partition into parts whose convex hulls have a c…
Let be a surface, and let denote the space of convex curve functionals on , equipped with the product topology inherited from its values on the cu…
Liu–Pego's local convexity conjecture. Every such map must necessarily be locally convex in .
Let be a Banach space, let be fixed, and let . For -point sets , define as the smallest radius factor suc…
Let be a real-zero (RZ) polynomial with . For a polynomial , write for its rigidly convex set. Generalized…
Jeffs's conjecture. If has up to four maximal codewords, then is convex if and only if has no local obstructions and no wheels.
Peeling-sequence growth conjecture. The minimal number of peeling sequences of points in is at least
Subset-normal bound conjecture. The inequalities above hold.
Facet-normal characterization conjecture. The normals of are the same as either those of a simplex bounded by an extra facet, or those of a pyramid that is not a simplex.
Let satisfy . For a partition , let denote the probability that is a Radon partition among independent ra…
A finite set of points in the plane is in general position if no three points are collinear, and it is in convex position if its points are the vertices of a convex polygon. Let…
Unfairness-witness conjecture. The following inequality holds:
Let be integers, and let be positive integers. Suppose that are sets of points in satisfying … for each . Tverbe…
Identity-assignment partition conjecture. There exists a positive integer such that the plane can be partitioned, using lines, into not necessarily connected regions…
Grünbaum's conjecture. For every , there exists a pair of orthogonal lines that partitions into four pieces whose areas, in clockwise order, are…