Let A=(a i, j ) be an n\_n 0-1 matrix. Let S be the set of permutations \_ of [n] such that a i, \_(i) =1 for i=1, 2, ..., n. Then, the permanent of A is perm(A) = def |S|. For a pair of random variables (X, Y ) (with some joint distribution) and x # support[X ], let Y x be a random variable such t
An obvious proof of Fishburn's interval order theorem
β Scribed by Kenneth P. Bogart
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 224 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
This note gives a brief proof and slight generalization of Fishburn's representation theorem for interval orders.
π SIMILAR VOLUMES
Ammon, K., An automatic proof of G~lel's incompleteness theorem (Research Note), Artificial Intelligence 61 (1993) 291-306. The SHUNYATA program contains heuristics which are related to reasoning processes of mathematicians and guide the search for a proof. For example, a heuristic applies the meth
While various techniques have been used to demonstrate the classical four squares theorem for the rational integers, the method of modular forms of two variables has been the standard way of dealing with sums of squares problems for integers in quadratic fields. The case of representations by sums o