交叉比度和三角测量

IF 0.8 3区 数学 Q2 MATHEMATICS Bulletin of the London Mathematical Society Pub Date : 2024-09-17 DOI:10.1112/blms.13148
Rob Silversmith
{"title":"交叉比度和三角测量","authors":"Rob Silversmith","doi":"10.1112/blms.13148","DOIUrl":null,"url":null,"abstract":"<p>The cross-ratio degree problem counts configurations of <span></span><math>\n <semantics>\n <mi>n</mi>\n <annotation>$n$</annotation>\n </semantics></math> points on <span></span><math>\n <semantics>\n <msup>\n <mi>P</mi>\n <mn>1</mn>\n </msup>\n <annotation>$\\mathbb {P}^1$</annotation>\n </semantics></math> with <span></span><math>\n <semantics>\n <mrow>\n <mi>n</mi>\n <mo>−</mo>\n <mn>3</mn>\n </mrow>\n <annotation>$n-3$</annotation>\n </semantics></math> prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general. Interestingly, examining various special cases of the problem can yield combinatorial structures that are both diverse and rich. In this paper, we prove a simple closed formula for a class of cross-ratio degrees indexed by triangulations of an <span></span><math>\n <semantics>\n <mi>n</mi>\n <annotation>$n$</annotation>\n </semantics></math>-gon; these degrees are connected to the geometry of the real locus of <span></span><math>\n <semantics>\n <msub>\n <mi>M</mi>\n <mrow>\n <mn>0</mn>\n <mo>,</mo>\n <mi>n</mi>\n </mrow>\n </msub>\n <annotation>$M_{0,n}$</annotation>\n </semantics></math>, and to positive geometry.</p>","PeriodicalId":55298,"journal":{"name":"Bulletin of the London Mathematical Society","volume":"56 11","pages":"3518-3529"},"PeriodicalIF":0.8000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1112/blms.13148","citationCount":"0","resultStr":"{\"title\":\"Cross-ratio degrees and triangulations\",\"authors\":\"Rob Silversmith\",\"doi\":\"10.1112/blms.13148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The cross-ratio degree problem counts configurations of <span></span><math>\\n <semantics>\\n <mi>n</mi>\\n <annotation>$n$</annotation>\\n </semantics></math> points on <span></span><math>\\n <semantics>\\n <msup>\\n <mi>P</mi>\\n <mn>1</mn>\\n </msup>\\n <annotation>$\\\\mathbb {P}^1$</annotation>\\n </semantics></math> with <span></span><math>\\n <semantics>\\n <mrow>\\n <mi>n</mi>\\n <mo>−</mo>\\n <mn>3</mn>\\n </mrow>\\n <annotation>$n-3$</annotation>\\n </semantics></math> prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general. Interestingly, examining various special cases of the problem can yield combinatorial structures that are both diverse and rich. In this paper, we prove a simple closed formula for a class of cross-ratio degrees indexed by triangulations of an <span></span><math>\\n <semantics>\\n <mi>n</mi>\\n <annotation>$n$</annotation>\\n </semantics></math>-gon; these degrees are connected to the geometry of the real locus of <span></span><math>\\n <semantics>\\n <msub>\\n <mi>M</mi>\\n <mrow>\\n <mn>0</mn>\\n <mo>,</mo>\\n <mi>n</mi>\\n </mrow>\\n </msub>\\n <annotation>$M_{0,n}$</annotation>\\n </semantics></math>, and to positive geometry.</p>\",\"PeriodicalId\":55298,\"journal\":{\"name\":\"Bulletin of the London Mathematical Society\",\"volume\":\"56 11\",\"pages\":\"3518-3529\"},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2024-09-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1112/blms.13148\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the London Mathematical Society\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1112/blms.13148\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the London Mathematical Society","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1112/blms.13148","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

交叉比度问题计算 P 1 $\mathbb {P}^1$ 上 n 个 $n$ 点的配置,其中有 n - 3 个 $n-3$ 规定的交叉比。交叉比度问题出现在组合学和几何的许多角落,但它们的结构一般还不太清楚。有趣的是,研究该问题的各种特例可以得到既多样又丰富的组合结构。在本文中,我们证明了一类以 n $n$ -gon 的三角形为索引的交叉比率度的简单封闭公式;这些度与 M 0 , n $M_{0,n}$ 的实部几何以及正几何相关联。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Cross-ratio degrees and triangulations

The cross-ratio degree problem counts configurations of n $n$ points on P 1 $\mathbb {P}^1$ with n 3 $n-3$ prescribed cross-ratios. Cross-ratio degrees arise in many corners of combinatorics and geometry, but their structure is not well-understood in general. Interestingly, examining various special cases of the problem can yield combinatorial structures that are both diverse and rich. In this paper, we prove a simple closed formula for a class of cross-ratio degrees indexed by triangulations of an n $n$ -gon; these degrees are connected to the geometry of the real locus of M 0 , n $M_{0,n}$ , and to positive geometry.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.90
自引率
0.00%
发文量
198
审稿时长
4-8 weeks
期刊介绍: Published by Oxford University Press prior to January 2017: http://blms.oxfordjournals.org/
期刊最新文献
Issue Information The covariant functoriality of graph algebras Issue Information On a Galois property of fields generated by the torsion of an abelian variety Cross-ratio degrees and triangulations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1