DSpace DSpace UPC
  Pàgina principal | Llistar continguts | Cerca avançada | Com participar-hi Català   Castellano   English  


Títol: Prodsimplicial-neighborly polytopes
Autor: Matschke, Benjamin
Pfeifle, Julián
Pilaud, Vincent
Altres autors/autores: Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
Matèries: Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria::Geometria diferencial
Polytopes
Combinatorial analysis
Topological algebras
Politops
Anàlisi combinatòria
Topologia algebraica
Tipus de document: Article
Descripció: We introduce PSN polytopes whose k-skeleton is combinatorially equivalent to that of a product of r simplices. They simultaneously generalize both neighborly and neighborly cubical polytopes. We construct PSN polytopes by three different methods, the most versatile of which is an extension of Sanyal & Ziegler’s “projecting deformed products” construction to products of arbitrary simple polytopes. For general r and k, the lowest dimension we achieve is 2k+r+1. Using topological obstructions similar to those introduced by Sanyal to bound the number of vertices of Minkowski sums, we show that this dimension is minimal if we moreover require the PSN polytope to be obtained as a projection of a polytope combinatorially equivalent to the product of r simplices, when the sum of their dimensions is at least 2k.
Altres identificadors i accés: Matschke, B.; Pfeifle, J.; Pilaud, V. Prodsimplicial-neighborly polytopes. "Discrete and computational geometry", Novembre 2010, vol. Online first.
0179-5376
http://hdl.handle.net/2117/10458
10.1007/s00454-010-9311-yOnline First™
Disponible al dipòsit:E-prints UPC
Comparteix:


SFX Query

Tots els ítems dipositats a UPCommons estan protegits per drets d'autor.

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius