ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 387-402 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; correlation ; universal correlation ; Graham, Yao, and Yao inequality ; xyz inequality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Posets $$A,{\text{ }}B \subseteq X{\text{ x }}X$$ are said to be correlated with respect to another poset R on X (we write A↑ R B) if P(R∪A) P(R∪B)≤P(R∪A∪B) P(R). Here P(S) is the probability that a randomly chosen bijection from X to the totally ordered set with |X| elements is a linear extension of S. We study triples (A, B, R) such that A ↑ R B holds for all extensions S of R (we write A $$\begin{array}{*{20}c} \uparrow \\ \uparrow \\ \end{array}$$ R B). Two well-known correlation inequalities, the xyz inequality and an inequality of Graham, Yao, and Yao, can be considered as giving cases when this relation holds. We show when the Graham, Yao, and Yao inequality holds strictly. Our main result is a classification of all R such that (a, b) $$\begin{array}{*{20}c} \uparrow \\ \uparrow \\ \end{array}$$ R (c, d) holds, where a, b, c, d are elements of X.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Order 5 (1989), S. 369-380 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; semiorder ; 1/3–2/3 conjecture ; partially ordered set
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A well-known conjecture of Fredman is that, for every finite partially ordered set (X, 〈) which is not a chain, there is a pair of elements x, y such that P(x〈y), the proportion of linear extensions of (X, 〈) with x below y, lies between 1/3 and 2/3. In this paper, we prove the conjecture in the special case when (X, 〈) is a semiorder. A property we call 2-separation appears to be crucial, and we classify all locally finite 2-separated posets of bounded width.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Order 2 (1985), S. 129-144 
    ISSN: 1572-9273
    Keywords: 06A10 ; Poset ; linear extension ; correlation ; universal correlation ; Winkler's Theorem ; universal negative correlation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Posets A, B⫇X×X, with X finite, are said to be universally correlated (A↑B) if, for all posets R over X, (i.e., all posets R⫇Y×Y with X⫇Y), we have P(R∪A) P(R∪B)≤P(R∪A∪B) P(R). Here P(R∪A), for instance, is the probability that a randomly chosen bijection from Y to the totally ordered set with |Y| elements is a linear extension of R∪A. We show that A↑B iff, for all posets R over X, P(R∪A) P(R∪B)≤P(R∪A∪B) P(R∪(A∩B)). Winkler proved a theorem giving a necessary and sufficient condition for A↑B. We suggest an alteration to his proof, and give another condition equivalent to A↑B. Daykin defined the pair (A, B) to be universally negatively correlated (A B) if, for all posets R over X, P(R∪A) P(R∪B)≥P(R∪A∪B) P(R∪(A∩B)). He suggested a condition for A↓B. We give a counterexample to that conjecture, and establish the correct condition. We write A↓B if, for all posets R over X, P(R∪A) P(R∪B)≥P(R∪A∪B) P(R). We give a necessary and sufficient condition for A↓B. We also give constructive techniques for listing all pairs (A, B) satisfying each of the relations A↑B, A↓B, and A↓B.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...