整数分区网格中的箭头关系

IF 3.2 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE International Journal of Approximate Reasoning Pub Date : 2024-06-27 DOI:10.1016/j.ijar.2024.109244
Asma'a Almazaydeh , Mike Behrisch , Edith Vargas-García , Andreas Wachtel
{"title":"整数分区网格中的箭头关系","authors":"Asma'a Almazaydeh ,&nbsp;Mike Behrisch ,&nbsp;Edith Vargas-García ,&nbsp;Andreas Wachtel","doi":"10.1016/j.ijar.2024.109244","DOIUrl":null,"url":null,"abstract":"<div><p>We give a complete characterisation of the single and double arrow relations of the standard context <span><math><mi>K</mi><mo>(</mo><msub><mrow><mi>L</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math></span> of the lattice <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> of partitions of any positive integer <em>n</em> under the dominance order, thereby addressing an open question of Ganter, 2020/2022.</p></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"172 ","pages":"Article 109244"},"PeriodicalIF":3.2000,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0888613X24001312/pdfft?md5=e1fa6c029a424860650dab1c3c697da8&pid=1-s2.0-S0888613X24001312-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Arrow relations in lattices of integer partitions\",\"authors\":\"Asma'a Almazaydeh ,&nbsp;Mike Behrisch ,&nbsp;Edith Vargas-García ,&nbsp;Andreas Wachtel\",\"doi\":\"10.1016/j.ijar.2024.109244\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We give a complete characterisation of the single and double arrow relations of the standard context <span><math><mi>K</mi><mo>(</mo><msub><mrow><mi>L</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math></span> of the lattice <span><math><msub><mrow><mi>L</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> of partitions of any positive integer <em>n</em> under the dominance order, thereby addressing an open question of Ganter, 2020/2022.</p></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"172 \",\"pages\":\"Article 109244\"},\"PeriodicalIF\":3.2000,\"publicationDate\":\"2024-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0888613X24001312/pdfft?md5=e1fa6c029a424860650dab1c3c697da8&pid=1-s2.0-S0888613X24001312-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Approximate Reasoning\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0888613X24001312\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X24001312","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

我们给出了任意正整数 n 的分格 Ln 的标准上下文 K(Ln) 在支配阶下的单箭头和双箭头关系的完整特征,从而解决了甘特 2020/2022 年的一个未决问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Arrow relations in lattices of integer partitions

We give a complete characterisation of the single and double arrow relations of the standard context K(Ln) of the lattice Ln of partitions of any positive integer n under the dominance order, thereby addressing an open question of Ganter, 2020/2022.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning 工程技术-计算机:人工智能
CiteScore
6.90
自引率
12.80%
发文量
170
审稿时长
67 days
期刊介绍: The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest. Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning. Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.
期刊最新文献
Cautious classifier ensembles for set-valued decision-making Robust Bayesian causal estimation for causal inference in medical diagnosis Existence of optimal strategies in bimatrix game and applications An approach to calculate conceptual distance across multi-granularity based on three-way partial order structure Incremental attribute reduction with α,β-level intuitionistic fuzzy sets
×
引用
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