Publication

A result on flip-graph connectivity

Lionel Pournin
2012
Journal Articles

Abstract

A polyhedral subdivision of a d-dimensional point configuration A is k-regular if it is projected from the boundary complex of a polytope with dimension at most d+k. Call γk(A) the subgraph induced by k-regular triangulations in the flip-graph of A. Gel’fand, Kapranov, and Zelevinsky have shown that γ1(A) is connected. It is established here that γ2(A) is connected as well.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A result on flip-graph connectivity

Chat with Graph Search

Collapse-invariant properties of spaces equipped with signals or directions

The Role of Adaptivity in Source Identification with Time Queries

Atomic subgraphs and the statistical mechanics of networks