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

We show that it is consistent with the axioms of set theory that every infinite profinite group G possesses a closed subset X of Haar measure zero such that less than continuum many translates of X cover G. This answers a question of Elekes…

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

The fact that the cocommutative comonoids in a symmetric monoidal category form the best possible approximation by a cartesian category is revisited when the original category is only braided monoidal. This leads to the question when the…

In this note, it is proved the existence of an infinitely generated multiplicative group consisting of entire functions that are, except for the constant function 1, hypercyclic with respect to the convolution operator associated to a given…

We investigate the lattice of clones that are generated by a set of functions that are induced on a finite field $\mathbb{F}$ by monomials. We study the atoms and coatoms of this lattice and investigate whether this lattice contains…

We solve two related extremal problems in the theory of permutations. A set $Q$ of permutations of the integers 1 to $n$ is inversion-complete (resp., pair-complete) if for every inversion $(j,i)$, where $1 \le i \textless{} j \le n$,…

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…

We show that the Double Coset Membership problem for permutation groups possesses perfect zero-knowledge proofs.

We give an example of a finitely based locally finite variety which has uncountably many term clones. (Such varieties were known before.)

In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of o-polynomials, we obtain a class of permutation polynomials of the form…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We use a method from descriptive set theory to investigate the two precomplete clones above the unary clone on a countable set.

It is known that that the centralizer of a matrix over a finite field depends, up to conjugacy, only on the type of the matrix, in the sense defined by J. A. Green. In this paper an analogue of the type invariant is defined that in general…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…

We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of…

We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…