Related papers: Minimal operations over permutation groups
We determine whether each known generating set of arbitrary oriented Reidemeister moves is minimal. We then provide a complete classification of minimal generating sets that include a coherent Reidemeister move of type II. We also classify…
We study relatively minimal subgroups in topological groups. We find, in particular, some natural relatively minimal subgroups in unipotent groups which are defined over "good" rings. By "good" rings we mean archimedean absolute valued (not…
In 1986, the second author classified the minimal clones on a finite universe into five types. We extend this classification to infinite universes and to multiclones. We show that every non-trivial clone contains a "small" clone of one of…
A classification is given of rank 3 group actions which are quasiprimitive but not primitive. There are two infinite families and a finite number of individual imprimitive examples. When combined with earlier work of Bannai, Kantor,…
We characterize minimal clones generated by a majority function containing at most seven ternary operations.
Let X be a smooth projective variety of dimension n on which a simple Lie group G acts regularly and non trivially. Then X is not minimal in the sense of the Minimal Model Program. In the paper we work out a classification of X via the…
We determine the groups of minimal order in which all groups of order n can embedded for 1 < n < 16. We further determine the order of a minimal group in which all groups or order n or less can be embedded, also for 1 < n < 16.
We continue the analysis of prime and semiprime operations over one-dimensional domains started in \cite{Va}. We first show that there are no bounded semiprime operations on the set of fractional ideals of a one-dimensional domain. We then…
It is well known that any two diagrams representing the same oriented link are related by a finite sequence of Reidemeister moves O1, O2 and O3. Depending on orientations of fragments involved in the moves, one may distinguish 4 different…
We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with…
We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…
Adams operations are the natural transformations of the representation ring functor on the category of finite groups, and they are one way to describe the usual lambda-ring structure on these rings. From the representation-theoretical point…
We present two minimal clones containing 26 and 78 majority operations respectively, more than any other previously known example.
Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…
We show that a minimal counter example to the Cherlin-Zilber Algebraicity Conjecture for simple groups of finite Morley rank has normal 2-rank at most two, which is a tameness free version of Borovik's original trichotomy theorem. This…
We investigate the class of bisymmetric and quasitrivial binary operations on a given set $X$ and provide various characterizations of this class as well as the subclass of bisymmetric, quasitrivial, and order-preserving binary operations.…
We determine all majority operations on a four-element set that generate a minimal clone.
We construct locally compact groups with no non-trivial Invariant Random Subgroups and no non-trivial Uniformly Recurrent Subgroups.
Two variants of generalizations of Hankel operators to the case of linearly ordered abelian groups are considered, criteria of the boundedness and compactness of these operators are given, among them in terms of functions of bounded mean…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…