Orbital formal normal forms for general Bogdanov-Takens singularity

We solve completely the problem of classification of germs of complex planar vector fields with nilpotent singularity with respect to formal orbital equivalence.     

Inner Radius of Univalence for a Strongly Starlike Domain

 The inner radius of univalence of a domain D with Poincaré density ρ _D is the possible largest number σ such that the condition ∥ S _f ∥ _D  = sup _{w∈ D} ρ _D (w) ⁻²∥ S _f (z) ∥ ≤ σ implies univalence of f for a nonconstant meromorphic function f on D, where S _f is the Schwarzian derivative of f. In this note, we give a lower bound of the inner radius of univalence for strongly starlike domains of order α in terms of the order α. The author was partially supported by the Ministry of Education, Grant-in-Aid for Encouragement of Young Scientists, 11740088. A part of this work was carried out during his visit to the University of Helsinki under the exchange programme of scientists between the Academy of Finland and the JSPS. Received November 26, 2001; in revised form September 24, 2002 Published online May 9, 2003     

1H and 13C NMR assignments of abietane diterpenes from Aegiphila lhotzkyana

An NMR study of one new and several known abietane diterpenes isolated from the roots of Aegiphila lhotzkyana is described. In addition to 1D NMR, several 2D shift‐correlated NMR pulse sequences (¹H–¹H‐COSY, NOESY, HMQC and HMBC) were used to establish all the structures, and unambiguously perform the ¹H and ¹³C chemical shift assignments of the new natural diterpene and three derivatives, the NMR data for which have not been reported previously. Revision of current data assignment for teuvincenone H is also suggested. Copyright © 2003 John Wiley & Sons, Ltd.     

π1-classification of real arrangements with up to eight lines

One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups.     

Bi12TiO20纳米粉体的制备及其光吸收特性研究

以钛酸四丁酯和硝酸铋为原料 ,利用化学溶液分解法制备了Bi12 TiO2 0 纳米多晶粉体 .采用XRD和TEM对其结构和形貌进行了表征 .结合热重 差热 (TG DTA)分析 ,探讨了Bi12 TiO2 0 晶相的形成机理 .通过UV Vis漫反射谱的测定 ,研究了Bi12 TiO2 0 纳米晶粉体的光吸收特性 .结果显示 ,从组成为化学计量比的前驱液中可以很容易制得纯Bi12 TiO2 0 纳米晶粉体 ,该Bi12 TiO2 0 纳米晶粉体呈现了在很宽的波长范围内 (5 6 0～ 385nm )对光的吸收的特性 .     

Crack path instabilities in DCDC experiments in the low speed regime

We studied the low speed fracture regime (10⁻⁴-10⁻⁹ m s⁻¹) in different glassy materials (soda-lime glass, glass ceramics) with variable but controlled length scale of heterogeneity. The chosen mechanical system enabled us to work in pure mode I (tensile) and at a fixed load on double cleavage drilled compression specimen. The internal residual stresses of studied samples were carefully relaxed by appropriate thermal treatment. By means of optical and atomic force microscopy techniques fracture surfaces have been examined. We have shown for the first time that the crack front line underwent an out-of-plane oscillating behavior as a result of a reproducible sequence of instabilities. The wavelength of such a phenomenon is in the micrometer range and its amplitude in the nanometer range. These features were observed for different glassy materials providing that a typical length scale characterizing internal heterogeneities was lower than a threshold limit estimated to few nanometers. This effect is the first clear experimental evidence of crack path instabilities in the low speed regime in a uniaxial loading experiment. This phenomenon has been interpreted by referring to the stability criterion for a straight crack propagation as presented by Adda-Bedia et al. [Phys. Rev. Lett. 76 (1996) 1497].     

Synthesis,characterization and properties of methylaminocellulose

Homogeneously prepared tosylcelluloses (TC) with degrees of substitution (DS) of DS_Tos 0.1–1.8 were used as intermediates for the synthesis of methylaminocelluloses (MAC) by nucleophilic substitution with methylamine. TC with DS_Tos up to 1.1 were shown to be valuable intermediates for selective synthesis of MAC with DS_MA varying from 0.1 to approximately 1. No nucleophilic substitution was observed at higher DS_Tos. At the chosen reaction conditions (60 °C, 48 h) residual tosyl moieties remained unchanged and little hydrolysis took place. The samples obtained were characterized by means of elemental analysis, FTIR and ¹³C CP/MAS NMR spectroscopy. ¹³C CP/MAS NMR spectroscopy was found to be an efficient tool for quantification of DS_MA. Furthermore, the swelling behaviour in water was investigated and preliminary tests concerning the bilirubin adsorption capacity of MAC were carried out.     

Ihara zeta functions of digraphs

After defining and exploring some of the properties of Ihara zeta functions of digraphs, we improve upon Kotani and Sunada’s bounds on the poles of Ihara zeta functions of undirected graphs by considering digraphs whose adjacency matrices are directed edge matrices.     

Note on a conjecture of toft

A conjecture of Toft [17] asserts that any 4-critical graph (or equivalently, every 4-chromatic graph) contains a fully odd subdivision ofK ₄. We show that if a graphG has a degree three nodev such thatG-v is 3-colourable, then eitherG is 3-colourable or it contains a fully oddK ₄. This resolves Toft's conjecture in the special case where a 4-critical graph has a degree three node, which is in turn used to prove the conjecture for line-graphs. The proof is constructive and yields a polynomial algorithm which given a 3-degenerate graph either finds a 3-colouring or exhibits a subgraph that is a fully odd subdivision ofK ₄. (A graph is 3-degenerate if every subgraph has some node of degree at most three.)