English
Related papers

Related papers: Computably Based Locally Compact Spaces

200 papers

The intrinsic dimensionality refers to the ``true'' dimensionality of the data, as opposed to the dimensionality of the data representation. For example, when attributes are highly correlated, the intrinsic dimensionality can be much lower…

Machine Learning · Statistics 2020-11-30 Erik Thordsen , Erich Schubert

It is now a classical result that an algebraic space locally of finite type over $\mathbf{C}$ is analytifiable if and only if it is locally separated. In this paper we study non-archimedean analytifications of algebraic spaces. We construct…

Algebraic Geometry · Mathematics 2007-06-26 Brian Conrad , Michael Temkin

Dual lattice is an important concept of Euclidean lattices. In this paper, we first give the right definition of the concept of the dual lattice of a $p$-adic lattice from the duality theory of locally compact abelian groups. The concrete…

Number Theory · Mathematics 2024-01-26 Yingpu Deng

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

Logic · Mathematics 2025-12-12 Eike Neumann , Arno Pauly , Cécilia Pradic , Manlio Valenti

Stone duality generalizes to an equivalence between the categories $\mathsf{Stone}^{\mathsf{R}}$ of Stone spaces and closed relations and $\mathsf{BA}^\mathsf{S}$ of boolean algebras and subordination relations. Splitting equivalences in…

General Topology · Mathematics 2025-01-28 Marco Abbadini , Guram Bezhanishvili , Luca Carai

Closure spaces are a generalisation of topological spaces obtained by removing the idempotence requirement on the closure operator. We adapt the standard notion of bisimilarity for topological models, namely Topo-bisimilarity, to closure…

Logic in Computer Science · Computer Science 2021-05-17 Vincenzo Ciancia , Diego Latella , Mieke Massink Erik de Vink

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

Differential Geometry · Mathematics 2025-05-09 Jonathan Kress , Konrad Schöbel , Andreas Vollmer

We extend Stone duality to a fully faithful embedding of condensed sets into fpqc sheaves over an arbitrary field, which preserves colimits and finite limits. We study how familiar notions from condensed mathematics/topology and algebraic…

Algebraic Geometry · Mathematics 2024-01-08 Rok Gregoric

In this paper, we introduce a deformation analysis of index theory over non compact manifolds, by use of new functional spaces which are the reduced version of Sobolev spaces. It allows to construct Fredholm theory for elliptic differential…

Differential Geometry · Mathematics 2013-12-24 Tsuyoshi Kato

In this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from…

Logic in Computer Science · Computer Science 2024-11-19 Valentin Maestracci , Paolo Pistone

Non-Abelian Lattice Gauge Theory in Euclidean space-time of dimension d>=2 whose gauge group is any compact Lie group is related to a Spin Foam Model by an exact strong-weak duality transformation. The group degrees of freedom are…

High Energy Physics - Lattice · Physics 2008-11-26 Hendryk Pfeiffer , Robert Oeckl

The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-08-09 Hagit Attiya , Armando Castañeda , Thomas Nowak

The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the…

Logic in Computer Science · Computer Science 2021-01-19 Daniel O. Martínez-Rivillas , Ruy J. G. B. de Queiroz

v2: An additional assumption was added in Theorem 4.8. In order to show that a connected abelian group is admissible on the site of locally compact spaces we must in addition assume that it is locally topologically divisible. This condition…

Algebraic Topology · Mathematics 2018-11-28 Ulrich Bunke , Thomas Schick , Markus Spitzweck , Andreas Thom

We investigate the connections between computability theory and Nonstandard Analysis. In particular, we investigate the two following topics and show that they are intimately related. (T.1) A basic property of Cantor space $2^{\mathbb{N}}$…

Logic · Mathematics 2020-02-19 Dag Normann , Sam Sanders

The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…

Graphics · Computer Science 2019-04-03 Franco Morando

Stone-type dualities provide a powerful mathematical framework for studying properties of logical systems. They have recently been fruitfully explored in understanding minimisation of various types of automata. In Bezhanishvili et al.…

Formal Languages and Automata Theory · Computer Science 2020-05-26 Nick Bezhanishvili , Marcello Bonsangue , Helle Hvid Hansen , Dexter Kozen , Clemens Kupke , Prakash Panangaden , Alexandra Silva

De Vries Duality generalizes Stone duality between Boolean algebras and Stone spaces to a duality between de Vries algebras (complete Boolean algebras equipped with a subordination relation satisfying some axioms) and compact Hausdorff…

Logic · Mathematics 2022-06-28 Guillaume Massas

Extensions of Stone-type dualities have a long history in algebraic logic and have also been instrumental in proving results in algebraic language theory. We show how to extend abstract categorical dualities via monoidal adjunctions,…

Formal Languages and Automata Theory · Computer Science 2025-10-15 Fabian Lenke , Henning Urbat , Stefan Milius

Topology may be interpreted as the study of verifiability, where opens correspond to semi-decidable properties. In this paper we make a distinction between verifiable properties themselves and processes which carry out the verification…

General Topology · Mathematics 2026-04-15 Peter F. Faul , Graham Manuell
‹ Prev 1 3 4 5 6 7 10 Next ›