English
Related papers

Related papers: Maximal r-Diameter Sets and Solids of Constant Wid…

200 papers

For every hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. We prove that…

Metric Geometry · Mathematics 2024-02-27 Marek Lassak

A ball polyhedron is the intersection of a finite number of closed balls in $\mathbb{R}^3$ with the same radius. In this note, we study ball polyhedra in which the set of centers defining the balls have the maximum possible number of…

Metric Geometry · Mathematics 2024-08-15 Ryan Hynd

In this paper, we introduce several notions of "dimension" of a finite group, involving sizes of generating sets and certain configurations of maximal subgroups. We focus on the inequality $m(G) \leq \mathrm{MaxDim}(G)$, giving a family of…

Group Theory · Mathematics 2015-02-03 Ravi Fernando

We find the exact size of a maximal non-commuting set in unipotent uppertriangular linear group $UU_4(\mathbb{F}_q)$ in terms of a non-commuting geometric structure (Refer Definition [10]), where $\mathbb{F}_q$ is the finite field with $q$…

Number Theory · Mathematics 2017-02-08 C. P. Anil Kumar , S. K. Prajapati

We propose a novel measure of statistical depth, the metric spatial depth, for data residing in an arbitrary metric space. The measure assigns high (low) values for points located near (far away from) the bulk of the data distribution,…

Statistics Theory · Mathematics 2023-06-19 Joni Virta

The dimension of random simplicial complexes (defined as the maximal dimension among all faces) is a natural extreme value associated with the complex, and is closely related to other functionals defined by a maximum, such as the clique…

Probability · Mathematics 2025-12-19 Kinga Nagy

Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…

Combinatorics · Mathematics 2007-05-23 Nathan Linial

Huemer et al. (Discrete Mathematics, 2019) proved that for any two point sets $R$ and $B$ with $|R|=|B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total \emph{squared} Euclidean distance of the…

Computational Geometry · Computer Science 2019-11-26 Sergey Bereg , Oscar Chacón-Rivera , David Flores-Peñaloza , Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara

The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.

Number Theory · Mathematics 2014-12-17 Gregory A. Freiman

Given a compact connected set $E$ in the unit disk $\mathbb{B}^{2}$, we give a new upper bound for the conformal capacity of the condenser $(\mathbb{B}^{2}, E)$ in terms of the hyperbolic diameter $t$ of $E$. Moreover, for $t>0$, we…

Metric Geometry · Mathematics 2021-12-07 Mohamed M. S. Nasser , Oona Rainio , Matti Vuorinen

Cone spherical metrics are conformal metrics with constant curvature one and finitely many conical singularities on compact Riemann surfaces. A cone spherical metric is called irreducible if each developing map of the metric does not have…

Algebraic Geometry · Mathematics 2022-10-11 Lingguang Li , Jijian Song , Bin Xu

Motivated by modern applications like image processing and wireless sensor networks, we consider a variation of the famous Kepler Conjecture. Given any infinite set of unit balls covering the whole space, we want to know the optimal (lim…

General Mathematics · Mathematics 2007-12-20 Binhai Zhu

If $(M^n, g)$ is a closed Riemannian manifold where every unit ball has volume at most $\epsilon_n$ (a sufficiently small constant), then the $(n-1)$-dimensional Uryson width of $(M^n, g)$ is at most 1.

Differential Geometry · Mathematics 2015-04-30 Larry Guth

We consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p in R and q in B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B…

Computational Geometry · Computer Science 2019-02-25 Clemens Huemer , Pablo Pérez-Lantero , Carlos Seara , Rodrigo I. Silveira

We discuss and compare several geometric structures which imply an upper bound to the acceleration of a particle measured in its rest system. While all of them have the same implications on the motion of a point particle, they differ in…

High Energy Physics - Theory · Physics 2007-05-23 M. Toller

The main result of this article is a geometric interpretation of magnitude, a real-valued invariant of metric spaces. We introduce a Euclidean embedding of a (suitable) finite metric space $X$ such that the magnitude of $X$ can be expressed…

Metric Geometry · Mathematics 2025-10-22 Karel Devriendt

A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…

Computational Geometry · Computer Science 2017-01-26 Ioannis Z. Emiris , Ioannis Psarros

A discrete set in the $p$-dimensional Euclidian space is {\it almost periodic}, if the measure with the unite masses at points of the set is almost periodic in the weak sense. We propose to construct positive almost periodic discrete sets…

Metric Geometry · Mathematics 2010-02-02 S. Favorov , Ye. Kolbasina

A semibrick is a set of modules satisfying Schur's Lemma, and it is said to be maximal if it is not properly contained in another semibrick. For any finite dimensional algebra $\varLambda$ over an algebracally closed field $K$, we prove…

Representation Theory · Mathematics 2025-09-16 Sota Asai

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

Computational Geometry · Computer Science 2019-05-08 Mahdi Imanparast , Seyed Naser Hashemi , Ali Mohades