We prove that the Schrödinger operator H =-- ~ + V(x)+F-x has ax purely absolutely continuous spectrum for arbitrary constant external field F, for a large class of potentials this result applies to many periodic, almost periodic and random potentials and in particular to random wells

⊆ F n 2 v ∈ F n 2 that is far from L. We say that an algorithm achieves a remoteness of r for the RPP if it always outputs a point v that is at least r-far from L. In this paper we present a deterministic polynomial time algorithm that achieves a remoteness of Ω(n log k/k) for all k ≤ n/2. We motivate

In this paper, we present the Disco Deterministic Network Calculator v2 – our continuation in the effort to provide open-source tool support for worst-case performance anal-ysis. The major achievement of this release is the provi-sion of a well-documented network calculus implementation

We consider the construction of Markov chain approximations for an important class of deterministic control problems. The emphasis is on the construction of schemes that can be easily implemented and which possess a number of highly desirable qualitative properties. The class of problems covered

Quantum dynamics are reversible, deterministic and continuous. However, quantum measurements are irreversible, non-deterministic, and discontinuous. Can we describe both dynamics and measurement continuously? Continuous decompositions as random walks In [OB05] it was shown that any quantum

Every regular expression can be transformed into a Nondeterministic Finite Automaton (NFA) with or without �-transitions. A well known algorithm called subset construction technique is used for conversion of NFA into DFA. In this paper, initially, the construction of the position automaton is given for the same. Also, the algorithm to convert this Position Automaton into DFA using subset construction technique is discussed. AMS MSC2010 Certification: 68Q45, 68Q70

We derive deterministic polynomial time algorithms for book embedding of a graph G = (V, E), |V| = n and |E| = m. In particular, we present the first deterministic polynomial time algorithm to embed any bipartite graph in O(sqrt(m)) pages. We then use this algorithm to embed, in polynomial time

minimal fixpoints can be defined inductively. Moreover, the submodel relation can be captured within the algebra by summation (x v y iff x + y = y); therefore the effect of fixpoints can be captured by an infinitary proof rule, yielding a complete proof system for recursively defined deterministic event

models, which are tuples 〈X, T, f, V 〉, where 〈X, T 〉 is a topological space, f a function on X and V a truth valuation assigning subsets of X to propositional variables. Our main result is that the set of valid formulas of DT L over spaces with continuous functions is recursively enumerable. We do

briefly explain the present situation in the quantum field theory of fully developed turbulence of incompressible fluid which has been developed for the last two decades (see [1] for a review). In order to be specific we consider the correlator K = 〈v(k)v(−k) 〉 of the velocity field v in the momentum