Related papers: Nombre de factorisations d'un grand cycle

It has been proved recently by Moreto and Craven that the order of a finite group is bounded in terms of the largest multiplicity of its irreducible character degrees. A conjugacy class version of this result was proved for solvable groups…

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an explicit formula for $B$. We use this approach to give an…

In this paper, we consider the conjugacy growth function of a group, which counts the number of conjugacy classes which intersect a ball of radius $n$ centered at the identity. We prove that in the case of virtually polycyclic groups, this…

We establish upper and lower bounds on the maximal number of steps needed to transform a cyclic permutation to the canonical cyclic permutation using conjugation by adjacent transpositions, and on the diameter of the underlying Schreier…

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

It is shown that a refined version of a q-analogue of the Eulerian numbers together with the action, by conjugation, of the subgroup of the symmetric group $S_n$ generated by the $n$-cycle $(1,2,...,n)$ on the set of permutations of fixed…

For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization…

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

The problem of counting ramified covers of a Riemann surface up to homeomorphism was proposed by Hurwitz in the late 1800's. This problem translates combinatorially into factoring a permutation of specified cycle type, with certain…

This note deals with the computation of the factorization number $F_2(G)$ of a finite group $G$. By using the M\"{o}bius inversion formula, explicit expressions of $F_2(G)$ are obtained for two classes of finite abelian groups, improving…

If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the…

This manuscript explores many convolution (restricted summation) type sequences via certain types of matrix based factorizations that can be used to express their generating functions. The last primary (non-appendix) section of the thesis…

In 2017, Michael Cuntz gave a definition of reducibility of quiddity cycles of frieze patterns: It is reducible if it can be written as a sum of two other quiddity cycles. We discuss the commutativity and associativity of this sum operator…

We define the doubling zeta integral for smooth families of representations of classical groups. Following this we prove a rationality result for these zeta integrals and show that they satisfy a functional equation. Moreover, we show that…

The subgroup pattern of a finite groups $G$ is the table of marks of $G$ together with a list of representatives of the conjugacy classes of subgroups of $G$. In this article we present an algorithm for the computation of the subgroup…

We study the asymptotic behaviour of random factorizations of the $n$-cycle into transpositions of fixed genus $g>0$. They have a geometric interpretation as branched covers of the sphere and their enumeration as Hurwitz numbers was…

We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…