The Cayley Trick and Triangulations of Products of Simplices

By Francisco Santos. 2003

82 citations recorded by the source corpus.

We use the Cayley Trick to study polyhedral subdivisions of the product of two simplices. For arbitrary (fixed) l ≥ 2, we show that the numbers of regular and non-regular triangulations ofl × � k grow, respectively, as k �(k) and 2 (k 2 ) . For the special case of � 2 × � k , we relate triangulations to certain class of lozenge tilings. This allows us to compute the exact number of triangu- lations up to k = 15, show that the number grows as ek 2 /2+o(k

Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/faded9071f920affbc3e47ad11dffd3e0d9d12d1

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Federico Ardila
  2. Alexander Postnikov
  3. M. Develin
  4. Bernd Sturmfels
  5. F. Santos
  6. Sara C. Billey
  7. Eric Katz
  8. Michael Joswig

In Discrete Mathematics and Combinatorics

  1. Federico Ardila
  2. Sara C. Billey
  3. M. Develin
  4. Bernd Sturmfels
  5. Alexander Postnikov
  6. F. Santos
  7. David E. Speyer
  8. Lauren K. Williams

In Electrical and Electronic Engineering

  1. Alexander Postnikov
  2. Sara C. Billey
  3. F. Santos
  4. Federico Ardila
  5. Bernd Sturmfels
  6. M. Develin
  7. Huy Tài Hà
  8. Arindam Banerjee

Citations in the corpus