{"title":"具有 d+4 个面的紧凑双曲 Coxeter d 多面体的近似分类及相关维度边界","authors":"Amanda Burcroff","doi":"10.1016/j.ejc.2024.103957","DOIUrl":null,"url":null,"abstract":"<div><p>We complete the classification of compact hyperbolic Coxeter <span><math><mi>d</mi></math></span>-polytopes with <span><math><mrow><mi>d</mi><mo>+</mo><mn>4</mn></mrow></math></span> facets for <span><math><mrow><mi>d</mi><mo>=</mo><mn>4</mn></mrow></math></span> and 5. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is <span><math><mrow><mi>d</mi><mo>=</mo><mn>6</mn></mrow></math></span>. We derive a new method for generating the combinatorial types of these polytopes via the classification of point set order types. In dimensions 4 and 5, there are 348 and 51 polytopes, respectively, yielding many new examples for further study (also discovered independently by Ma and Zheng).</p><p>We furthermore provide new upper bounds on the dimension <span><math><mi>d</mi></math></span> of compact hyperbolic Coxeter polytopes with <span><math><mrow><mi>d</mi><mo>+</mo><mi>k</mi></mrow></math></span> facets for <span><math><mrow><mi>k</mi><mo>≤</mo><mn>10</mn></mrow></math></span>. It was shown by Vinberg in 1985 that for any <span><math><mi>k</mi></math></span>, we have <span><math><mrow><mi>d</mi><mo>≤</mo><mn>29</mn></mrow></math></span>, and no better bounds have previously been published for <span><math><mrow><mi>k</mi><mo>≥</mo><mn>5</mn></mrow></math></span>. As a consequence of our bounds, we prove that a compact hyperbolic Coxeter 29-polytope has at least 40 facets.</p></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Near classification of compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds\",\"authors\":\"Amanda Burcroff\",\"doi\":\"10.1016/j.ejc.2024.103957\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We complete the classification of compact hyperbolic Coxeter <span><math><mi>d</mi></math></span>-polytopes with <span><math><mrow><mi>d</mi><mo>+</mo><mn>4</mn></mrow></math></span> facets for <span><math><mrow><mi>d</mi><mo>=</mo><mn>4</mn></mrow></math></span> and 5. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is <span><math><mrow><mi>d</mi><mo>=</mo><mn>6</mn></mrow></math></span>. We derive a new method for generating the combinatorial types of these polytopes via the classification of point set order types. In dimensions 4 and 5, there are 348 and 51 polytopes, respectively, yielding many new examples for further study (also discovered independently by Ma and Zheng).</p><p>We furthermore provide new upper bounds on the dimension <span><math><mi>d</mi></math></span> of compact hyperbolic Coxeter polytopes with <span><math><mrow><mi>d</mi><mo>+</mo><mi>k</mi></mrow></math></span> facets for <span><math><mrow><mi>k</mi><mo>≤</mo><mn>10</mn></mrow></math></span>. It was shown by Vinberg in 1985 that for any <span><math><mi>k</mi></math></span>, we have <span><math><mrow><mi>d</mi><mo>≤</mo><mn>29</mn></mrow></math></span>, and no better bounds have previously been published for <span><math><mrow><mi>k</mi><mo>≥</mo><mn>5</mn></mrow></math></span>. As a consequence of our bounds, we prove that a compact hyperbolic Coxeter 29-polytope has at least 40 facets.</p></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"European Journal of Combinatorics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0195669824000428\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669824000428","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
Near classification of compact hyperbolic Coxeter d-polytopes with d+4 facets and related dimension bounds
We complete the classification of compact hyperbolic Coxeter -polytopes with facets for and 5. By previous work of Felikson and Tumarkin, the only remaining dimension where new polytopes may arise is . We derive a new method for generating the combinatorial types of these polytopes via the classification of point set order types. In dimensions 4 and 5, there are 348 and 51 polytopes, respectively, yielding many new examples for further study (also discovered independently by Ma and Zheng).
We furthermore provide new upper bounds on the dimension of compact hyperbolic Coxeter polytopes with facets for . It was shown by Vinberg in 1985 that for any , we have , and no better bounds have previously been published for . As a consequence of our bounds, we prove that a compact hyperbolic Coxeter 29-polytope has at least 40 facets.
期刊介绍:
The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.