344 search results - page 8 / 69 » Some Theorems We Should Prove |
APAL
2004
13 years 7 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
APPML
2006
13 years 7 months ago
2006
Most balancing markets of electric power are organized as uniform-price auctions. In 2001, the balancing market of England and Wales switched to a pay-as-bid auction with the inte...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
JCT
2010
13 years 2 months ago
2010
Let M be a matroid representable over a (partial) field and B a matrix representable over a sub-partial field . We say that B confines M to if, whenever a -representation matrix ...
NDJFL
2010
13 years 2 months ago
2010
Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem ...