π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.     

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].     

高清晰度电视样机控制子系统的实现

本文提出了基于微处理器AT89C55的国家高清晰度电视样机控制子系统的总体设计方案和软硬件实现方法。目前，该控制系统己顺利完成，并参与北京、上海两地的功能样机测试。     

利用C++Builder 5.0开发原理框图绘图软件

介绍了原理框图各种图形的数据存储方法，利用C^ Builder5.0开发了原理框图的绘图软件，实现了原理框图绘制的基本功能。     

C51嵌套汇编子程序在阻抗测试仪研制中的应用

C51嵌套汇编子程序，充分发挥了两种语言自的优势，介绍了C51调用汇编子程序的接品规则，并通过阻抗测试仪程序开发的例子予以详细说明。     

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.)     

Ambient connections realising conformal Tractor holonomy

For a conformal manifold we introduce the notion of an ambient connection, an affine connection on an ambient manifold of the conformal manifold, possibly with torsion, and with conditions relating it to the conformal structure. The purpose of this construction is to realise the normal conformal Tractor holonomy as affine holonomy of such a connection. We give an example of an ambient connection for which this is the case, and which is torsion free if we start the construction with a C-space, and in addition Ricci-flat if we start with an Einstein manifold. Thus, for a C-space this example leads to an ambient metric in the weaker sense of Čap and Gover, and for an Einstein space to a Ricci-flat ambient metric in the sense of Fefferman and Graham. Current address for first author: Erwin Schr?dinger International Institute for Mathematical Physics (ESI), Boltzmanngasse 9, 1090 Vienna, Austria Current address for second author: Department of Mathematics, University of Hamburg, Bundesstra?e 55, 20146 Hamburg, Germany     

PURE STATE APPROACH TO $C(X)×_\alpha Z_n$

ＰＵＲＥ ＳＴＡＴＥ ＡＰＰＲＯＡＣＨ ＴＯ Ｃ（ｘ）_αＺ_nＬＩＢＩＮＧＲＥＮ；ＬＩＮＱＩＮＧ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＡｃａｄｅｍｉａＳｉｎｉｃａ，Ｂｅｉｊｉｎｇ１０００８０，Ｃｈｉｎａ．Ｐｒｏｊｅｃｔｓｕｐｐｏｒｔｅｄｂｙｔｈ?..