English
Related papers

Related papers: Domain Representable Spaces Defined by Strictly Po…

200 papers

Algebraic characterizations of the computational aspects of functions defined over the real numbers provide very effective tool to understand what computability and complexity over the reals, and generally over continuous spaces, mean. This…

Logic in Computer Science · Computer Science 2016-09-27 Olivier Bournez , Walid Gomaa , Emmanuel Hainry

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Weihrauch , Nazanin Tavana-Roshandel

we prove that if $X$ is a locally compact $\sigma$-compact space then on its quotient, $\gamma(X)$ say, determined by the algebra of all real valued bounded continuous functions on $X$, the quotient topology and the completely regular…

General Topology · Mathematics 2008-11-21 Aldo J. Lazar

The relation between representations and positive definite functions is a key concept in harmonic analysis on topological groups. Recently this relation has been studied on topological groupoids. This is the first in a series of papers in…

Operator Algebras · Mathematics 2007-05-23 Massoud Amini , Alireza Medghalchi

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy

The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…

Logic in Computer Science · Computer Science 2021-07-19 Qinxiang Cao , Xiwei Wu

This paper is intended to give closed formulae for binomial determinants with consecutive or almost consecutive rows or columns, as well as calculating the generator of left nullspaces defined by some binomial matrices. In the meantime, we…

Combinatorics · Mathematics 2026-04-01 Laura González , Francesc Planas-Vilanova

The well known ideal presentations of countably based domains were recently extended to (effective) quasi-Polish spaces. Continuing these investigations, we explore some classes of effective quasi-Polish spaces. In particular, we prove an…

Logic · Mathematics 2023-01-23 Matthew de Brecht , Takayuki Kihara , Victor Selivanov

A strong backdoor in a formula $\phi$ of propositional logic to a tractable class $\mathcal{C}$ of formulas is a set $B$ of variables of $\phi$ such that every assignment of the variables in $B$ results in a formula from $\mathcal{C}$.…

Data Structures and Algorithms · Computer Science 2021-02-10 Nikolas Mählmann , Sebastian Siebertz , Alexandre Vigny

It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…

High Energy Physics - Theory · Physics 2009-10-29 Jurgen Fuchs , Christoph Schweigert , Carl Stigner

We define basic notions in the category of conic representations of a topological group and prove elementary facts about them. We show that a conic representation determines an ordinary dynamical system of the group together with a…

Dynamical Systems · Mathematics 2019-03-25 Matan Tal

In this article we discuss the relationship between three types of locally convex spaces: docile spaces, Mackey first countable spaces, and sequentially Mackey first countable spaces. More precisely, we show that docile spaces are…

Relational semigroups with domain and range are a useful tool for modelling nondeterministic programs. We prove that the representation class of domain-range semigroups with demonic composition is not finitely axiomatisable. We extend the…

Logic in Computer Science · Computer Science 2021-08-26 Jaš Šemrl

We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…

Logic in Computer Science · Computer Science 2023-06-22 Łukasz Czajka

Topical maps are a nonlinear generalization of nonnegative matrices acting on the interior of the standard cone $\mathbb{R}^n_{\ge 0}$. Several analogues of irreducibility have been defined for topical maps, and all are sufficient to…

Functional Analysis · Mathematics 2025-10-15 Brian Lins

We consider finite approximations of a topological space $M$ by noncommutative lattices of points. These lattices are structure spaces of noncommutative $C^*$-algebras which in turn approximate the algebra $\cc(M)$ of continuous functions…

High Energy Physics - Theory · Physics 2010-11-19 G. Bimonte , E. Ercolessi , G. Landi , F. Lizzi , G. Sparano , P. Teotonio-Sobrinho

As is well known, an external magnetic field in configuration space coupled to a quantum dynamics induces noncommutativity in its velocity momentum space. By phase space duality, an external vector potential in the conjugate momentum sector…

Quantum Physics · Physics 2024-01-09 Jan Govaerts

Based on a new coinductive characterization of continuous functions we extract certified programs for exact real number computation from constructive proofs. The extracted programs construct and combine exact real number algorithms with…

Logic in Computer Science · Computer Science 2015-07-01 Ulrich Berger

Generalized derivatives and infinitesimal spaces generalize the idea of derivatives to mappings which need not be differentiable. It is particularly powerful in the context of quasiregular mappings, where normal family arguments imply…

Dynamical Systems · Mathematics 2016-02-22 Alastair Fletcher , Doug Macclure , James Waterman , Sarah Wesley

The applicability domain refers to the range of data for which the prediction of the predictive model is expected to be reliable and accurate and using a model outside its applicability domain can lead to incorrect results. The ability to…

Machine Learning · Computer Science 2024-11-05 Shakir Khurshid , Bharath Kumar Loganathan , Matthieu Duvinage