A disconnected cut of a connected graph is a vertex cut that itself also induces a disconnected subgraph. The decision problem whether a graph has a disconnected cut is called Disconnected Cut. This problem is closely related to several homomorphism and contraction problems, and fits in an extensive line of research on vertex cuts with additional properties. It is known that Disconnected Cut is...

Catalyzed by the work of Meese and Rogoff (1983), a large literature has documented the inability of empirical models to accurately forecast exchange rates out-of-sample. This paper extends the literature by introducing an empirical strategy that endogenously builds forecast models from a broad set of conventional exchange rate signals. The method is extremely flexible, allowing for potentially...

Throughout this paper, G denotes a fixed, not necessarily connected, reductive algebraic group over an algebraically closed field k. This paper is a part of a series [L9] which attempts to develop a theory of character sheaves on G. The numbering of the sections and references continues that of the earlier Parts. Section 23 is a generalization of results in [L3, II,§7]. It is a preparation for ...

We present evidence for disconnected contributions to the σπN term and the flavor singlet axial coupling g 0 A of the proton on full QCD configurations, which are obtained by means of improved stochastic estimator techniques. Furthermore we discuss results from the fermionic determination of the topological charge of the QCD vacuum (in the spirit of the Athiya-Singer theorem) again achieved wit...