7,360,184 research outputs found

    Time Reversal and Exceptional Points

    Full text link
    Eigenvectors of decaying quantum systems are studied at exceptional points of the Hamiltonian. Special attention is paid to the properties of the system under time reversal symmetry breaking. At the exceptional point the chiral character of the system -- found for time reversal symmetry -- generically persists. It is, however, no longer circular but rather elliptic.Comment: submitted for publicatio

    Accurate and linear time pose estimation from points and lines

    Get PDF
    The final publication is available at link.springer.comThe Perspective-n-Point (PnP) problem seeks to estimate the pose of a calibrated camera from n 3Dto-2D point correspondences. There are situations, though, where PnP solutions are prone to fail because feature point correspondences cannot be reliably estimated (e.g. scenes with repetitive patterns or with low texture). In such scenarios, one can still exploit alternative geometric entities, such as lines, yielding the so-called Perspective-n-Line (PnL) algorithms. Unfortunately, existing PnL solutions are not as accurate and efficient as their point-based counterparts. In this paper we propose a novel approach to introduce 3D-to-2D line correspondences into a PnP formulation, allowing to simultaneously process points and lines. For this purpose we introduce an algebraic line error that can be formulated as linear constraints on the line endpoints, even when these are not directly observable. These constraints can then be naturally integrated within the linear formulations of two state-of-the-art point-based algorithms, the OPnP and the EPnP, allowing them to indistinctly handle points, lines, or a combination of them. Exhaustive experiments show that the proposed formulation brings remarkable boost in performance compared to only point or only line based solutions, with a negligible computational overhead compared to the original OPnP and EPnP.Peer ReviewedPostprint (author's final draft

    Quantum breaking time near classical equilibrium points

    Get PDF
    By using numerical and semiclassical methods, we evaluate the quantum breaking, or Ehrenfest time for a wave packet localized around classical equilibrium points of autonomous one-dimensional systems with polynomial potentials. We find that the Ehrenfest time diverges logarithmically with the inverse of the Planck constant whenever the equilibrium point is exponentially unstable. For stable equilibrium points, we have a power law divergence with exponent determined by the degree of the potential near the equilibrium point.Comment: 4 pages, 5 figure

    Dirac fermion time-Floquet crystal: manipulating Dirac points

    Get PDF
    We demonstrate how to control the spectra and current flow of Dirac electrons in both a graphene sheet and a topological insulator by applying either two linearly polarized laser fields with frequencies ω\omega and 2ω2\omega or a monochromatic (one-frequency) laser field together with a spatially periodic static potential(graphene/TI superlattice). Using the Floquet theory and the resonance approximation, we show that a Dirac point in the electron spectrum can be split into several Dirac points whose relative location in momentum space can be efficiently manipulated by changing the characteristics of the laser fields. In addition, the laser-field controlled Dirac fermion band structure -- Dirac fermion time-Floquet crystal -- allows the manipulation of the electron currents in graphene and topological insulators. Furthermore, the generation of dc currents of desirable intensity in a chosen direction occurs when applying the bi-harmonic laser field which can provide a straightforward experimental test of the predicted phenomena.Comment: 9 pages, 7 figures, version that will appear in Phys. Rev.

    Long time Evolution of Quantum Averages Near Stationary Points

    Full text link
    We construct explicit expressions for quantum averages in coherent states for a Hamiltonian of degree 4 with a hyperbolic stagnation point. These expressions are valid for all times and "collapse" (i.e., become infinite) along a discrete sequence of times. We compute quantum corrections compared to classical expressions. These corrections become significant over a time period of order C log 1/\hbar.Comment: LaTeX, 8 page

    Identifying business cycle turning points in real time

    Get PDF
    This paper evaluates the ability of a statistical regime-switching model to identify turning points in U.S. economic activity in real time. The authors work with Markov-switching models of real GDP and employment that, when estimated on the entire post-war sample, provide a chronology of business cycle peak and trough dates very close to that produced by the National Bureau of Economic Research (NBER). Next, they investigate how accurately and quickly the models would have identified turning points had they been used in real-time for the past forty years. In general, the models identify turning point dates in real-time that are close to the NBER dates. For both business cycle peaks and troughs, the models provide systematic improvement over the NBER in the speed at which turning points are identified. Importantly, the models achieve this with few instances of "false positives." Overall, the evidence suggests that the regime-switching model could be a useful supplement to the NBER Business Cycle Dating Committee for establishing turning point dates. The model appears to capture the features of the NBER chronology in an accurate, timely way, and does so in a transparent and consistent fashion.Forecasting ; Economic conditions ; Business cycles

    Approximating Tverberg Points in Linear Time for Any Fixed Dimension

    Full text link
    Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s is called a Tverberg point of depth r for P. A classic result by Tverberg implies that there always exists a Tverberg partition of size n/(d+1), but it is not known how to find such a partition in polynomial time. Therefore, approximate solutions are of interest. We describe a deterministic algorithm that finds a Tverberg partition of size n/4(d+1)^3 in time d^{O(log d)} n. This means that for every fixed dimension we can compute an approximate Tverberg point (and hence also an approximate centerpoint) in linear time. Our algorithm is obtained by combining a novel lifting approach with a recent result by Miller and Sheehy (2010).Comment: 14 pages, 2 figures. A preliminary version appeared in SoCG 2012. This version removes an incorrect example at the end of Section 3.
    corecore