Coboundaries of irreducible markov operators onC(K)

LetK be a compact Hausdorff space, and letT be an irreducible Markov operator onC(K). We show that ifgεC(K) satisfies sup _N ‖Σ _j ^=0N T ^j g‖<∞, then (and only then) there existsfεC(K) with (I − T)f=g. Generalizing the result to irreducible Markov operator representations of certain semi-groups, we obtain that bounded cocycles are (continuous) coboundaries. For minimal semi-group actions inC(K), no restriction on the semi-group is needed.     

Some Fixed-Point Results for the Dynamic Assignment Problem

In previous work the authors consider the dynamic assignment problem, which involves solving sequences of assignment problems over time in the presence of uncertain information about the future. The algorithm proposed by the authors provides generally high-quality but non-optimal solutions. In this work, though, the authors prove that if the optimal solution to a dynamic assignment problem in one of two problem classes is unique, then the optimal solution is a fixed point under the algorithm.     

Avoider-Enforcer games

Let p and q be positive integers and let H be any hypergraph. In a (p,q,H) Avoider-Enforcer game two players, called Avoider and Enforcer, take turns selecting previously unclaimed vertices of H. Avoider selects p vertices per move and Enforcer selects q vertices per move. Avoider loses if he claims all the vertices of some hyperedge of H; otherwise Enforcer loses. We prove a sufficient condition for Avoider to win the (p,q,H) game. We then use this condition to show that Enforcer can win the (1,q) perfect matching game on K2n for every q?cn/logn for an appropriate constant c, and the (1,q) Hamilton cycle game on Kn for every q?cnloglogloglogn/lognlogloglogn for an appropriate constant c. We also determine exactly those values of q for which Enforcer can win the (1,q) connectivity game on Kn. This result is quite surprising as it substantially differs from its Maker-Breaker analog. Our method extends easily to improve a result of Lu [X. Lu, A note on biased and non-biased games, Discrete Appl. Math. 60 (1995) 285-291], regarding forcing an opponent to pack many pairwise edge disjoint spanning trees in his graph.     

A Modified Szilard Engine: Measurement, Information, and Maxwell's Demon

Using an isolated measurement process, we calculate the effect measurement has on entropy for the multi-cylinder Szilard engine. We find that the system of cylinders possesses an entropy associated with cylinder total energy states, and that it records information transferred at measurement. Contrary to other's results, we find that the apparatus loses entropy due to measurement. The Second Law of Thermodynamics may be preserved if Maxwell's demon gains entropy moving the engine partition.