受迪弗朗西斯科行列式启发的二十顶点配置行列式评估

IF 0.6 4区 数学 Q4 COMPUTER SCIENCE, THEORY & METHODS Journal of Symbolic Computation Pub Date : 2024-07-03 DOI:10.1016/j.jsc.2024.102352
{"title":"受迪弗朗西斯科行列式启发的二十顶点配置行列式评估","authors":"","doi":"10.1016/j.jsc.2024.102352","DOIUrl":null,"url":null,"abstract":"<div><p>In his work on the twenty vertex model, <span><span>Di Francesco (2021)</span></span> found a determinant formula for the number of configurations in a specific such model, and he conjectured a closed form product formula for the evaluation of this determinant. We prove this conjecture here. Moreover, we actually generalize this determinant evaluation to a one-parameter family of determinant evaluations, and we present many more determinant evaluations of similar type — some proved, some left open as conjectures.</p></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"127 ","pages":"Article 102352"},"PeriodicalIF":0.6000,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Determinant evaluations inspired by Di Francesco's determinant for twenty-vertex configurations\",\"authors\":\"\",\"doi\":\"10.1016/j.jsc.2024.102352\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In his work on the twenty vertex model, <span><span>Di Francesco (2021)</span></span> found a determinant formula for the number of configurations in a specific such model, and he conjectured a closed form product formula for the evaluation of this determinant. We prove this conjecture here. Moreover, we actually generalize this determinant evaluation to a one-parameter family of determinant evaluations, and we present many more determinant evaluations of similar type — some proved, some left open as conjectures.</p></div>\",\"PeriodicalId\":50031,\"journal\":{\"name\":\"Journal of Symbolic Computation\",\"volume\":\"127 \",\"pages\":\"Article 102352\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Symbolic Computation\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0747717124000567\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124000567","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

在他关于二十顶点模型的研究中,他发现了一个关于特定此类模型中配置数的行列式公式,并猜想了一个用于评估该行列式的封闭式乘积公式。我们在此证明了这一猜想。此外,我们实际上将这个行列式求值推广到了行列式求值的单参数族,并提出了更多类似类型的行列式求值--有些已经证明,有些则作为猜想悬而未决。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Determinant evaluations inspired by Di Francesco's determinant for twenty-vertex configurations

In his work on the twenty vertex model, Di Francesco (2021) found a determinant formula for the number of configurations in a specific such model, and he conjectured a closed form product formula for the evaluation of this determinant. We prove this conjecture here. Moreover, we actually generalize this determinant evaluation to a one-parameter family of determinant evaluations, and we present many more determinant evaluations of similar type — some proved, some left open as conjectures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Symbolic Computation
Journal of Symbolic Computation 工程技术-计算机:理论方法
CiteScore
2.10
自引率
14.30%
发文量
75
审稿时长
142 days
期刊介绍: An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects. It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.
期刊最新文献
Computing component groups of stabilizers of nilpotent orbit representatives Editorial Board Computing the homology of universal covers via effective homology and discrete vector fields Local dual spaces and primary decomposition On the existence and convergence of formal power series solutions of nonlinear Mahler equations
×
引用
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