If the Euclidean plane is partitioned into convex sets each of area A in such a way that each contains exactly one vertex of a unit square lattice and this vertex is in its interior, is it true that A must be at least 1/2?(adsbygoogle = window.adsbygoogle || []).push({});

If not what is the greatest lower bound for A?

The analogous greatest lower bounds for E_{n}obviously form a non increasing sequence (ordered by n). What is the value for E_{n}?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# I Partitions of Euclidean space, cubic lattice, convex sets

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Partitions Euclidean space | Date |
---|---|

I What Lobachevski meant by parallel lines | Feb 7, 2018 |

A Examples of fractal structure in prime partition numbers? | Jan 4, 2018 |

On partitioning an even number into a pair of (relative) primes | Oct 18, 2014 |

What is a partition | Jul 23, 2014 |

D-domain partition definition | Jun 28, 2013 |

**Physics Forums - The Fusion of Science and Community**