Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's Lemma

04/10/2023
∙
by   Jason Vander Woude, et al.
∙
0
∙

A partition 𝒫 of ℝ^d is called a (k,ε)-secluded partition if, for every p⃗∈ℝ^d, the ball B_∞(ε, p⃗) intersects at most k members of 𝒫. A goal in designing such secluded partitions is to minimize k while making ε as large as possible. This partition problem has connections to a diverse range of topics, including deterministic rounding schemes, pseudodeterminism, replicability, as well as Sperner/KKM-type results. In this work, we establish near-optimal relationships between k and ε. We show that, for any bounded measure partitions and for any d≥ 1, it must be that k≥(1+2ε)^d. Thus, when k=k(d) is restricted to poly(d), it follows that ε=ε(d)∈ O(ln d/d). This bound is tight up to log factors, as it is known that there exist secluded partitions with k(d)=d+1 and ε(d)=1/2d. We also provide new constructions of secluded partitions that work for a broad spectrum of k(d) and ε(d) parameters. Specifically, we prove that, for any f:ℕ→ℕ, there is a secluded partition with k(d)=(f(d)+1)^⌈d/f(d)⌉ and ε(d)=1/2f(d). These new partitions are optimal up to O(log d) factors for various choices of k(d) and ε(d). Based on the lower bound result, we establish a new neighborhood version of Sperner's lemma over hypercubes, which is of independent interest. In addition, we prove a no-free-lunch theorem about the limitations of rounding schemes in the context of pseudodeterministic/replicable algorithms.

READ FULL TEXT

page 15

page 21

page 24

page 29

page 41

research
∙ 11/04/2022

Geometry of Rounding

Rounding has proven to be a fundamental tool in theoretical computer sci...
research
∙ 07/02/2021

Near-optimal Algorithms for Explainable k-Medians and k-Means

We consider the problem of explainable k-medians and k-means introduced ...
research
∙ 02/28/2023

Heuristic Modularity Maximization Algorithms for Community Detection Rarely Return an Optimal Partition or Anything Similar

Community detection is a fundamental problem in computational sciences w...
research
∙ 07/30/2021

Near-Optimal Spanners for General Graphs in (Nearly) Linear Time

Let G = (V,E,w) be a weighted undirected graph on |V| = n vertices and |...
research
∙ 01/22/2020

Iterated Type Partitions

This paper deals with the complexity of some natural graph problems when...
research
∙ 09/07/2020

Passwords: Divided they Stand, United they Fall

Today, offline attacks are one of the most severe threats to password se...
research
∙ 09/09/2021

Exponential bases for partitions of intervals

For a partition of [0,1] into intervals I_1,…,I_n we prove the existence...

Please sign up or login with your details

Forgot password? Click here to reset