John Haslegrave , Alex Scott , Youri Tamitegama , Jane Tan
{"title":"三维 CAT(0) 立方体复合物的边界刚度","authors":"John Haslegrave , Alex Scott , Youri Tamitegama , Jane Tan","doi":"10.1016/j.ejc.2024.104077","DOIUrl":null,"url":null,"abstract":"<div><div>The boundary rigidity problem is a classical question from Riemannian geometry: if <span><math><mrow><mo>(</mo><mi>M</mi><mo>,</mo><mi>g</mi><mo>)</mo></mrow></math></span> is a Riemannian manifold with smooth boundary, is the geometry of <span><math><mi>M</mi></math></span> determined up to isometry by the metric <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>g</mi></mrow></msub></math></span> induced on the boundary <span><math><mrow><mi>∂</mi><mi>M</mi></mrow></math></span>? In this paper, we consider a discrete version of this problem: can we determine the combinatorial type of a finite cube complex from its boundary distances? As in the continuous case, reconstruction is not possible in general, but one expects a positive answer under suitable contractibility and non-positive curvature conditions. Indeed, in two dimensions Haslegrave gave a positive answer to this question when the complex is a finite quadrangulation of the disc with no internal vertices of degree less than 4. We prove a 3-dimensional generalisation of this result: the combinatorial type of a finite CAT(0) cube complex with an embedding in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span> can be reconstructed from its boundary distances. Additionally, we prove a direct strengthening of Haslegrave’s result: the combinatorial type of any finite 2-dimensional CAT(0) cube complex can be reconstructed from its boundary distances.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"124 ","pages":"Article 104077"},"PeriodicalIF":1.0000,"publicationDate":"2024-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Boundary rigidity of 3D CAT(0) cube complexes\",\"authors\":\"John Haslegrave , Alex Scott , Youri Tamitegama , Jane Tan\",\"doi\":\"10.1016/j.ejc.2024.104077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The boundary rigidity problem is a classical question from Riemannian geometry: if <span><math><mrow><mo>(</mo><mi>M</mi><mo>,</mo><mi>g</mi><mo>)</mo></mrow></math></span> is a Riemannian manifold with smooth boundary, is the geometry of <span><math><mi>M</mi></math></span> determined up to isometry by the metric <span><math><msub><mrow><mi>d</mi></mrow><mrow><mi>g</mi></mrow></msub></math></span> induced on the boundary <span><math><mrow><mi>∂</mi><mi>M</mi></mrow></math></span>? In this paper, we consider a discrete version of this problem: can we determine the combinatorial type of a finite cube complex from its boundary distances? As in the continuous case, reconstruction is not possible in general, but one expects a positive answer under suitable contractibility and non-positive curvature conditions. Indeed, in two dimensions Haslegrave gave a positive answer to this question when the complex is a finite quadrangulation of the disc with no internal vertices of degree less than 4. We prove a 3-dimensional generalisation of this result: the combinatorial type of a finite CAT(0) cube complex with an embedding in <span><math><msup><mrow><mi>R</mi></mrow><mrow><mn>3</mn></mrow></msup></math></span> can be reconstructed from its boundary distances. Additionally, we prove a direct strengthening of Haslegrave’s result: the combinatorial type of any finite 2-dimensional CAT(0) cube complex can be reconstructed from its boundary distances.</div></div>\",\"PeriodicalId\":50490,\"journal\":{\"name\":\"European Journal of Combinatorics\",\"volume\":\"124 \",\"pages\":\"Article 104077\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-10-01\",\"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/S0195669824001628\",\"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/S0195669824001628","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
The boundary rigidity problem is a classical question from Riemannian geometry: if is a Riemannian manifold with smooth boundary, is the geometry of determined up to isometry by the metric induced on the boundary ? In this paper, we consider a discrete version of this problem: can we determine the combinatorial type of a finite cube complex from its boundary distances? As in the continuous case, reconstruction is not possible in general, but one expects a positive answer under suitable contractibility and non-positive curvature conditions. Indeed, in two dimensions Haslegrave gave a positive answer to this question when the complex is a finite quadrangulation of the disc with no internal vertices of degree less than 4. We prove a 3-dimensional generalisation of this result: the combinatorial type of a finite CAT(0) cube complex with an embedding in can be reconstructed from its boundary distances. Additionally, we prove a direct strengthening of Haslegrave’s result: the combinatorial type of any finite 2-dimensional CAT(0) cube complex can be reconstructed from its boundary distances.
期刊介绍:
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.