Related papers: Negative definite functions and a dynamical charac…
Regression tasks, notably in safety-critical domains, require proper uncertainty quantification, yet the literature remains largely classification-focused. In this light, we introduce a family of measures for total, aleatoric, and epistemic…
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…
We discuss definable compactifications and topological dynamics. For G a group definable in some structure M, we define notions of "definable" compactification of G and "definable" action of G on a compact space X (definable G-flow), where…
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…
We introduce a method to construct general multivariate positive definite kernels on a nonempty set $X$ that employs a prescribed bounded completely monotone function and special multivariate functions on $X$.\ The method is consistent with…
Let $PD(\mathbb{R})$ be the family of continuous positive definite functions on $\mathbb{R}$. For an integer $n>1$, a $f\in PD(\mathbb{R})$ is called $n$-divisible if there is $g\in PD(\mathbb{R})$ such that $g^n=f$. Some properties of…
Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…
We investigate the complexity of LTL learning, which consists in deciding given a finite set of positive ultimately periodic words, a finite set of negative ultimately periodic words, and a bound B given in unary, if there is an LTL-formula…
We define a notion of super-transitivity for \`etale algebra objects $A \in \mathcal{C}(\mathfrak{sl}_N, k)$. This definition is a direct analogue of the notion of super-transitivity for subfactors, and measures at what depth the first…
Using Godement mean on the Fourier-Stieltjes algebra of a locally compact quantum group we obtain strong separation results for quantum positive-definite functions associated to a subclass of representations, strengthening for example the…
Neural classifiers are non linear systems providing decisions on the classes of patterns, for a given problem they have learned. The output computed by a classifier for each pattern constitutes an approximation of the output of some unknown…
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable…
We describe the norming sets for the space of global holomorphic sections to a $k$-power of a positive holomorphic line bundle on a compact complex manifold $X$. We characterize in metric terms the sequence of measurable subsets…
We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…
This work introduces and investigates the function $J(G) = \frac{\text{Nil}(G)}{L(G)}$, where $\text{Nil}(G)$ denotes the number of nilpotent subgroups and $L(G)$ the total number of subgroups of a finite group $G$. The function $J(G)$,…
SJT reducibility between sets $A,B \subseteq \mathbb N$ is defined by $A \le_{SJT} B$ if for each computable function $h$ that is unbounded and nondecreasing, there is an $h$-bounded uniformly $B$-c.e.\ trace $(T_n)_{n \in \mathbb N} $ such…
We investigate the notion of conditionally positive definite in the context of Hilbert $C^*$-modules and present a characterization of the conditionally positive definiteness in terms of the usual positive definiteness. We give a Kolmogorov…
Diversities are a generalization of metric spaces in which a non-negative value is assigned to all finite subsets of a set, rather than just to pairs of points. Here we provide an analogue of the theory of negative type metrics for…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…