130 research outputs found

    Effect of Hilbert space truncation on Anderson localization

    Full text link
    The 1-D Anderson model possesses a completely localized spectrum of eigenstates for all values of the disorder. We consider the effect of projecting the Hamiltonian to a truncated Hilbert space, destroying time reversal symmetry. We analyze the ensuing eigenstates using different measures such as inverse participation ratio and sample-averaged moments of the position operator. In addition, we examine amplitude fluctuations in detail to detect the possibility of multifractal behavior (characteristic of mobility edges) that may arise as a result of the truncation procedure.Comment: 20 pages, 23 figure

    Many-body localization in Landau level subbands

    Full text link
    We explore the problem of localization in topological and non-topological nearly-flat subbands derived from the lowest Landau level, in the presence of quenched disorder and short-range interactions. We consider two models: a suitably engineered periodic potential, and randomly distributed point-like impurities. We perform numerical exact diagonalization on a torus geometry and use the mean level spacing ratio r\langle r \rangle as a diagnostic of ergodicity. For topological subbands, we find there is no ergodicity breaking in both the one and two dimensional thermodynamic limits. For non-topological subbands, in constrast, we find evidence of an ergodicity breaking transition at finite disorder strength in the one-dimensional thermodynamic limit. Intriguingly, indications of similar behavior in the two-dimensional thermodynamic limit are found, as well. This constitutes a novel, continuum\textit{continuum} setting for the study of the many-body localization transition in one and two dimensions

    Analyzing Timed Systems Using Tree Automata

    Full text link
    Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata. The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. When a family of graphs has bounded tree-width, they can be interpreted in trees and MSO-definable properties of such graphs can be checked using tree automata. The technique is quite general and applies to many timed systems. In this paper, as an example, we develop the technique on timed pushdown systems, which have recently received considerable attention. Further, we also demonstrate how we can use it on timed automata and timed multi-stack pushdown systems (with boundedness restrictions)

    Localization and interactions in topological and non-topological bands in two dimensions

    Full text link
    A two-dimensional electron gas in a high magnetic field displays macroscopically degenerate Landau levels, which can be split into Hofstadter subbands by means of a weak periodic potential. By carefully engineering such a potential, one can precisely tune the number, bandwidths, bandgaps and Chern character of these subbands. This allows a detailed study of the interplay of disorder, interaction and topology in two dimensional systems. We first explore the physics of disorder and single-particle localization in subbands derived from the lowest Landau level, that nevertheless may have a topological nature different from that of the entire lowest Landau level. By projecting the Hamiltonian onto subbands of interest, we systematically explore the localization properties of single-particle eigenstates in the presence of quenched disorder. We then introduce electron-electron interactions and investigate the fate of many-body localization in subbands of varying topological character

    Revisiting Underapproximate Reachability for Multipushdown Systems

    Full text link
    Boolean programs with multiple recursive threads can be captured as pushdown automata with multiple stacks. This model is Turing complete, and hence, one is often interested in analyzing a restricted class that still captures useful behaviors. In this paper, we propose a new class of bounded under approximations for multi-pushdown systems, which subsumes most existing classes. We develop an efficient algorithm for solving the under-approximate reachability problem, which is based on efficient fix-point computations. We implement it in our tool BHIM and illustrate its applicability by generating a set of relevant benchmarks and examining its performance. As an additional takeaway, BHIM solves the binary reachability problem in pushdown automata. To show the versatility of our approach, we then extend our algorithm to the timed setting and provide the first implementation that can handle timed multi-pushdown automata with closed guards.Comment: 52 pages, Conference TACAS 202

    Beyond universal behavior in the one-dimensional chain with random nearest neighbor hopping

    Full text link
    We study the one-dimensional nearest neighbor tight binding model of electrons with independently distributed random hopping and no on-site potential (i.e. off-diagonal disorder with particle-hole symmetry, leading to sub-lattice symmetry, for each realization). For non-singular distributions of the hopping, it is known that the model exhibits a universal, singular behavior of the density of states ρ(E)1/Eln3E\rho(E) \sim 1/|E \ln^3|E|| and of the localization length ξ(E)lnE\xi(E) \sim |\ln|E||, near the band center E=0E = 0. (This singular behavior is also applicable to random XY and Heisenberg spin chains; it was first obtained by Dyson for a specific random harmonic oscillator chain). Simultaneously, the state at E=0E = 0 shows a universal, sub-exponential decay at large distances exp[r/r0]\sim \exp [ -\sqrt{r/r_0} ]. In this study, we consider singular, but normalizable, distributions of hopping, whose behavior at small tt is of the form 1/[tlnλ+1(1/t)]\sim 1/ [t \ln^{\lambda+1}(1/t) ], characterized by a single, continuously tunable parameter λ>0\lambda > 0. We find, using a combination of analytic and numerical methods, that while the universal result applies for λ>2\lambda > 2, it no longer holds in the interval 0<λ<20 < \lambda < 2. In particular, we find that the form of the density of states singularity is enhanced (relative to the Dyson result) in a continuous manner depending on the non-universal parameter λ\lambda; simultaneously, the localization length shows a less divergent form at low energies, and ceases to diverge below λ=1\lambda = 1. For λ<2\lambda < 2, the fall-off of the E=0E = 0 state at large distances also deviates from the universal result, and is of the form exp[(r/r0)1/λ]\sim \exp [-(r/r_0)^{1/\lambda}], which decays faster than an exponential for λ<1\lambda < 1.Comment: 14 pages, 7 figure

    Analyzing Timed Systems Using Tree Automata

    Get PDF
    Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata. The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. Such graphs can be interpreted in trees opening the way to tree automata based techniques which are more powerful than analysis based on word automata. The technique is quite general and applies to many timed systems. In this paper, as an example, we develop the technique on timed pushdown systems, which have recently received considerable attention. Further, we also demonstrate how we can use it on timed automata and timed multi-stack pushdown systems (with boundedness restrictions)

    Ulnar longitudinal deficiency: a rare case report and review

    Get PDF
    Ulnar hemimelia is a rare postaxial partial or complete longitudinal deficiency of ulna. It has an estimated incidence of 1/100,000-150,000 live births, with a male to female ratio of 3:2. There is usually ulnar deviation of hand and shortening of forearm. Radial head subluxation and fixed flexion deformity of the hand may be associated with it. Complex carpal, metacarpal, and digital abnormalities including absence of triquetrum, capitate and three fingered hand (tridactyly) are additional findings commonly found in association. Here, we present a case of a 17-year-old female with left sided ulnar club hand due to isolated partial ulnar aplasia

    Resilience of Timed Systems

    Get PDF
    This paper addresses reliability of timed systems in the setting of resilience, that considers the behaviors of a system when unspecified timing errors such as missed deadlines occur. Given a fault model that allows transitions to fire later than allowed by their guard, a system is universally resilient (or self-resilient) if after a fault, it always returns to a timed behavior of the non-faulty system. It is existentially resilient if after a fault, there exists a way to return to a timed behavior of the non-faulty system, that is, if there exists a controller which can guide the system back to a normal behavior. We show that universal resilience of timed automata is undecidable, while existential resilience is decidable, in EXPSPACE. To obtain better complexity bounds and decidability of universal resilience, we consider untimed resilience, as well as subclasses of timed automata
    corecore