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.     

Comments concerning the HPLC separation of acrolein from other C3 carbonyl compounds as 2,4-dinitrophenylhydrazones: A proposal for improvement

The separation of the toxicologically important aldehyde acrolein from other carbonyl compounds by high performance liquid chromatography after derivatization to 2,4-dinitrophenylhydrazones is critically discussed on the basis of a selection of published methods. A method is proposed whereby the compounds acrolein, acetone, and propanal may be reproducibly separated to baseline by a reversed phase HPLC procedure employing a ternary mixture of methanol, water, and acetonitrile as mobile phase.     

Trace norm estimates for products of integral operators and diffusion semigroups

We give trace norm estimates for products of integral operators and for diffusion semigroups. These are applied to differences of heat semigroups. A natural example of an integral operator with finite trace which is not trace class is given.     

Strong asymptotics in Lagrange interpolation with equidistant nodes

In this paper we prove three conjectures of Revers on Lagrange interpolation for f_λ(t)=|t|^λ,λ>0, at equidistant nodes. In particular, we describe the rate of divergence of the Lagrange interpolants L_N( f_λ,t) for 0<|t|<1, and discuss their convergence at t=0. We also establish an asymptotic relation for max_|t|1| |t|^λ−L_N( f_λ,t)|. The proofs are based on strong asymptotics for |t|^λ−L_N( f_λ,t), 0|t|<1.     

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.