Related papers: Bounding the composition length of primitive permu…

The article is devoted to the question whether the orbit space of a compact linear group is a topological manifold and a homological manifold. In the paper, the case of a simple three-dimensional group is considered. An upper bound is…

We provide polynomial upper bounds on the size of a shortest solution for quadratic equations in a free group. A similar bound is given for parametric solutions in the description of solutions sets of quadratic equations in a free group.

We classify all non-degenerate skew-hermitian forms defined over certain local rings, not necessarily commutative, and study some of the fundamental properties of the associated unitary groups, including their orders when the ring in…

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…

We study definably primitive pseudo-finite permutation groups of finite $SU$-rank. We show that if $(G,X)$ is such a permutation group, then the rank of $G$ can be bounded in terms of the rank of $X$, providing an analogue of a theorem of…

Let $G$ be a finite group of order $n$, and denote by $\rho(G)$ the product of element orders of $G$. The aim of this work is to provide some upper bounds for $\rho(G)$ depending only on $n$ and on its least prime divisor, when $G$ belongs…

Given a commutative unital ring $R$, we show that the finiteness length of a group $G$ is bounded above by the finiteness length of the Borel subgroup of rank one $\mathbf{B}_2^\circ(R)=\left( \begin{smallmatrix} * & * \\ 0 & *…

We present lower bounds for the orbit length of reduction modulo primes of parametric polynomial dynamical systems defined over the integers, under a suitable hypothesis on its set of preperiodic points over $\mathbb C$. Applying recent…

The blow-up construction by L. G. Kov\'acs has been a very useful tool to study embeddings of finite primitive permutation groups into wreath products in product action. In the present paper we extend the concept of a blow-up to finite…

Modelled on efficient algorithms for solving the conjugacy problem in hyperbolic groups, we define and study the permutation conjugacy length function. This function estimates the length of a short conjugator between words $u$ and $v$, up…

This work concerns finite free complexes over commutative noetherian rings, in particular over group algebras of elementary abelian groups. The main contribution is the construction of complexes such that the total rank of their underlying…

Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S. The supremum of the values l_S(x), x \in G, is called the…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

An infinitary version of braid groups has been considered as a direct limit of n-braid groups. However, we can imagine more complicated braids with infinitely many strings. We invetisgate basic properties especially when the number of…

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

We show that, there exists a constant $a$ such that, for every subgroup $H$ of a finite group $G$, the number of maximal subgroups of $G$ containing $H$ is bounded above by $a|G:H|^{3/2}$. In particular, a transitive permutation group of…

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

We prove that it is decidable if a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple permutations: every sufficiently long simple permutation contains…

For every finite quasisimple group of Lie type $G$, every irreducible character $\chi$ of $G$, and every element $g$ of $G$, we give an exponential upper bound for the character ratio $|\chi(g)|/\chi(1)$ with exponent linear in $\log_{|G|}…