Effect of Acid Treatment of Montmorillonite on “Support‐Activator” Performance to Support Metallocene for Propylene Polymerization Catalyst

This work is focused on montmorillonite (MMT)‐based “support‐activators” (S‐As) for the metallocene‐catalyzed propylene polymerization. This catalyst was previously industrialized; however, for further technological advances, the activation mechanism is investigated. The chemical and morphological requirements of the S‐A are surveyed using both commercially available raw clay minerals (non‐acid‐treated) and acid‐treated clay minerals. The S‐A possessing strong‐acid sites (pK a < ?8.2) gives a highly active catalyst. Acid treatment of MMT induces morphological changes as well as the formation of strong acid sites. Based on pore size distribution analysis and atomic force microscopy observations, it is concluded that the strong acid sites are located in the small pores around the edge of the clay mineral (not in the interlayer), where the structure is disordered by the acid treatment.

     

Small-Angle electron scattering and electron density in carbon dioxide

The total (elastic and inelastic) intensity of electrons scattered by CO₂ was measured in the s range of 1 to 12 Å^?1 and compared with the theoretical intensity calculated from the Hartree-Fock molecular wave function and those calculated for the independent-atom-model (IAM ) molecule. In the range of s ? 4 Å^?1 the electron correlation effect on the total scattered intensity was found to be represented by that for the IAM molecule.     

Studies on stable free radicals. XIX. Copolymerization of N-oxyl biradical with α-chloro-p-xylylene

Copolymerization of N-oxyl biradical with α-chloro-p-xylylene was carried out by varying the feed ratio of α,α′-dichloro-p-xylene which was the precursor of α-chloro-p-xylylene. The structures of the obtained copolymers were determined spectroscopically. The results that the N-oxyl attacked the carbon-bearing chlorine atom of α-chloro-p-xylylene suggest a nucleophilic reactivity of N-oxyl radical. The copolymerization process was also discussed.     

On the residue classes of integer sequences satisfying a linear three term recurrence formula

In this paper we investigate linear three-term recurrence formulae with sequences of integers (T(n))_n?0 and (U(n))_n?0, which are ultimately periodic modulo m, e.g.

     

Minkowski’s Second Theorem over a Simple Algebra

We generalize the notion of successive minima, Minkowski’s second theorem and Siegel’s lemma to a free module over a simple algebra whose center is a global field.     

Volume collapsed three-manifolds with a lower curvature bound

In this paper we determine the topology of three-dimensional complete orientable Riemannian manifolds with a uniform lower bound of sectional curvature whose volume is sufficiently small.     

Class field theory for a product of curves over a local field

We prove that the kernel of the reciprocity map for a product of curves over a p-adic field with split semi-stable reduction is divisible. We also consider the K ₁ of a product of curves over a number field.      

An NC Parallel Algorithm for Edge-Coloring Series–Parallel Multigraphs

Many combinatorial problems can be efficiently solved in parallel for series–parallel multigraphs. The edge-coloring problem is one of a few combinatorial problems for which no NC parallel algorithm has been obtained for series–parallel multigraphs. This paper gives an NC parallel algorithm for the problem on series–parallel multigraphsG. It takesO(log n) time withO(Δn/log n) processors, wherenis the number of vertices and Δ is the maximum degree ofG.     

Total Colorings Of Degenerate Graphs

A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤s. We prove that an s-degenerate graph G has a total coloring with Δ+1 colors if the maximum degree Δ of G is sufficiently large, say Δ≥4s+3. Our proof yields an efficient algorithm to find such a total coloring. We also give a lineartime algorithm to find a total coloring of a graph G with the minimum number of colors if G is a partial k-tree, that is, the tree-width of G is bounded by a fixed integer k.     

G. Martens′ Dimension Theorem for Curves of Odd Gonality

For a smooth projective irreducible algebraic curve C of odd gonality, the maximal possible dimension of the variety of special linear systems W _d ^r (C) is d-3r by a result of M. Coppens et al. Furthermore it is known that if the maximum dimension of W(C) for a curve C of odd gonality is attained then C is of very special type of curves by the recent progress made by G. Martens. The purpose of this paper is to chase an extension of the result of G. Martens; if dim W(C)=d-3r-1 for a curve C of odd gonality for some dg-4 and r1, then C must be either a smooth plane sextic, a pentagonal curve of bounded genus or a smooth plane octic.