How Many Stemmata with Root Degree k?

Armin Hoenen, Steffen Eger, Ralf Gehrke
{"title":"How Many Stemmata with Root Degree k?","authors":"Armin Hoenen, Steffen Eger, Ralf Gehrke","doi":"10.18653/v1/W17-3402","DOIUrl":null,"url":null,"abstract":"We are investigating parts of the mathematical foundations of stemmatology, the science reconstructing the copying history of manuscripts. After Joseph Bédier in 1928 got suspicious about large amounts of root bifurcations he found in reconstructed stemmata, Paul Maas replied in 1937 using a mathematical argument that the proportion of root bifurcating stemmata among all possible stemmata is so large that one should not become suspicious to find them abundant. While Maas’ argument was based on one example with a tradition of three surviving manuscripts, we show in this paper that for the whole class of trees corresponding to Maasian reconstructed stemmata and likewise for the class of trees corresponding to complete historical manuscript genealogies, root bifurcations are apriori the most expectable root degree type. We do this by providing a combinatorial formula for the numbers of possible so-called Greg trees according to their root degree (Flight, 1990). Additionally, for complete historical manuscript trees (regardless of loss), which coincide mathematically with rooted labeled trees, we provide formulas for root degrees and derive the asymptotic degree distribution. We find that root bifurcations are extremely numerous in both kinds of trees. Therefore, while previously other studies have shown that root bifurcations are expectable for true stemmata, we enhance this finding to all three philologically relevant types of trees discussed in breadth until today.","PeriodicalId":133680,"journal":{"name":"Mathematics of Language","volume":"444 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematics of Language","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18653/v1/W17-3402","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

We are investigating parts of the mathematical foundations of stemmatology, the science reconstructing the copying history of manuscripts. After Joseph Bédier in 1928 got suspicious about large amounts of root bifurcations he found in reconstructed stemmata, Paul Maas replied in 1937 using a mathematical argument that the proportion of root bifurcating stemmata among all possible stemmata is so large that one should not become suspicious to find them abundant. While Maas’ argument was based on one example with a tradition of three surviving manuscripts, we show in this paper that for the whole class of trees corresponding to Maasian reconstructed stemmata and likewise for the class of trees corresponding to complete historical manuscript genealogies, root bifurcations are apriori the most expectable root degree type. We do this by providing a combinatorial formula for the numbers of possible so-called Greg trees according to their root degree (Flight, 1990). Additionally, for complete historical manuscript trees (regardless of loss), which coincide mathematically with rooted labeled trees, we provide formulas for root degrees and derive the asymptotic degree distribution. We find that root bifurcations are extremely numerous in both kinds of trees. Therefore, while previously other studies have shown that root bifurcations are expectable for true stemmata, we enhance this finding to all three philologically relevant types of trees discussed in breadth until today.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
根度为k的茎有多少个?
我们正在研究系统学的部分数学基础,这是一门重建手稿复制历史的科学。1928年,约瑟夫·巴萨迪耶(Joseph bsamdier)对他在重建的茎干中发现的大量根分叉产生了怀疑。1937年,保罗·马斯(Paul Maas)用一个数学论据回答说,在所有可能的茎干中,根分叉的茎干所占的比例如此之大,以至于人们不应该对发现它们大量存在而产生怀疑。虽然Maas的论点是基于一个具有三份现存手稿传统的例子,但我们在本文中表明,对于与Maasian重建的stemmata相对应的整个树类,以及与完整的历史手稿谱系相对应的树类,根分叉是先验的最可预期的根度类型。我们通过提供一个组合公式,根据它们的根度提供可能的所谓Greg树的数量(Flight, 1990)。此外,对于与有根标记树在数学上重合的完整历史手稿树(不计损失),我们提供了根度的公式,并推导了渐近度分布。我们发现两种树的根分叉都非常多。因此,虽然以前的其他研究表明,根分叉是可预期的真正的茎,我们加强了这一发现,所有三种语言学相关类型的树讨论宽度到今天。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
(Re)introducing Regular Graph Languages Extracting Forbidden Factors from Regular Stringsets How Many Stemmata with Root Degree k? On the Logical Complexity of Autosegmental Representations A Proof-Theoretic Semantics for Transitive Verbs with an Implicit Object
×
引用
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