Related papers: Compositions and parities of complete mappings and…

We consider pairs of finitely presented, residually finite groups $P\hookrightarrow\G$ for which the induced map of profinite completions $\hat P\to \hat\G$ is an isomorphism. We prove that there is no algorithm that, given an arbitrary…

For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the…

We investigate pairs of permutations $F,G$ of $\mathbb{F}_{p^n}$ such that $F(x+a)-G(x)$ is a permutation for every $a\in\mathbb{F}_{p^n}$. We show that necessarily $G(x) = \wp(F(x))$ for some complete mapping $-\wp$ of $\mathbb{F}_{p^n}$,…

A countable group $G$ is said to be \emph{matricial field} (MF) if it admits a strongly converging sequence of approximate homomorphisms into matrices; i.e, the norms of polynomials converge to those in the left regular representation. $G$…

A complete mapping of a group $G$ is a permutation $\phi:G\rightarrow G$ such that $g\mapsto g\phi(g)$ is also a permutation. Complete mappings of $G$ are equivalent to tranversals of the Cayley table of $G$, considered as a latin square.…

Given two subsets $X,Y$ of a finite group $G$, we write $\Pr(X,Y)$ for the probability that random elements $x \in X$ and $y \in Y$ commute. If $X,Y$ are subgroups, we denote by $\Pr^*(X,Y)$ the maximum real number $\epsilon$ with the…

In this paper, we consider an equivalence relation within the class of finitely presented discrete groups attending to their asymptotic topology rather than their asymptotic geometry. More precisely, we say that two finitely presented…

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…

Let $G$ be a finite group and $p^k$ be a prime power dividing $|G|$. A subgroup $H$ of $G$ is called to be $\mathcal{M}$-supplemented in $G$ if there exists a subgroup $K$ of $G$ such that $G=HK$ and $H_iK<G$ for every maximal subgroup…

Let $G$ be a connected reductive group defined over $\mathbb F_q$. Fix an integer $M\geq 2$, and consider the power map $x\mapsto x^M$ on $G$. We denote the image of $G(\mathbb F_q)$ under this map by $G(\mathbb F_q)^M$ and estimate what…

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Let us call a (para)topological group \emph{strongly submetrizable} if it admits a coarser separable metrizable (para)topological group topology. We present a characterization of simply $sm$-factorizable (para)topo\-logical groups by means…

An important theorem of Ling states that if $G$ is any factorizable non-fixing group of homeomorphisms of a paracompact space then its commutator subgroup $[G,G]$ is perfect. This paper is devoted to further studies on the algebraic…

Two $G$-sets ($G$ a finite group) are called linearly equivalent over a commutative ring $k$ if the permutation representations $k[X]$ and $k[Y]$ are isomorphic as modules over the group algebra $kG$. Pairs of linearly equivalent…

The enumeration of perfect matchings of graphs is equivalent to the dimer problem which has applications in statistical physics. A graph $G$ is said to be $n$-rotation symmetric if the cyclic group of order $n$ is a subgroup of the…

We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

For G a group and g in G, we define mappings pg(G) and lg(G) from G into G by pg(x)=[x,g] and lg(x)=[g,x]. We let P(G) and L(G) denote the subsemigroups of the set of all mappings from G to G generated by {pg: g in G} and {lg: g in G},…

For a group $G$, we construct a quasi morphism from its left orderings and the map from the space of left orderings to the second bounded cohomology. We show that these maps reflect various properties of the group orderings.

Let $\mathbb{F}_2^\omega$ denote the countably infinite dimensional vector space over the two element field and $\operatorname{GL}(\omega, 2)$ its automorphism group. Moreover, let $\operatorname{Sym}(\mathbb{F}_2^\omega)$ denote the…