On Donaldson’s flow of surfaces in a hyperkähler four-manifold

We prove some basic properties of Donaldson’s flow of surfaces in a hyperkähler 4-manifold. When the initial submanifold is symplectic with respect to one Kähler form and Lagrangian with respect to another, we show that certain kinds of singularities cannot form, and we prove a convergence result under a condition related to one considered by M.-T. Wang for the mean curvature flow.     

Robust locally testable codes and products of codes

We continue the investigation of locally testable codes, i.e., error‐correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. We give two general results on local testability: First, motivated by the recently proposed notion of robust probabilistically checkable proofs, we introduce the notion of robust local testability of codes. We relate this notion to a product of codes introduced by Tanner and show a very simple composition lemma for this notion. Next, we show that codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials (which are a special case of tensor codes). Combining these two results gives us a generic construction of codes of inverse polynomial rate that are testable with poly‐logarithmically many queries. We note that these locally testable tensor codes can be obtained from any linear error correcting code with good distance. Previous results on local testability, albeit much stronger quantitatively, rely heavily on algebraic properties of the underlying codes. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

Improved bounds for sampling contingency tables

We study the problem of sampling contingency tables (nonnegative integer matrices with specified row and column sums) uniformly at random. We give an algorithm which runs in polynomial time provided that the row sums r_i and the column sums c_j satisfy r_i = Ω(n^3/2m log m), and c_j = Ω(m^3/2n log n). This algorithm is based on a reduction to continuous sampling from a convex set. The same approach was taken by Dyer, Kannan, and Mount in previous work. However, the algorithm we present is simpler and has weaker requirements on the row and column sums. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 135–146, 2002     

Area orthogonality in normed linear spaces

A new concept of orthogonality in real normed linear spaces is introduced. Typical properties of orthogonality (homogeneity, symmetry, additivity, ...) and relations between this orthogonality and other known orthogonalities (Birkhoff, Boussouis, Unitary-Boussouis and Diminnie) are studied. In particular, some characterizations of inner product spaces are obtained.     

NONLOCAL INITIAL PROBLEM FOR NONLINEAR NONAUTONOMOUS DIFFERENTIAL EQUATIONS IN A BANACH SPACE

The nonlocal initial problem for nonlinear nonautonomous evolution equati-ons in a Banach space is considered. It is assumed that the nonlinearities havethe local Lipschitz properties. The existence and uniqueness of mild solutionsare proved. Applications to integro-differential equations are discussed.The main tool in the paper is the normalizing mapping (the generalizednorm).     

The components of the Wired Spanning Forest are recurrent

 We show that a.s. all of the connected components of the Wired Spanning Forest are recurrent, proving a conjecture of Benjamini, Lyons, Peres and Schramm. Our analysis relies on a simple martingale involving the effective conductance between the endpoints of an edge in a uniform spanning tree. We believe that this martingale is of independent interest and will find further applications in the study of uniform spanning trees and forests. Received: 20 April 2001 / Revised version: 23 July 2002 / Published online: 14 November     

Name‐Based Autoconfiguration for Mobile Ad hoc Networks

In a mobile ad hoc network, difficulties exist in supporting address autoconfiguration and naming resolution due to the lack of centralized servers. This letter presents a novel approach, called name‐based autoconfiguration (NBA), which uses host names to determine IP addresses and provides address autoconfiguration and name resolution as a single protocol.     

Asymmetric hydrogenation of alkyl(vinyl)thioethers: a promising approach to α-chiral thioethers

This paper describes the enantioselective hydrogenation of vinylthioethers. We show that thioether derivatives of maleic esters can be hydrogenated with full conversion and up to 60% ee, and that α-thioether cinnamic acids can be hydrogenated in 51% ee with modest conversion.     

Node cooperation in hybrid ad hoc networks

A hybrid ad hoc network is a structure-based network that is extended using multihop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station that has no direct connection with a base station can use other mobile stations as relays. Compared with conventional (single-hop) structure-based networks, this new generation can lead to a better use of the available spectrum and to a reduction of infrastructure costs. However, these benefits would vanish if the mobile nodes did not properly cooperate and forward packets for other nodes. In this paper, we propose a charging and rewarding scheme to encourage the most fundamental operation, namely packet forwarding. We use "MAC layering" to reduce the space overhead in the packets and a stream cipher encryption mechanism to provide "implicit. authentication" of the nodes involved in the communication. We analyze the robustness of our protocols against rational and malicious attacks. We show that-using our solution-collaboration is rational for selfish nodes. We also show that our protocols thwart rational attacks and detect malicious attacks.