Related papers: A user's guide to cloning systems
The link with exponential families has allowed $k$-means clustering to be generalized to a wide variety of data generating distributions in exponential families and clustering distortions among Bregman divergences. Getting the framework to…
We describe a general procedure which allows to construct, starting from a given Hamiltonian, the whole family of new ones sharing the same set of unparameterized trajectories in phase space. The symmetry structure of this family can be…
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…
We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…
There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…
This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…
For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…
We consider a \emph{code} to be a subset of the vertex set of a \emph{Hamming graph}. In this setting a \emph{neighbour} of the code is a vertex which differs in exactly one entry from some codeword. This paper examines codes with the…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
We prove that the group of almost-automorphisms of the infinite rooted regular $d$-ary tree $\mathcal{T}_d$ arises naturally as the Thompson-like group of a so called $d$-ary cloning system. A similar phenomenon occurs for any…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
In machine learning datasets with symmetries, the paradigm for backward compatibility with symmetry-breaking has been to relax equivariant architectural constraints, engineering extra weights to differentiate symmetries of interest.…
The purpose of this paper is to consider some basic constructions in the category of compact quantum groups --for example de case of extensions, of Drinfeld twists, of matched pairs, of extensions, of linked pairs and of cocycle Singer…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform random graph models. In this paper we introduce a new,…
We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define…
The variation distance closure of an exponential family with a convex set of canonical parameters is described, assuming no regularity conditions. The tools are the concepts of convex core of a measure and extension of an exponential…