Synthesis and Reactions of Some New Pyrrolylfuro[2,3‐d]Pyrimidines and Pyrrolopyrazinofuropyrimidines

5‐Amino‐4‐methyl‐2‐phenyl‐6‐substitutedfuro[2,3‐d]pyrimidines ( 2a‐c ) were reacted with 2,5‐dimethoxytetrahydrfuran to afford the pyrrolyl derivatives 3a‐c . Compound 3a was chosen as intermediate for the synthesis of poly fused heterocycles incorporated furopyrimidines moiety 4–11 . Some of the synthesized compounds were screened for their antibacterial and antifungal activities.     

置换模,ρ置换模与Conlon比析

本文对特征P的基域F引入适当的Galois群T,讨论p置换模的Green环的Conlon比析在Galois群T作用下的动态,证明了在T作用下p置换模的Green环的不动点集重合于置换模的Green环。     

金属β-二酮化合物用于MOCVD法生长铁电氧化物薄膜

对用于MOCVD法生长铁电氧化物薄膜的金属β－二酮化合物的制备、结构及性质进行了评述，对它们在生长铁电薄膜中的应用现状进行了介绍，并对它们的应用前景作了展望。     

Three New Polyoxygenated Steroids from Two Species of the South China Sea Gorgonian Muricella flexuosa and Menella verrucosa Brundin

Three new polyoxygenated steroids, muricesteroid ( 1 ), and menellsteroids A ( 2 ) and B ( 3 ), were isolated from two species of the South China Sea gorgonian Muricella flexuosa and Menella verrucosa Brundin , respectively. The structures of these new compounds were elucidated on the basis of extensive spectroscopic analysis, chemical methods and comparison with known related compounds.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

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