首页 > 最新文献

Order-A Journal on the Theory of Ordered Sets and Its Applications最新文献

英文 中文
On Finitely-Generated Johansson Algebras 关于有限生成Johansson代数
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-10-18 DOI: 10.1007/s11083-022-09616-4
A. Citkin
{"title":"On Finitely-Generated Johansson Algebras","authors":"A. Citkin","doi":"10.1007/s11083-022-09616-4","DOIUrl":"https://doi.org/10.1007/s11083-022-09616-4","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46655268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Number of Subuniverses, Congruences, Weak Congruences of Semilattices Defined by Trees 树定义的半格的子宇宙数、同余数、弱同余数
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-10-14 DOI: 10.1007/s11083-022-09611-9
Delbrin Ahmed, E. Horváth, Z. Németh
{"title":"The Number of Subuniverses, Congruences, Weak Congruences of Semilattices Defined by Trees","authors":"Delbrin Ahmed, E. Horváth, Z. Németh","doi":"10.1007/s11083-022-09611-9","DOIUrl":"https://doi.org/10.1007/s11083-022-09611-9","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46238908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph 超图顶点排序的helly型定理
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-09-28 DOI: 10.1007/s11083-023-09625-x
Csaba Bir'o, JenHo Lehel, G'eza T'oth
{"title":"Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph","authors":"Csaba Bir'o, JenHo Lehel, G'eza T'oth","doi":"10.1007/s11083-023-09625-x","DOIUrl":"https://doi.org/10.1007/s11083-023-09625-x","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42138430","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Symmetric Maximal Condorcet Domains 对称极大孔多塞域
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-09-24 DOI: 10.1007/s11083-022-09612-8
A. Karpov, A. Slinko
{"title":"Symmetric Maximal Condorcet Domains","authors":"A. Karpov, A. Slinko","doi":"10.1007/s11083-022-09612-8","DOIUrl":"https://doi.org/10.1007/s11083-022-09612-8","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49030225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Complementary Choice Functions 互补选择函数
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-09-14 DOI: 10.1007/s11083-023-09646-6
V. Danilov
{"title":"Complementary Choice Functions","authors":"V. Danilov","doi":"10.1007/s11083-023-09646-6","DOIUrl":"https://doi.org/10.1007/s11083-023-09646-6","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43884258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs 有限有向图的子结构序的自同构群
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-09-13 DOI: 10.1007/s11083-023-09642-w
Fanni K. Ned'enyi, 'Ad'am Kunos
{"title":"On the Automorphism Group of the Substructure Ordering of Finite Directed Graphs","authors":"Fanni K. Ned'enyi, 'Ad'am Kunos","doi":"10.1007/s11083-023-09642-w","DOIUrl":"https://doi.org/10.1007/s11083-023-09642-w","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41809186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Coincidence of the Bruhat Order and the Secondary Bruhat Order on $$mathcal {A}(n,k)$$ 布鲁哈特命令与次布鲁哈特命令的重合 $$mathcal {A}(n,k)$$
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-08-09 DOI: 10.1007/s11083-023-09627-9
Tao Zhang, Houyi Yu
{"title":"The Coincidence of the Bruhat Order and the Secondary Bruhat Order on $$mathcal {A}(n,k)$$","authors":"Tao Zhang, Houyi Yu","doi":"10.1007/s11083-023-09627-9","DOIUrl":"https://doi.org/10.1007/s11083-023-09627-9","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47291246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Controlling the C3 Super Class Linearization Algorithm for Large Hierarchies of Classes 控制C3超类线性化算法的大层次类
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-07-15 DOI: 10.1007/s11083-022-09607-5
F. Hivert, Nicolas M. Thiéry
{"title":"Controlling the C3 Super Class Linearization Algorithm for Large Hierarchies of Classes","authors":"F. Hivert, Nicolas M. Thiéry","doi":"10.1007/s11083-022-09607-5","DOIUrl":"https://doi.org/10.1007/s11083-022-09607-5","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46128120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extension of Sectional Pseudocomplementation in Posets 姿态集中分段伪互补的推广
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-07-05 DOI: 10.1007/s11083-023-09633-x
J. Cı̄rulis
{"title":"Extension of Sectional Pseudocomplementation in Posets","authors":"J. Cı̄rulis","doi":"10.1007/s11083-023-09633-x","DOIUrl":"https://doi.org/10.1007/s11083-023-09633-x","url":null,"abstract":"","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47070609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Approximation Algorithm for Random Generation of Capacities 容量随机生成的一种近似算法
IF 0.4 4区 数学 Q3 Mathematics Pub Date : 2022-06-09 DOI: 10.48550/arXiv.2206.04774
M. Grabisch, C. Labreuche, Peiqi Sun
Capacities on a finite set are sets functions vanishing on the empty set and being monotonic w.r.t. inclusion. Since the set of capacities is an order polytope, the problem of randomly generating capacities amounts to generating all linear extensions of the Boolean lattice. This problem is known to be intractable even as soon as $$n>5$$ n > 5 , therefore approximate methods have been proposed, most notably one based on Markov chains. Although quite accurate, this method is time consuming. In this paper, we propose the 2-layer approximation method, which generates a subset of linear extensions, eliminating those with very low probability. We show that our method has similar performance compared to the Markov chain but is much less time consuming.
有限集上的容量是在空集上消失的集函数,并且是单调的。由于容量集是阶多面体,因此随机生成容量的问题相当于生成布尔格的所有线性扩展。众所周知,即使$$n>5$$n>5,这个问题也很难解决,因此已经提出了近似方法,最显著的是基于马尔可夫链的方法。虽然这种方法很准确,但很耗时。在本文中,我们提出了两层近似方法,该方法生成线性扩展的子集,消除了那些概率很低的线性扩展。我们表明,与马尔可夫链相比,我们的方法具有类似的性能,但耗时要少得多。
{"title":"An Approximation Algorithm for Random Generation of Capacities","authors":"M. Grabisch, C. Labreuche, Peiqi Sun","doi":"10.48550/arXiv.2206.04774","DOIUrl":"https://doi.org/10.48550/arXiv.2206.04774","url":null,"abstract":"Capacities on a finite set are sets functions vanishing on the empty set and being monotonic w.r.t. inclusion. Since the set of capacities is an order polytope, the problem of randomly generating capacities amounts to generating all linear extensions of the Boolean lattice. This problem is known to be intractable even as soon as $$n>5$$ n > 5 , therefore approximate methods have been proposed, most notably one based on Markov chains. Although quite accurate, this method is time consuming. In this paper, we propose the 2-layer approximation method, which generates a subset of linear extensions, eliminating those with very low probability. We show that our method has similar performance compared to the Markov chain but is much less time consuming.","PeriodicalId":54667,"journal":{"name":"Order-A Journal on the Theory of Ordered Sets and Its Applications","volume":null,"pages":null},"PeriodicalIF":0.4,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49638728","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
期刊
Order-A Journal on the Theory of Ordered Sets and Its Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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