Research Problems in Discrete Geometry

DOI10.1007/0-387-29929-7MaRDI QIDQ3156762zbMATH OpenOpenAlexFDO

Authors W. O. J. Moser, János Pach, Peter Brass

Publication date 11 January 2005

Full work available at URL http://www.math.nyu.edu/~pach/research_problems.html

Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Recommendations

Problems in Discrete Geometry
scientific article; zbMATH DE number 3453507
scientific article; zbMATH DE number 480238
Some numerical problems in discrete geometry
Discrete and computational geometry
scientific article; zbMATH DE number 1013961
Discrete geometry
scientific article; zbMATH DE number 1421267
Extremal problems in discrete geometry

Cited in

(only showing first 100 items - show all)

Improved upper bounds on the reflexivity of point sets
Isoperimetric polygons of maximum width
On edges crossing few other edges in simple topological complete graphs
Circumscribed polygons of small area
Simple polygons of maximum perimeter contained in a unit disk
Integral point sets over \(\mathbb Z_n^m\)
On the packing of fourteen congruent spheres in a cube
New results on lower bounds for the number of \((\leq k)\)-facets
Integral point sets in higher dimensional affine spaces over finite fields
Extremal problems on triangle areas in two and three dimensions
More on an Erdős-Szekeres-type problem for interior points
On polygons enclosing point sets. II
Blocking numbers and fixing numbers of convex bodies
Increasing the minimum distance of a set of points
Computing the volume is difficult
Repeated distances in space
The complexity of cutting complexes
Unsolved problems in geometry
Covering the boundary of a convex body with its smaller homothetic copies
A note on three Moser's problems and two Paulhus' lemmas
Euclidean graph distance matrices of generalizations of the star graph
On the chromatic numbers of rational spaces
Elementary geometry on the integer lattice
Tilings with noncongruent triangles
A shape evolution model under affine transformations
Proof of László Fejes Tóth's zone conjecture
On Hamiltonian alternating cycles and paths
Colored spanning graphs for set visualization
On sets defining few ordinary circles
Point sets with small integer coordinates and no large convex polygons
Covering lattice points by subspaces and counting point-hyperplane incidences
On the number of points with pairwise integral distances on a circle
On lattice coverings by simplices
Homotheties and incidences
Sparse locally-jammed disk packings
Large simplices determined by finite point sets
Determining all universal tilers
Chromatic numbers of spaces with forbidden monochromatic triangles
Large convex holes in random point sets
On the degenerate crossing number
Distance graphs with large chromatic number and without large cliques
On the number of order types in integer grids of small size
A solution of the Erdős-Ulam problem on rational distance sets assuming the Bombieri-Lang conjecture
Moments of the maximal number of empty simplices of a random point set
Trapezoids and deltoids in wide planar point sets
Covering functionals of convex polytopes
On Wegner's inequality for axis-parallel rectangles
Triangle areas in line arrangements
On a relation between packing and covering densities of convex bodies
On grids in point-line arrangements in the plane
On the minimum number of ordinary conics
Partition bounded sets into sets having smaller diameters
Unit distance graphs and algebraic integers
Shortest closed curve to inspect a sphere
Techniques and results on approximation algorithms for packing circles
Kissing numbers for balls with varying radii
Piercing all translates of a set of axis-parallel rectangles
Improved bounds for Hadwiger's covering problem via thin-shell estimates
The density of fan-planar graphs
Online unit clustering and unit covering in higher dimensions
On a conjecture of Kelly on (1, 3)-representation of Sylvester-Gallai designs
Parallel packing of triangles with squares
A Sylvester-Gallai theorem for cubic curves
Covering functionals of convex polytopes with few vertices
Nondegenerate spheres in four dimensions
On large equilateral point-sets in normed spaces
On a Frankl-Wilson theorem
Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
Tropical combinatorial Nullstellensatz and sparse polynomials
Efficient packings of unit squares in a large square
On sets of \(n\) points in general position that determine lines that can be pierced by \(n\) points
Beck's theorem for plane curves
Hirzebruch-type inequalities viewed as tools in combinatorics
Packing 13 circles in an equilateral triangle
On the upper bound on the average distance from the Fermat-Weber center of a convex body
On Borsuk's conjecture for two-distance sets
On packing \(\mathbb R^3\) with thin tori
On invariant line arrangements
Empty monochromatic simplices
Multiple coverings with closed polygons
A quantitative variant of the multi-colored Motzkin-Rabin theorem
One problem on geometric Ramsey numbers
Enumeration of irreducible contact graphs on the sphere
Pessimal packing shapes
Seven mutually touching infinite cylinders
Zero-one law for random distance graphs with vertices in \(\{-1,0,1\}^n\)
On parallel packing and covering of squares and cubes
An extremal problem for integer sparse recovery
A positive fraction mutually avoiding sets theorem
A superlinear lower bound on the number of 5-holes
A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space
A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles
Clique numbers of random subgraphs of some distance graphs
Proper coloring of geometric hypergraphs
Covering a ball by smaller balls
Counterexamples to Borsuk's conjecture with large girth
Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
On large subgraphs of a distance graph which have small chromatic number

This page was built for publication: Research Problems in Discrete Geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156762)