Related papers: Precomplete clones on infinite sets which are clos…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

Given an infinite set X and an ideal I of subsets of X, the set of all finitary operations on X which map all (powers of) I-small sets to I-small sets is a clone. In a 2001 article, G. Czedli and L. Heindorf asked whether or not for two…

We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion…

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

It is shown that if an infinite synchronized system has a flip, then it has infinitely many non-conjugate flips, and that the result cannot be extended to the class of coded systems.

For finite permutation groups, simplicity of the augmentation submodule is equivalent to $2$-transitivity over the field of complex numbers. We note that this is not the case for transformation monoids. We characterize the finite…

In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.

We prove simplicity for incomplete rank 2 Kac-Moody groups over algebraic closures of finite fields with trivial commutation relations between root groups corresponding to prenilpotent pairs. We don't use the (yet unknown) simplicity of the…

We show that any clone over a finite domain that has a quasi Maltsev operation and fully symmetric operations of all arities has an incoming minion homomorphism from I, the clone of all idempotent operations on a two element set. We use…

Here we show that a finite nilpotent group is 2-closed if and only if it is either cyclic or a direct product of a generalized quaternion group with a cyclic group of odd order.

The inability to produce two perfect copies of an unknown state is inherently linked with the inability to produce maximal entanglement between multiple spins. Despite this, there is no quantitative link between how much entanglement can be…

We consider the property of unique parallel decomposition modulo branching and weak bisimilarity. First, we show that infinite behaviours may fail to have parallel decompositions at all. Then, we prove that totally normed behaviours always…

This is a survey on factorization theory. We discuss finitely generated monoids (including affine monoids), primary monoids (including numerical monoids), power sets with set addition, Krull monoids and their various generalizations, and…

A general procedure is presented which associates to a finite crossed module a premodular category, generalizing the representation categories of a finite group and of its double, and the extent to which the resulting category fails to be…

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…

We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…

The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…

We show that there are infinitely many distinct closed classes of colimits (in the sense of the Galois connection induced by commutation of limits and colimits in Set) which are intermediate between the class of pseudo-filtered colimits and…

In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…