Phase diagram and spectral properties of a new exactly integrable spin-1 quantum chain

The spectral properties and phase diagram of the exactly integrable spin-1 quantum chain introduced by Alcaraz and Bariev are presented. The model has a U(1) symmetry and its integrability is associated with an unknown R-matrix whose dependence on the spectral parameters is not of a different form. The associated Bethe ansatz equations that fix the eigenspectra are distinct from those associated with other known integrable spin models. The model has a free parameter t(p). We show that at the special point t(p) = 1, the model acquires an extra U(1) symmetry and reduces to the deformed SU(3) Perk-Schultz model at a special value of its anisotropy q = exp(i2 pi/3) and in the presence of an external magnetic field. Our analysis is carried out either by solving the associated Bethe ansatz equations or by direct diagonalization of the quantum Hamiltonian for small lattice sizes. The phase diagram is calculated by exploring the consequences of conformal invariance on the finite-size corrections of the Hamiltonian eigenspectrum. The model exhibits a critical phase ruled by the c = 1 conformal field theory separated from a massive phase by first-order phase transitions.

Decay of geometry for Fibonacci critical covering maps of the circle

We study the growth of Df `` (f(c)) when f is a Fibonacci critical covering map of the circle with negative Schwarzian derivative, degree d >= 2 and critical point c of order l > 1. As an application we prove that f exhibits exponential decay of geometry if and only if l <= 2, and in this case it has an absolutely continuous invariant probability measure, although not satisfying the so-called Collet-Eckmann condition. (C) 2009 Elsevier Masson SAS. All rights reserved.

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

The Asymmetric Travelling Salesman Problem with Replenishment Arcs (RATSP) is a new class of problems arising from work related to aircraft routing. Given a digraph with cost on the arcs, a solution of the RATSP, like that of the Asymmetric Travelling Salesman Problem, induces a directed tour in the graph which minimises total cost. However the tour must satisfy additional constraints: the arc set is partitioned into replenishment arcs and ordinary arcs, each node has a non-negative weight associated with it, and the tour cannot accumulate more than some weight limit before a replenishment arc must be used. To enforce this requirement, constraints are needed. We refer to these as replenishment constraints.

In this paper, we review previous polyhedral results for the RATSP and related problems, then prove that two classes of constraints developed in V. Mak and N. Boland [Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Technical Report TR M05/03, School of Information Technology, Deakin University, 2005] are, under appropriate conditions, facet-defining for the RATS polytope.