Consequences of comparability
نویسندگان
چکیده
Philosophical PerspectivesVolume 35, Issue 1 p. 70-98 ORIGINAL ARTICLE Consequences of comparability Cian Dorr, Corresponding Author Dorr [email protected] Email: Jacob M. Nebel [email protected] Jake Zuehl [email protected] for more papers by this authorJacob Nebel, Search authorJake Zuehl, [email protected] author First published: 31 October 2021 https://doi.org/10.1111/phpe.12157Read the full textAboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare text full-text accessPlease review our Terms and Conditions Use check box below share version article.I have read accept Wiley Online Library UseShareable LinkUse link a article with your friends colleagues. Learn more.Copy URL Share linkShare onFacebookTwitterLinked InRedditWechat Volume35, Issue1December 2021Pages RelatedInformation
منابع مشابه
Comparability of multipartite entanglement
Due to its numerous important applications[1–5] in the area of quantum information and computation, entanglement has been extensively studied in the past decade. The concept of considering entanglement as a new type of useful resource has been widely accepted. Efforts have been made to quantitatively and qualitatively measure this kind of resource in both bipartite and multipartite cases[6–8]. ...
متن کاملOn comparability of bigrassmannian permutations
Let Sn and Bn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n, and let (Sn,≤) denote the Bruhat ordering permutation poset. We study the restricted poset (Bn,≤), first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the numb...
متن کاملAutomorphism Groups of Comparability Graphs
Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension dim(X) of a comparability graph X is the dimension of any transitive orientation of X, and by k-DIM we denote the class of comparability graphs X with dim(X) ≤ k. It is known that the complements of comparability gra...
متن کاملMinimal comparability completions
We study the problem of adding edges to a given arbitrary graph so that the resulting graph is a comparability graph, called a comparability completion of the input graph. Computing a comparability completion with the minimum possible number of added edges is an NP-hard problem. Our purpose here is to add an inclusion minimal set of edges to obtain a minimal comparability completion, which mean...
متن کاملPartitioned Probe Comparability Graphs
Given a class of graphs G, a graphG is a probe graph of G if its vertices can be partitioned into a set of probes and an independent set of nonprobes such that G can be embedded into a graph of G by adding edges between certain nonprobes. If the partition of the vertices is part of the input, we call G a partitioned probe graph of G. In this paper we show that there exists a polynomial-time alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophical Perspectives
سال: 2021
ISSN: ['1520-8583', '1758-2245']
DOI: https://doi.org/10.1111/phpe.12157