New Bounds for Geometric Packing and Coloring via Harmonic Analysis and Optimization

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Unknown venue

• Publication date

  2009-12-01

• Fields of study

  Mathematics

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Geometric Algorithms and Combinatorial Optimization

  2016influential reference
• AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY

  2011influential reference
• Discrete and Continuous: Two Sides of the Same?

  2010cited by this paper
• Distances in positive density sets in Rd

  2009cited by this paper
• UvA-DARE ( Digital Academic Repository ) Approximating the stability number and the chromatic number of a graph via semidefinite programming

  2008cited by this paper
• Fourier analysis, linear programming, and densities of distance avoiding sets in R^n

  2008cited by this paper
• Measurable Sets With Excluded Distances

  2007cited by this paper
• Research problems in discrete geometry

  2005influential reference
• Combinatorial optimization. Polyhedra and efficiency.

  2003influential reference
• A 15-colouring of 3-space omitting distance one

  2002influential reference
• On the space chromatic number

  2002cited by this paper
• On the chromatic number of a space

  2000cited by this paper
• GRAPHICAL DISCOVERY OF A NEW IDENTITY FOR JACOBI POLYNOMIALS

  1998cited by this paper
• GEOMETRY OF SETS AND MEASURES IN EUCLIDEAN SPACES FRACTALS AND RECTIFIABILITY

  1996cited by this paper
• Special Functions

  1996influential reference
• Interior-point polynomial algorithms in convex programming

  1994cited by this paper
• Asymptotic Monotonicity of the Relative Extrema of Jacobi Polynomials

  1994cited by this paper
• The Sandwich Theorem

  1993cited by this paper
• Harmonic Function Theory

  1992cited by this paper
• Ergodic Theory and Configurations in Sets of Positive Density

  1990influential reference
• Bounds on the measurable chromatic number of Rn

  1989influential reference
• A szemerédi type theorem for sets of positive density inRk

  1986cited by this paper
• Theory of linear and integer programming

  1986influential reference
• The Realization of small Distances in Plane Sets of Positive Measure

  1986influential reference
• Plane Sets with Positive Density at Infinity Contain all Large Distances

  1986cited by this paper
• Some combinatorial, geometric and set theoretic problems in measure theory

  1984cited by this paper
• Measurable chromatic number of geometric graphs and sets without some distances in euclidean space

  1984influential reference
• Intersection theorems with geometric consequences

  1981influential reference
• The Realization of Distances in Measurable Subsets Covering Rn

  1981cited by this paper
• ON THE CHROMATIC NUMBER OF GEOMETRIC GRAPHS

  1980influential reference
• On the Shannon capacity of a graph

  1979influential reference
• A comparison of the Delsarte and Lovász bounds

  1979influential reference
• The Lovasz bound and some generalizations

  1978influential reference
• On orthogonal polynomials

  1975influential reference
• Positive definite functions on spheres

  1973influential reference
• An elementary proof of Steinhaus’s theorem

  1972cited by this paper
• The realization of distances within sets in Euclidean space

  1972influential reference
• Reducibility Among Combinatorial Problems

  1972cited by this paper
• Methods of Modern Mathematical Physics. I: Functional Analysis

  1972cited by this paper
• L'integration dans les groupes topologiques et ses applications

  1951cited by this paper
• A colour problem for infinite graphs and a problem in the theory of relations

  1951cited by this paper
• Hilbert Distances and Positive Definite Functions

  1941cited by this paper
• Metric spaces and completely monotone functions

  1938influential reference
• Theory of Error-correcting Codes

  year unknowncited by this paper
• A SZEMERI DI TYPE THEOREM FOR SETS OF POSITIVE DENSITY IN R k

  year unknowncited by this paper

• Optimization hierarchies for distance-avoiding sets in compact spaces

  2023cites this paper
• On the integrality gap of the maximum-cut semidefinite programming relaxation in fixed dimension

  2018cites this paper
• Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane

  2018cites this paper
• Complete positivity and distance-avoiding sets

  2018cites this paper
• Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane

  2017cites this paper
• Spherical sets avoiding a prescribed set of angles

  2015cites this paper
• PhD subject: infinite graphs and mathematical programming

  2015cites this paper
• The Density of Sets Avoiding Distance 1 in Euclidean Space

  2015cites this paper
• Optimization over polynomials: Selected topics

  2014cites this paper
• The Density of Sets Avoiding Distance 1 in Euclidean Space

  2014cites this paper
• Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality

  2013cites this paper
• Grothendieck Inequalities, Nonlocal Games and Optimization

  2011cites this paper
• Grothendieck inequalities , nonlocal games and optimization

  2011cites this paper
• UvA-DARE ( Digital Academic Repository ) Grothendieck inequalities , nonlocal games and optimization

  2011cites this paper
• Invariant Semidefinite Programs

  2010cites this paper