Decorated trees

Pierrette Cassou-Noguès, Daniel Daigle
{"title":"Decorated trees","authors":"Pierrette Cassou-Noguès, Daniel Daigle","doi":"arxiv-2409.11559","DOIUrl":null,"url":null,"abstract":"We study a class of combinatorial objects that we call ``decorated trees''.\nThese consist of vertices, arrows and edges, where each edge is decorated by\ntwo integers (one near each of its endpoints), each arrow is decorated by an\ninteger, and the decorations are required to satisfy certain conditions. The\nclass of decorated trees includes different types of trees used in algebraic\ngeometry, such as the Eisenbud and Neumann diagrams for links of singularities\nand the Neumann diagrams for links at infinity of algebraic plane curves. By\npurely combinatorial means, we recover some formulas that were previously\nunderstood to be ``topological''. In this way, we extend the generality of\nthose formulas and show that they are in fact ``combinatorial''.","PeriodicalId":501063,"journal":{"name":"arXiv - MATH - Algebraic Geometry","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Algebraic Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11559","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We study a class of combinatorial objects that we call ``decorated trees''. These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and the decorations are required to satisfy certain conditions. The class of decorated trees includes different types of trees used in algebraic geometry, such as the Eisenbud and Neumann diagrams for links of singularities and the Neumann diagrams for links at infinity of algebraic plane curves. By purely combinatorial means, we recover some formulas that were previously understood to be ``topological''. In this way, we extend the generality of those formulas and show that they are in fact ``combinatorial''.
装饰树
我们研究的是一类组合对象,我们称之为 "装饰树"。它们由顶点、箭头和边组成,其中每条边由两个整数装饰(每个端点附近各一个),每个箭头由一个整数装饰,而且这些装饰必须满足某些条件。装饰树类包括代数几何中使用的不同类型的树,如奇点链接的艾森布德图和诺伊曼图,以及代数平面曲线无穷远链接的诺伊曼图。通过纯粹的组合手段,我们恢复了一些以前被理解为 "拓扑 "的公式。通过这种方式,我们扩展了这些公式的一般性,并证明它们实际上是 "组合式的"。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信