Related papers: Analytic clones
A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
Unsupervised clustering, also known as natural clustering, stands for the classification of data according to their similarities. Here we study this problem from the perspective of complex networks. Mapping the description of data…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
This is the first in a series of three papers on Algebraic Set Theory. Its main purpose is to lay the necessary groundwork for the next two parts, one on Realisability and the other on Sheaf Models in Algebraic Set Theory.
We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…
We calculate the number of unary clones (submonoids of the full transformation monoid) containing the permutations, on an infinite base set. It turns out that this number is quite large, on some cardinals as large as the whole clone…
We introduce and study randomized sequential importance sampling algorithms for estimating the number of perfect matchings in bipartite graphs. In analyzing their performance, we establish various non-standard central limit theorems. We…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by means of allowed Boolean operators. Hereto we make use of…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
The first part of this article deals with theorems on uniqueness in law for \sigma-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two…
We herein introduce a new method of interpretable clustering that uses unsupervised binary trees. It is a three-stage procedure, the first stage of which entails a series of recursive binary splits to reduce the heterogeneity of the data…
Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this…
This study focuses on exploring the use of local interpretability methods for explaining time series clustering models. Many of the state-of-the-art clustering models are not directly explainable. To provide explanations for these…
We use the representation theory of preprojective algebras to construct and study certain cluster algebras related to semisimple algebraic groups.
Concept-based explanation approach is a popular model interpertability tool because it expresses the reasons for a model's predictions in terms of concepts that are meaningful for the domain experts. In this work, we study the problem of…
We show that on an infinite set, there exist no other precomplete clones closed under conjugation except those which contain all permutations. Since on base sets of some infinite cardinalities, in particular on countably infinite ones, the…
Concept-based interpretability methods offer a lens into the internals of foundation models by decomposing their embeddings into high-level concepts. These concept representations are most useful when they are compositional, meaning that…
Archetypal analysis is an exploratory tool that explains a set of observations as mixtures of pure (extreme) patterns. If the patterns are actual observations of the sample, we refer to them as archetypoids. For the first time, we propose…