Movatterモバイル変換
[0]
ホーム
URL:
画像なし
夜間モード
Fair Division
Sperner's lemma
. A discrete version of Brouwer's fixed-point theorem.
Sharing a necklace
with N types of beads, in just N cuts.
Related articles:
Calculus
.
Fair
dice
.
Optimization
.
Graph Theory
.
Combinatorics
.
Convex geometry
.
Differential forms
.
Social-choice theory
.
Analytical mechanics
.
Differential equations
.
Matrices and determinants
.
Related Links (Outside this Site)
Francis Su's Fair Division Page
.
"
An Envy-Free Cake Division Protocol
"
Steven J. Brams
&
Alan D. Taylor
The American Mathematical Monthly
,
102
, 1, pp. 9-18, (January 1995).
Fair Division
(2017-02-24)
The number of full-color simplices in a
Sperner triangulation
is odd.
Sperner's lemma
is the
combinatorial
equivalent of
Brouwer
's
fixed-point theorem
.
(2017-02-24)
With N different types of
beads
, N cuts are enough for a fair split.
[8]
ページ先頭
©2009-2025
Movatter.jp
