Maximizing the Sum of the Distances between Four Points on the Unit Hemisphere

01/03/2022
by   Zhenbing Zeng, et al.
0

In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular neighborhood of the local maximum point in the feasible set, which size is explicitly determined, and proved that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the rest part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube the conjecture can be verified by estimating the objective function with exact numerical computation.

READ FULL TEXT
research
04/06/2022

Visualizing Multidimensional Linear Programming Problems

The article proposes an n-dimensional mathematical model of the visual r...
research
07/03/2018

Variable neighborhood search for partitioning sparse biological networks into the maximum edge-weighted k-plexes

In a network, a k-plex represents a subset of n vertices where the degre...
research
06/10/2021

VaLiPro: Linear Programming Validator for Cluster Computing Systems

The article presents and evaluates a scalable algorithm for validating s...
research
06/16/2017

Breaking the 3/2 barrier for unit distances in three dimensions

We prove that every set of n points in R^3 spans O(n^295/197+ϵ) unit dis...
research
03/19/2023

Intersecting balls induced by a geometric graph II

For a graph whose vertices are points in ℝ^d, consider the closed balls ...
research
01/28/2019

Globally Optimal Registration based on Fast Branch and Bound

The problem of planar registration consists in finding the transformatio...
research
11/15/2017

The landscape of the spiked tensor model

We consider the problem of estimating a large rank-one tensor u^⊗ k∈( R...

Please sign up or login with your details

Forgot password? Click here to reset