相关论文: Precomplete clones on infinite sets which are clos…

We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…

In this note we show that pattern matching in permutations is polynomial time reducible to pattern matching in set partitions. In particular, pattern matching in set partitions is NP-Complete.

If we assume the axiom of choice, then every two cardinal numbers are comparable. In the absence of the axiom of choice, this is no longer so. For a few cardinalities related to an arbitrary infinite set, we will give all the possible…

It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…

We show that if a field A is not pseudo-finite, then there is no prime model of the theory of pseudo-finite fields over A. Assuming GCH, we generalise this result to \kappa-prime models, for \kappa a regular uncountable cardinal or…

We show that certain classes of modules have universal models with respect to pure embeddings. $Theorem.$ Let $R$ be a ring, $T$ a first-order theory with an infinite model extending the theory of $R$-modules and $K^T=(Mod(T), \leq_{pp})$…

It is unknown so far, whether the lattice of all varieties of monoids satisfies some non-trivial identity. The objective of this note is to give the negative answer to this question. Namely, we prove that any finite lattice is a homomorphic…

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

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…

In this article, we prove infinitary version of one to one correspondence theorem between clones and relational clones on a fixed possibly infinite set. We also characterize the relational clone corresponding to the clone of all finitary…

We show that every compact connected group is the limit of a continuous inverse sequence, in the category of compact groups, where each successor bonding map is either an epimorphism with finite kernel or the projection from a product by a…

We prove that critical percolation on any quasi-transitive graph of exponential volume growth does not have a unique infinite cluster. This allows us to deduce from earlier results that critical percolation on any graph in this class does…

The goal of this paper is threefold. First, we describe the notion of dissociation for closed subgroups of the group of permutations on a countably infinite set and explain its numerous consequences on unitary representations…

We study the construction of premonoidal categories, where the pentagon relation fails, through representations of finite group algebras and their quantum doubles. Both finite group algebras and their quantum doubles have a finite number of…

We give sufficient conditions when a topological inverse $\lambda$-polycyclic monoid $P_{\lambda}$ is absolutely $H$-closed in the class of topological inverse semigroups. Also, for every infinite cardinal $\lambda$ we construct the…

We prove that every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.

A variety is finitely universal if its lattice of subvarieties contains an isomorphic copy of every finite lattice. Examples of finitely universal varieties of semigroups have been available since the early 1970s, but it is unknown if there…

We show that for an infinite set X, if L is a completely distributive algebraic lattice with not more completely join irreducible elements than the size of the power set of X, then there is a monoidal interval in the clone lattice on X…

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties. In the present article, it is…