Synthesis of 2-substituted indoles by palladium-catalyzed heteroannulation with Pd-NaY zeolite catalysts

Various 2-substituted indoles were prepared by heteroannulation of o-iodoanilines and terminal alkynes in a one-pot reaction with a Pd(II)-NaY zeolite catalyst. The product formation largely depended on the solvent, base, and reaction temperature. The recycled catalyst showed good reusability in the heteroannulation reaction.     

KrF激光诱导BrC2F4Br+C2H4反应

激光诱导化学合成是一有兴趣的课题。不久前已报导了红外激光诱导调聚反应的结果。由于红外激光的加热特性,在许多情况下导致选择性与量子产率的矛盾。因紫外光反应的低温特性,有可能获得较高的选择性。但普通光源是宽带光源,对一个以平方断链为主的链反应,过强的吸收不利于链长的提高,而弱吸收又使反应速度太慢。为此,激光光源是满足最佳吸收的合宜光源。在使用了昂贵的激光光源后,经济上的合理性主要取决于链长     

High photosensitivity in cis-polyphenylacetylene films irradiated with 60Co γ-ray

This paper reports that ⁶⁰Co γ-ray irradiation can convert cis-polyphenylacetylene (cis-PPA) films prepared with rare-earth coordination catalysts to highly photosensitive materials. The dependence of the photosensitivity on irradiation dose, preparation methods, and microstructure of the PPA films has been investigated by means of a potential discharge technique. The photosensitivity was enhanced with increasing irradiation dose. The critical dose to produce a light response was 5 × 10³ Gy. The maximum surface potential discharge rate was 618 V/s, and the dark decay was approximately 2 V/s for cis-PPA films irradiated with ⁶⁰Co γ-ray (dose: 2 × 10⁵ Gy). The cis-transoidal-PPA and an electrophotographic photoreceptor device incorporating cis-PPA showed a higher irradiation effect. The structure and properties of ⁶⁰Co γ-ray irradiated rare-earth PPA films are similar to the unirradiated films.     

FFT-based algorithms for the string matching with mismatches problem

The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method.     

Hamiltonian N2‐locally connected claw‐free graphs

A graph G is N₂‐locally connected if for every vertex ν in G, the edges not incident with ν but having at least one end adjacent to ν in G induce a connected graph. In 1990, Ryjá?ek conjectured that every 3‐connected N₂‐locally connected claw‐free graph is Hamiltonian. This conjecture is proved in this note. © 2004 Wiley Periodicals, Inc. J Graph Theory 48: 142–146, 2005     

The structure of invertible substitutions on a three-letter alphabet

We study the structure of invertible substitutions on three-letter alphabet. We show that there exists a finite set of invertible substitutions such that any invertible substitution can be written as I_wσ₁σ₂σ_k, where I_w is the inner automorphism associated with w, and for 1jk. As a consequence, M is the matrix of an invertible substitution if and only if it is a finite product of non-negative elementary matrices.