Thermal behavior of multiwall carbon nanotube/zeolite nanocomposites

Summary In this study we report the synthesis and thermal characterization of multiwall carbon nanotubes containing zeolite based nanocomposites. Three different zeolites (LTA, FAU and MFI) were used in this study and it was observed that the morphologies of the synthesized nanocomposites were significantly different. For FAU zeolite nanocrystals with a few nm in diameter were nucleated on the nanotubes covering their surface, however, for LTA and MFI zeolites bulky crystals with nanotubes crossing them were observed by transmission electron microscopy. One of the most important results of our study was the generation of secondary mesoporosity in the zeolites after removing the carbon nanotubes.     

Counterexamples in optimal quadrature

It is widely believed that order of exactness is a good measure of the quality of an algorithm for numerical quadrature. We show that this is not the case, by exhibiting a situation in which the optimal algorithm does not even integrate constants exactly. We also show that there are situations in which the penalty for using equidistant nodes is unbounded. Finally, we show that the complexity of obtaining an -approximation can be an arbitrary function of , i.e., there is no hardest quadrature problem.     

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

LetP be a finite partially ordered set. The lengthl(x) of an elementx ofP is defined by the maximal number of elements, which lie in a chain withx at the top, reduced by one. Letw(P) (d(P)) be the maximal number of elements ofP which have the same length (which form an antichain). Further let . The numbers and as well as all partially ordered sets for which these maxima are attained are determined.     

Glucomannan from Narcissus poeticus Studied by PMR and 13C NMR Spectroscopy

Native acetylated glucomannan of molecular weight (MW) 32000 with a glucose:mannose ratio 1:30 was isolated from bulbs of Narcissus poeticus. Glucomannan was depolymerized to a fragment of MW 15000 with an unchanged primary structure and was studied using PMR and ¹³C NMR spectroscopy. It was found that the linear chain of the biopolymer consists of 1-4-bound D-gluco- and D-mannopyranose units and the O-Ac groups are localized on C-2, C-3, and C-6 hydroxyls in certain anhydromannose units.     

Theoretical Study on the Structures and Electronic Spectra of the Derivatives of C_(60)-P-2,4,6-Triphenyl Borazinc

1 INTRODUCTION The electron-transfer reaction of C60 derivatives, especially light-induced electron-transfer reaction, has been an active research field for a long time. Many researches are focused on the long-live charge- separated state caused by electron-transfer[1]. And several electron-transfers between electron donor and C60 or intramolecular electron-transfer have been confirmed. As an example, TTF-C60 is proved to be a short-live charge-separated compound[2].Due to the excelle…     

The Formation of C?C Bonds with the Aid of α-Halogeno Ethers,Sulfides, and Amines

α-Halogeno ethers, sulfides, and amines are reactive compounds which can be used for the formation of new C? C bonds, either as nucleophilic or as electrophilic reagents, or by α-elimination. The use of these compounds in the synthesis of many classes of organic compounds is reviewed.     

Quartic X-splines

Summary The quartic periodic and nonperiodic X-spline are separated from the class of all piecewise-quartic interpolatory polynomials and their orders of convergence, smoothness and complexity of construction are examined. In particular, error estimates of interpolation of smooth functions at uniformly spaced knots by eight quartic X-splines of special interest are presented. The results are illustrated by a numerical example.     

On a pair of functional equations of combinatorial interest

The equations of the title appear in the author's paper Chromatic Sums for Rooted Planar Triangulations, V: Special Equations. (Canadian Journal of Mathematics, 26 (1974), 893–907). They appear in that paper as Equations (24) and (25). They are simultaneous equations for two unknown functionsl andy ₂ of two variablesy ₁ andz. A parameter is involved. The main result is that for = 2 cos (2/n), wheren is a positive integer >1, the two equations can be reduced to a single equation (numbered (49)). Solutions of this are known forn <7. From such solutions we can expect to get information about the averaged chromatic polynomials of planar triangulations with a given number of triangles.The present work is basically an expository paper on the theory given in Chromatic Sums, V, but it includes some new results and many simplifications.     

Approximation under an arc length constraint

Let f C[a, b]. LetP be a subset ofC[a, b], L b – a be a given real number. We say thatp P is a best approximation tof fromP, with arc length constraintL, ifA[p] _b ^a [1 + (p(x)) ²]dx L andp – f q – f for allq P withA[q] L. represents an arbitrary norm onC[a, b]. The constraintA[p] L might be interpreted physically as a materials constraint.In this paper we consider the questions of existence, uniqueness and characterization of constrained best approximations. In addition a bound, independent of degree, is found for the arc length of a best unconstrained Chebyshev polynomial approximation.The work of L. L. Keener is supported by the National Research Council of Canada Grant A8755.     

On the singular graph and the Weyr characteristic of anM-matrix

LetA be anM-matrix in standard lower block triangular form, with diagonal blocksA _ii irreducible. LetS be the set of indices such that the diagonal blockA is singular. We define the singular graph ofA to be the setS with partial order defined by > if there exists a chain of non-zero blocksA _i, A_ij, , A_l.Let ₁ be the set of maximal elements ofS, and define thep-th level _p ,p = 2, 3, , inductively as the set of maximal elements ofS \( _{1 p-1}). Denote by _p the number of elements in _p . The Weyr characteristic (associated with 0) ofA is defined to be (A) = ( ₁, ₂,, _h ), where ₁ + + _p = dim KerA ^p ,p = 1, 2, , and _h > 0, _h+1 = 0.Using a special type of basis, called anS-basis, for the generalized eigenspaceE(A) of 0 ofA, we associate a matrixD withA. We show that(A) = ( ₁, , _h) if and only if certain submatricesD _p,p+1 ,p = 1, , h – 1, ofD have full column rank. This condition is also necessary and sufficient forE(A) to have a basis consisting of non-negative vectors, which is a Jordan basis for –A. We also consider a given finite partially ordered setS, and we find a necessary and sufficient condition that allM-matricesA with singular graphS have(A) = ( ₁, , _h). This condition is satisfied ifS is a rooted forest.The work of the second-named author was partly supported by the National Science Foundation, under grant MPS-08618 A02.