利用伪相似点的最大值对重构非极值牌的秩和有序集的秩

Order Pub Date : 2024-09-11 DOI:10.1007/s11083-024-09684-8

Bernd S. W. Schröder

{"title":"利用伪相似点的最大值对重构非极值牌的秩和有序集的秩","authors":"Bernd S. W. Schröder","doi":"10.1007/s11083-024-09684-8","DOIUrl":null,"url":null,"abstract":"For every ordered set, we reconstruct the deck obtained by removal of the elements of rank r that are neither minimal nor maximal. Consequently, we also reconstruct the deck obtained by removal of the extremal, that is, minimal or maximal, elements. Finally, we reconstruct the ordered sets with a minmax pair of pseudo-similar points.","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points\",\"authors\":\"Bernd S. W. Schröder\",\"doi\":\"10.1007/s11083-024-09684-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For every ordered set, we reconstruct the deck obtained by removal of the elements of rank r that are neither minimal nor maximal. Consequently, we also reconstruct the deck obtained by removal of the extremal, that is, minimal or maximal, elements. Finally, we reconstruct the ordered sets with a minmax pair of pseudo-similar points.\",\"PeriodicalId\":501237,\"journal\":{\"name\":\"Order\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Order\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s11083-024-09684-8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Order","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11083-024-09684-8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

对于每一个有序集合，我们都会重构去除既不是最小元素也不是最大元素的 r 级元素后得到的牌组。因此，我们还要重建去除极值元素（即最小或最大元素）后得到的牌组。最后，我们用一对最小最大的伪相似点重建有序集合。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points

For every ordered set, we reconstruct the deck obtained by removal of the elements of rank r that are neither minimal nor maximal. Consequently, we also reconstruct the deck obtained by removal of the extremal, that is, minimal or maximal, elements. Finally, we reconstruct the ordered sets with a minmax pair of pseudo-similar points.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Order

自引率

0.00%

发文量