Related papers: A combinatorial proof of symmetry among minimal st…
We develop the relationship between minimal transitive star factorizations and noncrossing partitions. This gives a new combinatorial proof of a result by Irving and Rattan, and a specialization of a result of Kreweras. It also arises in a…
We give two combinatorial proofs of Goulden and Jackson's formula for the number of minimal transitive factorizations of a permutation when the permutation has two cycles. We use the recent result of Goulden, Nica, and Oancea on the number…
We give a compact expression for the number of factorizations of any permutation into a minimal number of transpositions of the form $(1 i)$. Our result generalizes earlier work of Pak in which substantial restrictions were placed on the…
We consider the problem of factoring permutations as a product of special types of transpositions, namely, those transpositions involving two positions with bounded distances. In particular, we investigate the minimum number, $\delta$, such…
We introduce a new approach to an enumerative problem closely linked with the geometry of branched coverings; that is, we study the number of ways a permutation can be decomposed into a product of a given number of 2-cycles, 3-cycles, etc.…
In this paper, we look at the number of factorizations of a given permutation into star transpositions. In particular, we give a natural explanation of a hidden symmetry, answering a question of I.P. Goulden and D.M. Jackson. We also have a…
We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…
We study the factorizations of the permutation $(1,2,...,n)$ into $k$ factors of given cycle types. Using representation theory, Jackson obtained for each $k$ an elegant formula for counting these factorizations according to the number of…
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 article studies the poset of simple permutations with respect to the pattern involvement. We specify results on critically indecomposable posets obtained by Schmerl and Trotter to simple permutations and prove that if $\sigma, \pi$ are…
A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
A factorization of a permutation into transpositions is called "primitive" if its factors are weakly ordered. We discuss the problem of enumerating primitive factorizations of permutations, and its place in the hierarchy of previously…
The minimal degree of a permutation group $G$ is defined as the minimal number of non-fixed points of a non-trivial element of $G$. In this paper we show that if $G$ is a transitive permutation group of degree $n$ having no non-trivial…
The N distinct prime numbers that make up a composite number M allow $2^{N-1}$ bi partioning into two relatively prime factors. Each such pair defines a pair of conjugate representations. These pairs of conjugate representations, each of…
We investigate random minimal factorizations of the $n$-cycle, that is, factorizations of the permutation $(1 \, 2 \cdots n)$ into a product of cycles $\tau_1, \ldots, \tau_k$ whose lengths $\ell(\tau_1), \ldots, \ell(\tau_k)$ verify the…
The paper contains a proof of the conjecture of M. Klin and D. Maru$\breve{\rm s}$i$\breve{\rm c}$ that an automorphism group of a transitive graph contains a permutation, decomposed in cycles of the same length. The proof is based on the…
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass…
In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…
It is known that the number of minimal factorizations of the long cycle in the symmetric group into a product of $k$ cycles of given lengths has a very simple formula: it is $n^{k-1}$ where $n$ is the rank of the underlying symmetric group…