Related papers: Nombre de factorisations d'un grand cycle

In the symmetric group on a set of size 2n, let P_{2n} denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as ``pairings'', since each disjoint cycle has length 2). Harer and Zagier explicitly…

A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…

Universal cycle for $k$-permutations is a cyclic arrangement in which each $k$-permutation appears exactly once as $k$ consecutive elements. Enumeration problem of universal cycles for $k$-permutations is discussed and one new enumerating…

We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…

We first summarize joint work on several preliminary canonical Lambert series factorization theorems. Within this article we establish new analogs to these original factorization theorems which characterize two specific primary cases of the…

We prove that function fields of varieties of dimension at least two over an algebraic closure of a finite field are determined, modulo purely inseparable extensions, by the quotient by the second term in the lower central series of their…

We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…

The concept of a $1$-rotational factorization of a complete graph under a finite group $G$ was studied in detail by Buratti and Rinaldi. They found that if $G$ admits a $1$-rotational $2$-factorization, then the involutions of $G$ are…

The Jacobi system on a full-line lattice is considered when it contains additional weight factors. A factorization formula is derived expressing the scattering from such a generalized Jacobi system in terms of the scattering from its…

We prove a multiplicity formula for Riemann-Roch numbers of reductions of Hamiltonian actions of loop groups. This includes as a special case the factorization formula for the quantum dimension of the moduli space of flat connections over a…

A matrix group is said to be permutation-like if any matrix of the group is similar to a permutation matrix. G. Cigler proved that, if a permutation-like matrix group contains a normal cyclic subgroup which is generated by a maximal cycle…

We consider the factorization of permutations into bandwidth 1 permutations, which are products of mutually nonadjacent simple transpositions. We exhibit an upper bound on the minimal number of such factors and thus prove a conjecture of…

We prove a family of identities, expressing generating functions of powers of characteristic polynomials of permutations, as finite or infinite products. These generalize formulae first obtained in a study of the geometry/topology of…

We analyze the chiral operator ring of the symmetric orbifold conformal field theory on the complex two-plane. We compute the large N limit of the ring and exhibit its factorized leading order behaviour. We moreover calculate all structure…

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

A perfect $1$-factorisation of a graph is a decomposition of that graph into $1$-factors such that the union of any two $1$-factors is a Hamiltonian cycle. A Latin square of order $n$ is row-Hamiltonian if for every pair $(r,s)$ of distinct…

We express the set of representations from a cyclic $p$-group to a connected $p$-compact group in terms of the associated reflection group and compute its cardinality for each exotic $p$-compact group.

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 investigate products of certain double cosets for the symmetric group and use the findings to derive some multiplication formulas for q-Schur superalgebras. This gives a combinatorialisation of the relative norm approach developed by the…