Related papers: A general form of relative recursion
Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been…
Principal Component Analysis (PCA) is a transform for finding the principal components (PCs) that represent features of random data. PCA also provides a reconstruction of the PCs to the original data. We consider an extension of PCA which…
We prove a categorical duality between a class of abstract algebras of partial functions and a class of (small) topological categories. The algebras are the isomorphs of collections of partial functions closed under the operations of…
In this note, we provide some categorical perspectives on the relativization construction arising from quantum measurement theory in the presence of symmetries and occupying a central place in the operational approach to quantum reference…
In this work, we construct some irreducible components of the space of two-dimensional holomorphic foliations on $\mathbb{P}^n$ associated to some algebraic representations of the affine Lie algebra $\mathfrak{aff}(\mathbb{C})$. We give a…
Let $M$ be a monoid, $\mathscr{C}$ a category with pullbacks and $X$ an object of $\mathscr{C}$. We introduce the notion of a partial action $\alpha$ of $M$ on $X$ and study the globalization question for $\alpha$. If $\alpha$ admits a…
We show that either of the two reasonable choices for the category of compact quantum groups is nice enough to allow for a plethora of universal constructions, all obtained "by abstract nonsense" via the adjoint functor theorem. This…
Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…
Let $p$ be a polynomial in one variable whose roots either all have multiplicity more than 1 or all have multiplicity exactly 1. It is shown that the universal $C^*$-algebra of a relation $p(x)=0$, $\|x\| \le 1$ is semiprojective. In the…
We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability…
Starting from an arbitrary endomorphism $\alpha$ of a unital C*-algebra $A$ we construct a bigger C*-algebra $B$ and extend $\alpha$ onto $B$ in such a way that the extended endomorphism $\alpha$ has a unital kernel and a hereditary range,…
A process algebra is proposed, whose semantics maps a term to a nondeterministic finite automaton (NFA, for short). We prove a representability theorem: for each NFA $N$, there exists a process algebraic term $p$ such that its semantics is…
The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…
Principal component analysis (PCA) is a widespread technique for data analysis that relies on the covariance-correlation matrix of the analyzed data. However to properly work with high-dimensional data, PCA poses severe mathematical…
Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations in categories over a base category X are considered. In particular, we illustrate the formulas (|P)x = ten(x/X,P) ; (P|)x = hom(X/x,P) which…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
Given a partial action $\theta$ of a group on a set with an algebraic structure, we construct a reflector of $\theta$ in the corresponding subcategory of global actions and study the question when this reflector is a globalization. In…
Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal,…