Problems, problems, problems
From MaRDI portal
The author prepared a record of all the presentations of the two problem sessions as well as some additional material submitted in writing but not presented at the First Canadian Conference on Computational Geometry. About 20 problems plus several ones posed by Erdős are listed, and the famous collection of 50 ``poorly formulated problems of combinatorial geometry compiled in 1966 by the late Leo Moser, with some commentary on their current status is also included.
Recommendations
Cites work
- A generalization of some results in additive number theory
- A Plane Set of Measure Zero Containing Circumferences of Every Radius
- A Problem of Leo Moser About Repeated Distances on the Sphere
- A proof of an Auerbach-Banach-Mazur-Ulam theorem on convex bodies
- A survey of Sylvester's problem and its generalizations
- A Thin Set of Circles
- Boxes for curves of constant length
- Convex Regions Which Cover Arcs of Constant Length
- Distributions of positive mass, which maximize a certain generalized energy integral
- Extremal Problems of Distance Geometry Related to Energy Integrals
- FINITENESS OF THE NUMBER OF LACUNAE IN THE SPECTRUM OF THE MULTIDIMENSIONAL POLYHARMONIC OPERATOR WITH A PERIODIC POTENTIAL
- scientific article; zbMATH DE number 3137048 (Why is no real title available?)
- scientific article; zbMATH DE number 3905349 (Why is no real title available?)
- scientific article; zbMATH DE number 3941840 (Why is no real title available?)
- scientific article; zbMATH DE number 3684430 (Why is no real title available?)
- scientific article; zbMATH DE number 3491759 (Why is no real title available?)
- scientific article; zbMATH DE number 739036 (Why is no real title available?)
- scientific article; zbMATH DE number 1511595 (Why is no real title available?)
- Inequalities for Sums of Distances
- Insolvability of
- Lösung einer elementargeometrischen Frage von Fejes Tóth
- Minimal Covers for Closed Curves
- Minimum covers for arcs of constant length
- On a lattice point problem of L. Moser. I
- On a lattice point problem of L. Moser. II
- On A Problem of P. Erdos
- On Arcs that Cannot be Covered by an Open Equilateral Triangle of Side 1
- On Moser's problem of accommodating closed curves in triangles
- On packing of squares and cubes
- On the sum of distances betweenn points on a sphere
- On the sum of distances determined by a pointset
- Optimizing the Arrangement of Points on the Unit Sphere
- Sectorial Covers for Curves of Constant Length
- Shortness exponents of families of graphs
- Some geometric extremal problems
- Some packing and covering theorems
- Some Theorems on Convex Polygons
- Stability Configurations of Electrons on a Sphere
- Sums of distances between points of a sphere
- Sums of distances between points on a sphere — an application of the theory of irregularities of distribution to discrete Geometry
- Sums of Distances Between Points on a Sphere. II
- The sum of the distances to N points on a sphere
- Triangular covers for closed curves of constant length
- Évaluation de la différence entre l'aire d'une région plane convexe et le nombre des points aux coordonnées entières couverts par elle
Cited in
(27)- Problems which interest and/or annoy me
- Robust gift wrapping for the three-dimensional convex hull
- Every graph is an integral distance graph in the plane
- Stabbing convex subdivisions with \(k\)-flats
- Wetzel's sector covers unit arcs
- \(z\)-arcs in the thirty degrees sector
- Complete positivity and distance-avoiding sets
- A convex cover for closed unit curves has area at least 0.1
- Moser's shadow problem
- Placing of points into the \(5\)-dimensional unit cube
- Viterbo's conjecture as a worm problem
- Lower bound for convex hull area and universal cover problems
- Sectorial covers for unit arcs
- Still Spinning: The Moser Spindle at Sixty
- Universal convex covering problems under translations and discrete rotations
- Packing a triangle by equilateral triangles of harmonic sidelengths
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- On packing squares into a rectangle
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- On a traveling salesman problem for points in the unit cube
- Packing of non-blocking squares into the unit square
- Perfect packing by convex and concave polygons
- Recent advances in the worm problem
- Perfectly packing an equilateral triangle by equilateral triangles of sidelengths \(n^{-1/2-\epsilon }\)
- Packing isosceles right triangles of legs of harmonic lengths
- Filling the plane with squares of harmonic areas
- On the approximation of shortest escape paths
This page was built for publication: Problems, problems, problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1175791)
