On polytopes simple in edges
| dc.creator | Timorin, Vladlen | |
| dc.date | 2000-10-23 | |
| dc.date | 2001-02-13 | |
| dc.date.accessioned | 2026-07-07T04:38:10Z | |
| dc.date.available | 2026-07-07T04:38:10Z | |
| dc.description | We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's conjecture for such polytopes. | |
| dc.description | Rewritten. The first version contained fatal errors. 16 pages, to be published in Func. Anal. and Appl | |
| dc.identifier | https://arxiv.org/abs/math/0010213 | |
| dc.identifier | http://arxiv.org/abs/math/0010213 | |
| dc.identifier | Funct. Anal. Appl. 35(2001) no. 3, pp. 189-198 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60179 | |
| dc.subject | Algebraic Geometry | |
| dc.subject | Combinatorics | |
| dc.subject | 14M25 (Primary) 52B05, 14F43 (Secondary) | |
| dc.title | On polytopes simple in edges | |
| dc.type | text |