Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

To-and-fro motion of W5Si3 on a beta-Si3N4 substrate at elevated temperatures.

Behavior of fine crystalline particles of W5Si3 on a beta-Si3N4 substrate at high temperatures was observed by an in situ heating experiment in a transmission electron microscope. Some of the fine particles of W5Si3 moved in a to-and-fro manner.     

Splittings of finitely generated groups over two-ended subgroups

We describe a means of constructing splittings of a one-ended finitely generated group over two-ended subgroups, starting with a finite collection of codimension-one two-ended subgroups. In the case where all the two-ended subgroups have two-ended commensurators, we obtain an annulus theorem, and a form of the JSJ splitting of Rips and Sela. The construction uses ideas from the work of Dunwoody, Sageev and Swenson. We use a particular kind of order structure which combines cyclic orders and treelike structures. In the special case of hyperbolic groups, this provides a link between combinarorial constructions, and constructions arising from the topological structure of the boundary. In this context, we recover the annulus theorem of Scott and Swarup. We also show that a one-ended finitely generated group which contains an infinite-order element, and such that every infinite cyclic subgroup is (virtually) codimension-one is a virtual surface group.

     

A note on minimum degree conditions for supereulerian graphs

A graph is called supereulerian if it has a spanning closed trail. Let G be a 2-edge-connected graph of order n such that each minimal edge cut SE(G) with |S|3 satisfies the property that each component of G−S has order at least (n−2)/5. We prove that either G is supereulerian or G belongs to one of two classes of exceptional graphs. Our results slightly improve earlier results of Catlin and Li. Furthermore, our main result implies the following strengthening of a theorem of Lai within the class of graphs with minimum degree δ4: If G is a 2-edge-connected graph of order n with δ(G)4 such that for every edge xyE(G) , we have max{d(x),d(y)}(n−2)/5−1, then either G is supereulerian or G belongs to one of two classes of exceptional graphs. We show that the condition δ(G)4 cannot be relaxed.     

Generalized Longo–Rehren Subfactors and α-Induction

We study the recent construction of subfactors by Rehren which generalizes the Longo–Rehren subfactors. We prove that if we apply this construction to a non-degenerately braided subfactor N⊂M and α^±-induction, then the resulting subfactor is dual to the Longo–Rehren subfactor M⊗M ^opp⊂R arising from the entire system of irreducible endomorphisms of M resulting from α^plusmn;-induction. As a corollary, we solve a problem on existence of braiding raised by Rehren negatively. Furthermore, we generalize our previous study with Longo and Müger on multi-interval subfactors arising from a completely rational conformal net of factors on S ¹ to a net of subfactors and show that the (generalized) Longo–Rehren subfactors and α-induction naturally appear in this context. Received: 11 September 2001 / Accepted: 7 October 2001     

Structural evolution in amorphous silicon and germanium thin films.

The structural evolution in amorphous silicon and germanium thin films has been investigated by high-resolution transmission electron microscopy (HRTEM) in conjunction with autocorrelation function (ACF) analysis. The results established that the structure of as-deposited semiconductor films is of a high density of nanocrystallites embedded in the amorphous matrix. In addition, from ACF analysis, the structure of a-Ge is more ordered than that of a-Si. The density of embedded nanocrystallites in amorphous films was found to diminish with annealing temperature first, then to increase. The conclusions also corroborate well with the results of diminished medium-range order in annealed amorphous films determined previously by a variable coherence microscopy method.     

Complete ideals and singularities of space curves

We consider complete ideals supported on finite sequences of infinitely near points, in regular local rings with dimensions greater than two. We study properties of factorizations in Lipman special *-simple complete ideals. We relate it to a type of proximity, linear proximity, of the points, and give conditions in order to have unique factorization. Several examples are presented. Received: 2 February 2000 / in final form: 14 March 2001 / Published online: 18 January 2002