English
Related papers

Related papers: Basic Subtoposes of the Effective Topos

200 papers

This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of…

Computational Complexity · Computer Science 2017-06-20 Laurent Bartholdi , Dzmitry Dudko

We consider an integral operator $\mathcal{I}$, special instances of which was studied in various contexts. Using an appropriate transformation we write this operator in terms of weighted composition operators. Then, we provide a…

Complex Variables · Mathematics 2012-04-16 Epaminondas Diamantopoulos

Motivated by the definition of the smooth manifold structure on a suitable mapping space, we consider the general problem of how to transfer local properties from a smooth space to an associated mapping space. This leads to the notion of…

Differential Geometry · Mathematics 2013-01-24 Andrew Stacey

Stone locales together with continuous maps form a coreflective subcategory of spectral locales and perfect maps. A proof in the internal language of an elementary topos was previously given by the second-named author. This proof can be…

Logic in Computer Science · Computer Science 2023-06-22 Ayberk Tosun , Martín Hötzel Escardó

We introduce a new method which enables us to calculate the coefficients of the poles of local zeta functions very precisely and prove some explicit formulas. Some vanishing theorems for the candidate poles of local zeta functions will be…

Complex Variables · Mathematics 2009-03-26 Toshihisa Okada , Kiyoshi Takeuchi

Effective resistance is an important metric that measures the similarity of two vertices in a graph. It has found applications in graph clustering, recommendation systems and network reliability, among others. In spite of the importance of…

Data Structures and Algorithms · Computer Science 2021-06-08 Pan Peng , Daniel Lopatta , Yuichi Yoshida , Gramoz Goranci

Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In…

Artificial Intelligence · Computer Science 2009-10-08 Quang Dung Pham , Yves Deville , Pascal Van Hentenryck

Well-founded fixed points have been used in several areas of knowledge representation and reasoning and to give semantics to logic programs involving negation. They are an important ingredient of approximation fixed point theory. We study…

Discrete Mathematics · Computer Science 2015-12-02 Arnaud Carayol , Zoltan Esik

We consider the locally measure topology $t(\mathcal{M})$ on the *-algebra $LS(\mathcal{M})$ of all locally measurable operators affiliated with a von Neumann algebra $\mathcal{M}$. We prove that $t(\mathcal{M})$ coincides with the…

Operator Algebras · Mathematics 2010-01-12 V. I. Chilin , M. A. Muratov

In the present paper, we examine in detail the method of "graph compactifications" of topological groups. The graph and Ellis methods of constructing proper compactifications of topological groups are applied for the investigation of…

General Topology · Mathematics 2026-04-28 K. L. Kozlov , A. G. Leiderman

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-04-01 Fabian Kuhn , Thomas Moscibroda , Roger Wattenhofer

When ontologies reach a certain size and complexity, faults such as inconsistencies, unsatisfiable classes or wrong entailments are hardly avoidable. Locating the incorrect axioms that cause these faults is a hard and time-consuming task.…

Artificial Intelligence · Computer Science 2022-08-08 Patrick Rodler , Michael Eichholzer

In the scope of discrete finite-state models of interacting components, we present a novel algorithm for identifying sets of local states of components whose activity is necessary for the reachability of a given local state. If all the…

Systems and Control · Computer Science 2013-07-15 Loïc Paulevé , Geoffroy Andrieux , Heinz Koeppl

Limited resources motivate decomposing large-scale problems into smaller,``local" subsystems and stitching together the so-found solutions. We explore the physics underlying this approach and discuss the concept of ``local hardness", i.e.,…

Disordered Systems and Neural Networks · Physics 2025-12-24 Mutian Shen , Gerardo Ortiz , Zhiqiao Dong , Martin Weigel , Zohar Nussinov

On two subspaces of the Bruhat-Tits tree, effective actions are calculated. The limits of these effective field theories are found to be the same conformal field theory over p-adic numbers when subspaces are taken to the boundary of the…

High Energy Physics - Theory · Physics 2024-07-02 Feng Qu

In recent years there has been interest in the theory of local computation over probabilistic Bayesian graphical models. In this paper, local computation over Bayes linear belief networks is shown to be amenable to a similar approach.…

bayes-an · Physics 2008-02-03 Darren J Wilkinson

Let $X$ be a vector lattice and $(E,\tau)$ be a locally solid vector lattice. An operator $T:X\to E$ is said to be $ob$-bounded if, for each order bounded set $B$ in $X$, $T(B)$ is topologically bounded in $E$. In this paper, we study on…

Functional Analysis · Mathematics 2018-02-12 Abdullah Aydın

We generalize Roe's index theorem for graded generalized Dirac operators on amenable manifolds to multigraded elliptic uniform pseudodifferential operators. The generalization will follow from a local index theorem that is valid on any…

Differential Geometry · Mathematics 2018-06-07 Alexander Engel

This note provides a detailed algorithm to the application of local (perturbation) analysis of differential equations which is normally taught at graduate math courses. Exercise books often present more abstract and simplified versions of…

Classical Analysis and ODEs · Mathematics 2017-10-05 Alexander Maslov , David Amundsen

Besides the complexity in time or in number of messages, a common approach for analyzing distributed algorithms is to look at the assumptions they make on the underlying network. We investigate this question from the perspective of network…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-05-02 Arnaud Casteigts , Serge Chaumette , Afonso Ferreira