Farthest-point queries with geometric and combinatorial constraints

In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the point farthest from a query line segment in O(log²n) time. Our data structure needs O(nlogn) space and preprocessing time. To the best of our knowledge no solution to this problem has been suggested yet. Second, we show how to use this data structure to obtain an output-sensitive query-based algorithm for polygonal path simplification. Both results are based on a series of data structures for fundamental farthest-point queries that can be reduced to each other.     

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     

Bipyridinophane‐containing conjugated polymers modulated with an intramolecular aromatic C?H/π interaction

Bipyridinophane–fluorene conjugated copolymers have been synthesized via Suzuki and Heck coupling reactions from 5,8‐dibromo‐2,11‐dithia[3]paracyclo[3](4,4′)‐2,2′‐bipyridinophane and suitable fluorene precursors. Poly[2,7‐(9,9‐dihexylfluorene)‐co‐alt‐5,8‐(2,11‐dithia[3]paracyclo[3](4,4′)‐2,2′‐bipyridinophane)] ( P7 ) exhibits large absorption and emission redshifts of 20 and 34 nm, respectively, with respect to its planar reference polymer Poly[2,7‐(9,9‐dihexylfluorene)‐co‐alt‐1,4‐(2,5‐dimethylbenzene)] ( P11 ), which bears the same polymer backbone as P7 . These spectral shifts originate from intramolecular aromatic C? H/π interactions, which are evidenced by ultraviolet–visible and ¹H NMR spectra as well as X‐ray single‐crystal structural analysis. However, the effect of the intramolecular aromatic C? H/π interactions on the spectral shift in poly[9,9‐dihexylfluorene‐2,7‐yleneethynylene‐co‐alt‐5,8‐(2,11‐dithia[3]paracyclo[3](4,4′)‐2,2′‐bipyridinophane)] ( P10 ) is much weaker. Most interestingly, the quenching behaviors of these two conjugated polymers are largely dependent on the polymer backbone. For example, the fluorescence of P7 is efficiently quenched by Cu²⁺, Co²⁺, Ni²⁺, Zn²⁺, Mn²⁺, and Ag⁺ ions. In contrast, only Cu²⁺, Co²⁺, and Ni²⁺ ions can partially quench the fluorescence of P10 , but much less efficiently than the fluorescence of P7 . The static Stern–Volmer quenching constants of Cu²⁺, Co²⁺, and Ni²⁺ ions toward P7 are of the order of 10⁶ M^?1, being 1300, 2500, and 37,300 times larger than those of P10 , respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 4154–4164, 2006