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     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Elliptic equations with BMO coefficients in Reifenberg domains

The inhomogeneous Dirichlet problems concerning divergence form elliptic equations are studied. Optimal regularity requirements on the coefficients and domains for the W^1,p theory, 1 < p < ∞, are obtained. The principal coefficients are supposed to be in the John‐Nirenberg space with small BMO seminorms. The domain is a Reifenberg domain. These conditions for the W^1,p theory not only weaken the requirements on the coefficients but also lead to a more general geometric condition on the domains. In fact, these domains might have fractal dimensions. © 2004 Wiley Periodicals, Inc.     

Crystallization and morphology of poly(vinylidene fluoride)/poly(3‐hydroxybutyrate) blends. I. Spherulitic morphology and growth by polarized microscopy

The development of the poly(3‐hydroxybutyrate) (PHB) morphology in the presence of already existent poly(vinylidene fluoride) (PVDF) spherulites was studied by two‐stage solidification with two separate crystallization temperatures. PVDF formed irregular dendrites at lower temperatures and regular, banded spherulites at elevated temperatures. The transition temperature of the spherulitic morphology from dendrites to regular, banded spherulites increased with increasing PVDF content. A remarkable amount of PHB was included in the PVDF dendrites, whereas PHB was rejected into the remaining melt from the banded spherulites. When PVDF crystallized as banded spherulites, PHB could consequently crystallize only around them, if at all. In contrast, PHB crystallized with a common growth front, starting from a defined site in the interfibrillar regions of volume‐filling PVDF dendrites. It formed by itself dendritic spherulites that included a large number of PVDF spherulites. For blends with a PHB content of more than 80 wt %, for which the PVDF dendrites were not volume‐filling, PHB first formed regular spherulites. Their growth started from outside the PVDF dendrites but could later interpenetrate them, and this made their own morphology dendritic. These PHB spherulites melted stepwise because the lamellae inside the PVDF dendrites melted at a lower temperature than those from outside. This reflected the regularity of the two fractions of the lamellae because that of those inside the dendrites of PVDF was controlled by the intraspherulitic order of PVDF, whereas that from outside was only controlled by the temperature and the melt composition. The described morphologies developed without mutual nucleating efficiency of the components. © 2003 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 41: 873–882, 2003     

Crystallographic report: catena‐Aqua(2,2′‐bipyrimidine)lithium(I) perchlorate

A lithium(I) coordination polymer has been formed from LiClO₄ and the 2,2′‐bipyrimidine (bpym) ligand in which each square pyramidal lithium(I) atom is coordinated in the basal plane by four nitrogen donor atoms derived from two bpym ligands and one water molecule at the apical position. These are connected into a layer structure via hydrogen‐bonding interactions involving the perchlorate anions. Copyright © 2004 John Wiley & Sons, Ltd.     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

Synthesis and characterization of a polyfluorene containing carbazole and oxadiazole dipolar pendent groups and its application to electroluminescent devices

We have synthesized a blue‐light‐emitting polyfluorene (PF) derivative ( PF‐CBZ‐OXD ) that presents bulky hole‐transporting carbazole and electron‐transporting oxadiazole pendent groups functionalized at the C‐9 positions of alternating fluorene units. The results from photoluminescence and electrochemical measurements indicate that both the side chains and the PF main chain retain their own electronic characteristics in the copolymer. An electroluminescent device incorporating this polymer as the emitting layer was turned on at 4.5 V; it exhibited a stable blue emission with a maximum external quantum efficiency of 1.1%. Moreover, we doped PF‐CBZ‐OXD and its analogue PF‐TPA‐OXD with a red‐light‐emitting iridium phosphor for use as components of phosphorescent red‐light emitters to investigate the effect of the host's HOMO energy level on the degree of charge trapping and on the electrophosphorescent efficiency. We found that spectral overlap and individual energy level matching between the host and guest were both crucial features affecting the performance of the electroluminescence devices. Atomic force microscopy measurements indicated that the dipolar nature of PF‐CBZ‐OXD , in contrast to the general nonpolarity of polydialkylfluorenes, provided a stabilizing environment that allowed homogeneous dispersion of the polar iridium triplet dopant. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 2925–2937, 2007     

Numerical approximation of generalized Newtonian fluids using Powell–Sabin–Heindl elements: I. theoretical estimates

In this paper we consider the numerical approximation of steady and unsteady generalized Newtonian fluid flows using divergence free finite elements generated by the Powell–Sabin–Heindl elements. We derive a priori and a posteriori finite element error estimates and prove convergence of the method of successive approximations for the steady flow case. A priori error estimates of unsteady flows are also considered. These results provide a theoretical foundation and supporting numerical studies are to be provided in Part II. Copyright © 2003 John Wiley & Sons, Ltd.