406,349 research outputs found
Proof of the 1-factorization and Hamilton decomposition conjectures III: approximate decompositions
In a sequence of four papers, we prove the following results (via a unified
approach) for all sufficiently large :
(i) [1-factorization conjecture] Suppose that is even and . Then every -regular graph on vertices has a
decomposition into perfect matchings. Equivalently, .
(ii) [Hamilton decomposition conjecture] Suppose that . Then every -regular graph on vertices has a decomposition
into Hamilton cycles and at most one perfect matching.
(iii) We prove an optimal result on the number of edge-disjoint Hamilton
cycles in a graph of given minimum degree.
According to Dirac, (i) was first raised in the 1950s. (ii) and (iii) answer
questions of Nash-Williams from 1970. The above bounds are best possible. In
the current paper, we show the following: suppose that is close to a
complete balanced bipartite graph or to the union of two cliques of equal size.
If we are given a suitable set of path systems which cover a set of
`exceptional' vertices and edges of , then we can extend these path systems
into an approximate decomposition of into Hamilton cycles (or perfect
matchings if appropriate).Comment: We originally split the proof into four papers, of which this was the
third paper. We have now combined this series into a single publication
[arXiv:1401.4159v2], which will appear in the Memoirs of the AMS. 29 pages, 2
figure
Measurement-driven dynamics for a coherently-excited atom
The phenomenon of telegraphing in a measurement-driven two-level atom was noted in Cresser et al. [Cresser, J.D.; Barnett, S.M.; Jeffers, J.; Pegg, D.T. Opt. Commun. 2006, 264, 352361]. Here we introduce two quantitative measures of telegraphing: one based on the accumulated measurement record and one on the evolution of the quantum state. We use these to analyse the dynamics of the atom over a wide range of parameters. We find, in particular, that the measures provide broadly similar statistics when the measurements are frequent, but differ widely when measurements are sparse. This is in line with intuition, and demonstrates the utility of both measures
- …