Related papers: Gravitational allocation for uniform points on the…
How to distribute a set of points uniformly on a spherical surface is a very old problem that still lacks a definite answer. In this work, we introduce a physical measure of uniformity based on the distribution of distances between points,…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
In this paper we propose algorithms for allocating $n$ sequential balls into $n$ bins that are interconnected as a $d$-regular $n$-vertex graph $G$, where $d\ge3$ can be any integer.Let $l$ be a given positive integer. In each round $t$,…
We consider the problem of partitioning an undirected graph (representing a social network) over $n$ nodes and max degree $\Delta$ into $k$ equally sized parts. Each node in the graph, representing an agent, derives utility proportional to…
Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…
We prove existence of equal area partitions of the unit sphere via optimal transport methods, accompanied by diameter bounds written in terms of Monge--Kantorovich distances. This can be used to obtain bounds on the expectation of the…
We present a scalable algorithm for the individually fair ($p$, $k$)-clustering problem introduced by Jung et al. and Mahabadi et al. Given $n$ points $P$ in a metric space, let $\delta(x)$ for $x\in P$ be the radius of the smallest ball…
Given a set of $m$ agents and a set of $n$ items, where agent $A$ has utility $u_{A,i}$ for item $i$, our goal is to allocate items to agents to maximize fairness. Specifically, the utility of an agent is the sum of its utilities for items…
In this paper, we prove two theorems concerning the sums of squared distances between points on a unit $n$-sphere that generalize two facts previously known about the case where the points are the vertices of a regular polygon. The first…
In this paper, we mainly consider the problem of spherical distribution of 5 points, that is, how to configure 5 points on a sphere such that the mutual distance sum attains the maximum. It is conjectured that the sum of distances is…
Given a set $P$ of $n$ points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum number of lines needed to separate $n$ points, picked randomly…
Many approximation algorithms and heuristic algorithms to find a fair clustering have emerged. In this paper we define a new and natural variant of fair clustering problem and design a polynomial time algorithm to compute an optimal fair…
We prove the following three statements: 1) Let $(A, \bar A)$ be a partition of the spherical surface $S^n$ into two measurable sets. Let $st_A$ and $st_{\bar A}$ be their measure density functions of distance. Then $|st_A - st_{\bar A}|$…
Various solutions of the kinetic equation for the equilibrium of a gravitating sphere of uniform density with a quadratic gravitational potential and a linear dependence of gravitational force on radius are examined. New analytic solutions…
Let's have $n$ points in the space such that the maximum distance between any of them is $a$. We prove that there exists a sphere of radius $r \leq a \frac{\sqrt(6)}{4}$ that contains in its interior or on its surface all these points.…
How should we place $n$ great circles on a sphere to minimize the furthest distance between a point on the sphere and its nearest great circle? Fejes T\'oth conjectured that the optimum is attained by placing $n$ circles evenly spaced all…
Our goal is to identify the type and number of static equilibrium points of solids arising from fine, equidistant $n$-discretrizations of smooth, convex surfaces. We assume uniform gravity and a frictionless, horizontal, planar support. We…
In [3], algorithms to compute the density of the distance to a random variable uniformly distributed in (a) a ball, (b) a disk, (c) a line segment, or (d) a polygone were introduced. For case (d), the algorithm, based on Green's theorem,…
In this paper, we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time. The players may have general heterogeneous valuations over the resource. It is known that the exact…
The shape of a number field $K$ of degree $n$ is defined as the equivalence class of the lattice of integers with respect to linear operations that are composites of rotations, reflections, and positive scalar dilations. The shape is a…