The known exact solutions of Einstein's vacuum field equations modeling the gravitational fields pure radiation involve wave fronts which are either planar or roughly spherical. We describe a scheme designed to check explicitly whether not collide. From spacetime point view determines null hypersurface histories intersect and, in particular, allows easy identification cases hypersurfaces do int...

Using the Birman exact sequence for pure mapping class groups, we construct a universal Cannon-Thurston map onto boundary of curve complex surface with punctures call surviving complex. Along way prove hyperbolicity this and identify its as space laminations. As corollary obtain to ordinary complex, extending earlier work second author Mj Schleimer [Comment. Math. Helv. 86 (201...

Mobility edges (ME), i.e. critical energies which separate absolutely continuous spectrum and pure point spectrum, is an important issue in quantum physics. So far there are two experimentally feasible 1D quasiperiodic models that have been discovered to exact mobility edges. However, all the theoretical studies remained at numerical level. In this paper, we rigorously prove precisely locate of...

Abstract Husserl’s most systematic phenomenological work, Ideas for a Pure Phenomenology and Phenomenological Philosophy. First Book: General Introduction to (Ideas I) (Husserl, 2014), differentiates pure transcendental phenomenology, as an eidetic science, from the science of mathematics. In line with tradition philosophy arguably—ante rem—stretching back Plato, Husserl contrasts phenomenology...

Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.

Realization of efficient Universal Logic Modules (ULMs) is a challenging topic in circuit design. The goal is to find a representation that allows to realize as many Boolean functions as possible by permutation of inputs or phase assignment. In this paper an exact algorithm for finding a minimal circuit for a ULM is presented. The approach is parametrisized in several ways, e.g. the user can de...

In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than...

This paper presents an algorithm for comparing large numbers of traces to each other and identifying and presenting groups of traces with similar features. It is applied to forensic analysis in which groups of similar traces are automatically identified and presented so that attribution and other related claims may be asserted, and independently confirmed or refuted. The approach of this paper ...

Recent research on qualitative reasoning has focussed on representing and reasoning about events that occur repeatedly. Allen's interval algebra has been modiied to model events that are collections of convex intervals|a non-convex interval. Using the modiied version of Allen's algebra, constraint-based algorithms have been investigated for nding feasible relations in a network of non-convex in...