发布求助
文献互助 智能选刊 最新文献

Order最新文献

筛选
英文 中文
Uniform Residuated Lattices and their Cauchy Completions 均匀残差网格及其考奇补全
Order Pub Date : 2024-09-19 DOI: 10.1007/s11083-024-09683-9
Feihu Xiao, Xiaofei Yang, Xiaolong Xin, Yingcang Ma
{"title":"Uniform Residuated Lattices and their Cauchy Completions","authors":"Feihu Xiao, Xiaofei Yang, Xiaolong Xin, Yingcang Ma","doi":"10.1007/s11083-024-09683-9","DOIUrl":"https://doi.org/10.1007/s11083-024-09683-9","url":null,"abstract":"<p>Distance function defined by Chang is an important tool for describing closeness and constructing topologies and uniformities on MV-algebras. Unfortunately, this function on residuated lattices is not good enough as on MV-algebras since it is not compatible with operations on residuated lattices. Based on this fact, the axioms of similarity operators and semi-norms are introduced on residuated lattices. By using the above two tools, uniformities and topologies are induced, respectively. Residuated lattices equipped with these uniformities (topologies) are proved to be uniform (topological) residuated lattices. Finally, two kinds of sequential completions for these uniformities are given and they are isomorphic.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257760","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Partition Rank and Partition Lattices 分区等级和分区网格
Order Pub Date : 2024-09-18 DOI: 10.1007/s11083-024-09685-7
Mohamed Omar
{"title":"Partition Rank and Partition Lattices","authors":"Mohamed Omar","doi":"10.1007/s11083-024-09685-7","DOIUrl":"https://doi.org/10.1007/s11083-024-09685-7","url":null,"abstract":"<p>We introduce a universal approach for applying the partition rank method, an extension of Tao’s slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund’s distinctness indicator to what we call a <i>partition indicator</i>. The advantages of partition indicators are two-fold: they diagonalize tensors that are constant when specified sets of variables are equal, and even in more general settings they can often substantially reduce the partition rank as compared to when a distinctness indicator is applied. The key to our discoveries is integrating the partition rank method with Möbius inversion on the lattice of partitions of a finite set. Through this we unify disparate applications of the partition rank method in the literature. We then use our theory to address a finite field analogue of a question of Erdős, thereby generalizing results of Hart and Iosevich and independently Shparlinski. Furthermore we generalize work of Pach et al. on bounding sizes of sets avoiding right triangles to bounding sizes of sets avoiding right <i>k</i>-configurations.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142257758","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reconstruction of the Ranks of the Nonextremal Cards and of Ordered Sets with a Minmax Pair of Pseudo-Similar Points 利用伪相似点的最大值对重构非极值牌的秩和有序集的秩
Order Pub Date : 2024-09-11 DOI: 10.1007/s11083-024-09684-8
Bernd S. W. Schröder
{"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":"https://doi.org/10.1007/s11083-024-09684-8","url":null,"abstract":"<p>For every ordered set, we reconstruct the deck obtained by removal of the elements of rank <i>r</i> 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.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142195417","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Contextuality and Unsharp Quantum Logic 论上下文和非清晰量子逻辑
Order Pub Date : 2024-09-05 DOI: 10.1007/s11083-024-09681-x
Davide Fazio, Raffaele Mascella
{"title":"On Contextuality and Unsharp Quantum Logic","authors":"Davide Fazio, Raffaele Mascella","doi":"10.1007/s11083-024-09681-x","DOIUrl":"https://doi.org/10.1007/s11083-024-09681-x","url":null,"abstract":"<p>In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are “pastings” of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely paraothomodular lattices whose order determines, and it is fully determined by, the order of their maximal Kleene sub-algebras. It will turn out that the (spectral) paraorthomodular lattice of effects over a separable Hilbert space can be considered as a prominent example of such. Therefore, it arguably provides an algebraic/order theoretical rendering of complementarity phenomena between <i>unsharp</i> observables. A number of examples, properties and characterization theorems for structures we deal with will be outlined. For example, we prove a forbidden configuration theorem and we investigate the notion of commutativity for modular pseudo-Kleene lattices, examples of which are (spectral) paraorthomodular lattices of effects over <i>finite-dimensional</i> Hilbert spaces.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142195419","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of Quantum B-algebras over Posets 构建 Posets 上的量子 B 矩阵
Order Pub Date : 2024-09-02 DOI: 10.1007/s11083-024-09682-w
Shengwei Han, Xin Wang, Congcong Wang
{"title":"Construction of Quantum B-algebras over Posets","authors":"Shengwei Han, Xin Wang, Congcong Wang","doi":"10.1007/s11083-024-09682-w","DOIUrl":"https://doi.org/10.1007/s11083-024-09682-w","url":null,"abstract":"<p>In order to provide a unified semantics for non-commutative algebraic logic, based on posets, Rump and Yang introduced the concept of quantum <i>B</i>-algebras. In this paper, we mainly consider the construction of quantum <i>B</i>-algebras over posets. We prove that a finite poset can support a quantum <i>B</i>-algebra if and only if its every connected component has a greatest element. However, such a result for infinite posets is not necessarily true. Under certain conditions, some interesting results for a poset to support quantum <i>B</i>-algebra are provided.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142195420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Category of $$omega $$ -Effect Algebras: Tensor Product and $$omega $$ -Completion $$omega $$ -效应代数范畴：张量积和 $$omega $$ -完成
Order Pub Date : 2024-08-30 DOI: 10.1007/s11083-024-09680-y
Dominik Lachman
{"title":"The Category of $$omega $$ -Effect Algebras: Tensor Product and $$omega $$ -Completion","authors":"Dominik Lachman","doi":"10.1007/s11083-024-09680-y","DOIUrl":"https://doi.org/10.1007/s11083-024-09680-y","url":null,"abstract":"<p>Effect algebras are certain ordered structures that serve as a general framework for studying the algebraic semantics of quantum logic. We study effect algebras which obtain suprema of countable monotone sequences – so-called <span>(omega )</span>-effect algebras. This assumption is necessary to capture basic (non-discrete) probabilistic concepts. We establish a free <span>(omega )</span>-completion of effect algebras (i.e., a left adjoint to the functor that forgets the existence of <span>(omega )</span>-suprema) and the existence of a tensor product in the category of <span>(omega )</span>-effect algebras. These results are obtained by means of so-called test spaces. Test spaces form a category that contains effect algebras as a reflective subcategory, but provides more space for constructions.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142195421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Forbidden Subposets in the Cycle Poset 循环 Poset 中的禁止子集
Order Pub Date : 2024-08-26 DOI: 10.1007/s11083-024-09673-x
Aysan Behnia, Gholam Hossein Fath-Tabar, Gyula O. H. Katona
{"title":"Forbidden Subposets in the Cycle Poset","authors":"Aysan Behnia, Gholam Hossein Fath-Tabar, Gyula O. H. Katona","doi":"10.1007/s11083-024-09673-x","DOIUrl":"https://doi.org/10.1007/s11083-024-09673-x","url":null,"abstract":"<p>The cycle poset consists of the intervals of the cyclic permutation of the elements <b>1, 2, ...</b>, <i>n</i>, ordered by inclusion. Suppose that <b><i>F</i></b> is a set of such intervals, none of them is a less than <b><i>s</i></b> others. The maximum size of <b><i>F</i></b> is determined under this condition. It is also shown that if the largest size of a set in this poset without containing a small subposet <b><i>P</i></b> is known, it solves the same problem, up to an additive constant, in the grid poset consisting of the pairs <span>((i,j) (1le i,jle n))</span> and ordered coordinate-wise.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142195424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Characterization of Order Structures Avoiding Three-term Arithmetic Progressions 避免三期算术级数的阶次结构特征
Order Pub Date : 2024-08-02 DOI: 10.1007/s11083-024-09677-7
Minoru Hirose, Shingo Saito
{"title":"Characterization of Order Structures Avoiding Three-term Arithmetic Progressions","authors":"Minoru Hirose, Shingo Saito","doi":"10.1007/s11083-024-09677-7","DOIUrl":"https://doi.org/10.1007/s11083-024-09677-7","url":null,"abstract":"<p>It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting ordered set cannot be order isomorphic to the set of all nonnegative integers or the set of all integers with the standard order. In this paper, we completely characterize order structures of chaotic orders on the set of all nonnegative integers, as well as on the set of all integers and on the set of all rational numbers.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141882100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Combinatorial Results on Barcode Lattices 条形码网格的组合结果
Order Pub Date : 2024-07-30 DOI: 10.1007/s11083-024-09670-0
Alex Bouquet, Andrés R. Vindas-Meléndez
{"title":"Combinatorial Results on Barcode Lattices","authors":"Alex Bouquet, Andrés R. Vindas-Meléndez","doi":"10.1007/s11083-024-09670-0","DOIUrl":"https://doi.org/10.1007/s11083-024-09670-0","url":null,"abstract":"<p>A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial invariants on the space of barcodes. A partial order can be defined on these multipermutations, resulting in a class of posets known as combinatorial barcode lattices. In this paper, we provide a number of equivalent definitions for the combinatorial barcode lattice, show that its Möbius function is a restriction of the Möbius function of the symmetric group under the weak Bruhat order, and show its ground set is the Jordan-Hölder set of a labeled poset. Furthermore, we obtain formulas for the number of join-irreducible elements, the rank-generating function, and the number of maximal chains of combinatorial barcode lattices. Lastly, we make connections between intervals in the combinatorial barcode lattice and certain classes of matchings.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monotone-Cevian and Finitely Separable Lattices 单旋涡和有限可分网格
Order Pub Date : 2024-07-30 DOI: 10.1007/s11083-024-09678-6
Miroslav Ploščica, Friedrich Wehrung
{"title":"Monotone-Cevian and Finitely Separable Lattices","authors":"Miroslav Ploščica, Friedrich Wehrung","doi":"10.1007/s11083-024-09678-6","DOIUrl":"https://doi.org/10.1007/s11083-024-09678-6","url":null,"abstract":"<p>A distributive lattice with zero is <i>completely normal</i> if its prime ideals form a root system under set inclusion. Every such lattice admits a binary operation <span>((x,y)mapsto xmathbin {smallsetminus }y)</span> satisfying the rules <span>(xle yvee (xmathbin {smallsetminus }y))</span> and <span>((xmathbin {smallsetminus }y)wedge (ymathbin {smallsetminus }x)=0)</span> — in short a <i>deviation</i>. In this paper we study the following additional properties of deviations: <i>monotone</i> (i.e., isotone in <i>x</i> and antitone in <i>y</i>) and <i>Cevian</i> (i.e., <span>(xmathbin {smallsetminus }zle (xmathbin {smallsetminus }y)vee (ymathbin {smallsetminus }z))</span>). We relate those matters to <i>finite separability</i> as defined by Freese and Nation. We prove that every finitely separable completely normal lattice has a monotone deviation. We pay special attention to lattices of principal <span>(ell )</span>-ideals of Abelian <span>(ell )</span>-groups (which are always completely normal). We prove that for free Abelian <span>(ell )</span>-groups (and also free <span>(Bbbk )</span>-vector lattices) those lattices admit monotone Cevian deviations. On the other hand, we construct an Archimedean <span>(ell )</span>-group with strong unit, of cardinality <span>(aleph _1)</span>, whose principal <span>(ell )</span>-ideal lattice does not have a monotone deviation.</p>","PeriodicalId":501237,"journal":{"name":"Order","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141867344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信