Related papers: Multisorted Boolean Clones Determined by Binary Re…
Using a categorial version of Fra\"iss\'e's theorem due to Droste and G\"obel, we derive a criterion for a comma-category to have universal homogeneous objects. As a first application we give new existence result for universal structures…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
Similarity scores in face recognition represent the proximity between pairs of images as computed by a matching algorithm. Given a large set of images and the proximities between all pairs, a similarity score space is defined. Cluster…
We establish Multilayer Correlation Clustering, a novel generalization of Correlation Clustering to the multilayer setting. In this model, we are given a series of inputs of Correlation Clustering (called layers) over the common set $V$ of…
Classes of multisorted minions closed under extensions, reflections, and direct powers are considered from a relational point of view. As a generalization of a result of Barto, Opr\v{s}al, and Pinsker, the closure of a multisorted minion is…
The feasibility of a classification-by-rank program for modular categories follows from the Rank-Finiteness Theorem. We develop arithmetic, representation theoretic and algebraic methods for classifying modular categories by rank. As an…
We first determine the maximal clones on a set X of infinite regular cardinality which contain all permutations but not all unary functions, extending a result of Heindorf's for countably infinite X. If |X| is countably infinite or weakly…
This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the structure of core sets. When $F$ is a finite field of prime…
We present two minimal clones containing 26 and 78 majority operations respectively, more than any other previously known example.
We introduce the notion of clone algebra, intended to found a one-sorted, purely algebraic theory of clones. Clone algebras are defined by true identities and thus form a variety in the sense of universal algebra. The most natural clone…
We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…
We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we…
We consider a few types of bounded homomorphisms on a topological group. These classes of bounded homomorphisms are, in a sense, weaker than the class of continuous homomorphisms. We show that with appropriate topologies each class of these…
We study surface representatives of homology classes of finite complexes which minimize certain complexity measures, including its genus and Euler characteristic. Our main result is that up to surgery at nullhomotopic curves minimizers are…
The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…
This article is devoted to investigations of a structure and homomorphisms of microbundles. Microbundles are generalizations of manifolds. For manifolds it was studied when their families of homomorphism can be supplied with the manifold…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…
This paper considers networks where relationships between nodes are represented by directed dissimilarities. The goal is to study methods that, based on the dissimilarity structure, output hierarchical clusters, i.e., a family of nested…