A point in a -polytope is the barycenter of points in its -faces
MG Dobbins - Inventiones mathematicae, 2015 - Springer
Using equivariant topology, we prove that it is always possible to find nn points in the d d-
dimensional faces of a nd nd-dimensional convex polytope PP so that their center of mass is …
dimensional faces of a nd nd-dimensional convex polytope PP so that their center of mass is …
Barycenters of points that are constrained to a polytope skeleton
PVM Blagojević, F Frick, GM Ziegler - arXiv preprint arXiv:1411.4417, 2014 - arxiv.org
arXiv:1411.4417v2 [math.MG] 13 Nov 2015 Page 1 arXiv:1411.4417v2 [math.MG] 13 Nov 2015
Barycenters of points that are constrained to a polytope skeleton PAVLE VM BLAGOJEVI C ∗ …
Barycenters of points that are constrained to a polytope skeleton PAVLE VM BLAGOJEVI C ∗ …
Barycenters of points in polytope skeleta
MG Dobbins, F Frick - arXiv preprint arXiv:1809.01613, 2018 - arxiv.org
The first author showed that for a given point $ p $ in an $ nk $-polytope $ P $ there are $ n $
points in the $ k $-faces of $ P $, whose barycenter is $ p $. We show that we can increase …
points in the $ k $-faces of $ P $, whose barycenter is $ p $. We show that we can increase …
[PDF][PDF] Combinatorial restrictions on cell complexes
F Frick - 2015 - depositonce.tu-berlin.de
We develop the constraint method for Tverberg-type results and give numerous applications
of it, reproving and strengthening several Tverberg-type results via a combinatorial reduction …
of it, reproving and strengthening several Tverberg-type results via a combinatorial reduction …
[HTML][HTML] Assigning weights to minimize the covering radius in the plane
Given a set P of n points in the plane and a multiset W of k weights with k≤ n, we assign
each weight in W to a distinct point in P to minimize the maximum weighted distance from …
each weight in W to a distinct point in P to minimize the maximum weighted distance from …
[PDF][PDF] 境界上の重みの釣合せ
ルイス・バルバ， ルードルフ・フライシャー， 河村彰星… - 数理解析研究所講究 …, 2014 - core.ac.uk
概要原点を含む任意の多角形の周上に対踪点, すなわち原点について対称な二点が存在すること
は比較的たやすい. 本稿ではその拡張を三つ考え, 次のことを示す.(1) 原点を含む多角形 …
は比較的たやすい. 本稿ではその拡張を三つ考え, 次のことを示す.(1) 原点を含む多角形 …
[PDF][PDF] 境界上の重みの釣合せ(計算理論とアルゴリズムの新潮流)
鄭地園， 河村彰星， 岡本吉央， 唐淵… - 数理解析研究所 …, 2014 - repository.kulib.kyoto-u.ac.jp
概要原点を含む任意の多角形の周上に対踪点, すなわち原点について対称な二点が存在すること
は比較的たやすい. 本稿ではその拡張を三つ考え, 次のことを示す.(1) 原点を含む多角形 …
は比較的たやすい. 本稿ではその拡張を三つ考え, 次のことを示す.(1) 原点を含む多角形 …