m

F Nous contacter

0

Documents  De Loera, Jesus A. | enregistrements trouvés : 3

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Research talks

The classical Tverberg's theorem says that a set with sufficiently many points in $R^d$ can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is but a special case of a much more general situation. Given sufficiently many points, any tree or cycle, can also be induced by at least one partition of the point set. The proofs require a deep investigation of oriented matroids and order types.
(Joint work with Deborah Oliveros, Tommy Hogan, Dominic Yang (supported by NSF).)
The classical Tverberg's theorem says that a set with sufficiently many points in $R^d$ can always be partitioned into m parts so that the (m - 1)-simplex is the (nerve) intersection pattern of the convex hulls of the parts. Our main results demonstrate that Tverberg's theorem is but a special case of a much more general situation. Given sufficiently many points, any tree or cycle, can also be induced by at least one partition of the point set. ...

05B35 ; 52C40

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- xix; 322 p.
ISBN 978-1-611972-43-6

MOS-SIAM series on optimization

Localisation : Ouvrage RdC (DELO)

optimisation # géométrie algébrique # programmation en nombres entiers # géométrie combinatoire

90-02 ; 90C10 ; 14Q99

... Lire [+]

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

- xiii; 535 p.
ISBN 978-3-642-12970-4

Algorithms and computation in mathematics , 0025

Localisation : Ouvrage RdC (DELO)

triangulation # région de polyhèdre # configurations d'ensembles de points # volume # polytôpe secondaire # algorithme

52-02 ; 52B05 ; 52B11 ; 52B45 ; 52B55 ; 68R05

... Lire [+]

Z