String tension in the three-dimensional Abelian Higgs model

We measure the expectation values of the Wilson loops for the radially active Abelian Higgs Model in three dimensions with Higgs chargeq=1 andq=2. We observe a drastic fall-off of the area term as we pass to the Higgs phase, as well as a peak of the perimetric term at the phase transition. Implications of our results for other Higgs models are also discussed.     

Exponentially divergent trajectories and RRKM behaviour of Ar3 clusters

The rate of exponential divergence of two initially adjacent trajectories has been studied for Ar₂ clusters at low and high energies. It is found that at the dissociation limit energy randomization occurs during two typical vibrational periods. Lifetime distributions for energies not far above the dissociation limit have a random lifetime pattern but highly energized clusters show non-RRKM behaviour     

Universality and asymptotics of graph counting problems in non-orientable surfaces

Bender-Canfield showed that a plethora of graph counting problems in orientable/non-orientable surfaces involve two constants tg and pg for the orientable and the non-orientable case, respectively. T.T.Q. Le and the authors recently discovered a hidden relation between the sequence tg and a formal power series solution u(z) of the Painlevé I equation which, among other things, allows to give exact asymptotic expansion of tg to all orders in 1/g for large g. The paper introduces a formal power series solution v(z) of a Riccati equation, gives a non-linear recursion for its coefficients and an exact asymptotic expansion to all orders in g for large g, using the theory of Borel transforms. In addition, we conjecture a precise relation between the sequence pg and v(z). Our conjecture is motivated by the enumerative aspects of a quartic matrix model for real symmetric matrices, and the analytic properties of its double scaling limit. In particular, the matrix model provides a computation of the number of rooted quadrangulations in the 2-dimensional projective plane. Our conjecture implies analyticity of the O(N)- and Sp(N)-types of free energy of an arbitrary closed 3-manifold in a neighborhood of zero. Finally, we give a matrix model calculation of the Stokes constants, pose several problems that can be answered by the Riemann-Hilbert approach, and provide ample numerical evidence for our results.     

Soft- and hard-agglomerate aerosols made at high temperatures

Criteria for aerosol synthesis of soft-agglomerate, hard-agglomerate, or even nonagglomerate particles are developed on the basis of particle sintering and coalescence. Agglomerate (or aggregate) particles are held together by weak, physical van der Waals forces (soft agglomerates) or by stronger chemical or sintering bonds (hard agglomerates). Accounting for simultaneous gas phase chemical reaction, coagulation, and sintering during the formation and growth of silica (SiO2) nanoparticles by silicon tetrachloride (SiCl4) oxidation and neglecting the spread of particle size distribution, the onset of hard-agglomerate formation is identified at the end of full coalescence, while the onset of soft-agglomerate formation is identified at the end of sintering. Process conditions such as the precursor initial volume fraction, maximum temperature, residence time, and cooling rate are explored, identifying regions for the synthesis of particles with a controlled degree of agglomeration (ratio of collision to primary particle diameters).     

On the Melvin–Morton–Rozansky conjecture

We prove a conjecture stated by Melvin and Morton (and elucidated further by Rozansky) saying that the Alexander–Conway polynomial of a knot can be read from some of the coefficients of the Jones polynomials of cables of that knot (i.e., coefficients of the “colored” Jones polynomial). We first reduce the problem to the level of weight systems using a general principle, which may be of some independent interest, and which sometimes allows to deduce equality of Vassiliev invariants from the equality of their weight systems. We then prove the conjecture combinatorially on the level of weight systems. Finally, we prove a generalization of the Melvin–Morton–Rozansky (MMR) conjecture to knot invariants coming from arbitrary semi-simple Lie algebras. As side benefits we discuss a relation between the Conway polynomial and immanants and a curious formula for the weight system of the colored Jones polynomial. Oblatum 28-VII-1994 & 5-XI-1995 & 22-XI-1995     

Universal elements in some classes of mappings and classes of G-spaces

In the present paper it is proved the existence of topologically universal elements in some classes of mappings and classes of G-spaces generalizing some results from [S.D. Iliadis, Universal Spaces and Mappings, North-Holland Math. Stud., vol. 198, Elsevier, 2005] and [S.D. Iliadis, Universal Borel mappings and Borel actions of groups, Topology Appl., in press, doi:10.1016/j.topol.2007.05.029].     

Wheels, wheeling, and the Kontsevich integral of the Unknot

We conjecture an exact formula for the Kontsevich integral of the unknot, and also conjecture a formula (also conjectured independently by Deligne [De]) for the relation between the two natural products on the space of uni-trivalent diagrams. The two formulas use the related notions of “Wheels” and “Wheeing”. We prove these formulas ‘on the level of Lie algebras’ using standard techniques from the theory of Vassiliev invariants and the theory of Lie algebras. In a brief epilogue we report on recent proofs of our full conjectures, by Kontsevich [Ko2] and by DBN, DPT, and T. Q. T. Le, [BLT]. This paper is available electronically     

A Scalable Parallel Interior Point Algorithm for Stochastic Linear Programming and Robust Optimization

We present a computationally efficient implementation of an interior point algorithm for solving large-scale problems arising in stochastic linear programming and robust optimization. A matrix factorization procedure is employed that exploits the structure of the constraint matrix, and it is implemented on parallel computers. The implementation is perfectly scalable. Extensive computational results are reported for a library of standard test problems from stochastic linear programming, and also for robust optimization formulations.The results show that the codes are efficient and stable for problems with thousands of scenarios. Test problems with 130 thousand scenarios, and a deterministic equivalent linear programming formulation with 2.6 million constraints and 18.2 million variables, are solved successfully.