相关论文: Nombre de factorisations d'un grand cycle

It is well known that if a group G factorizes as G = NH where H\leq G and N is normal in G then the group structure of G is determined by the subgroups H and N, the intersection of N with H and how H acts on N with a homomorphism f : H ->…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

We give mathematical proofs to a number of statements which appeared in the series of papers by Kleban, Simmons and Ziff where they computed the probabilities of several percolation crossing events.

We study two new families of symmetric functions arising from a species-theoretic construction motivated by cycle structure. For each partition of $n$, we define two combinatorial species that decompose into molecules indexed by the same…

We give a characterisation of factoriality of the groupoid von Neumann algebra $L(\mathcal{G})$ associated to a discrete measured groupoid $(\mathcal{G},\mu)$. We introduce the notion of groupoids with `infinite conjugacy classes' and show…

In this paper, we study the relationship between polynomial integrals on the unitary group and the conjugacy class expansion of symmetric functions in Jucys-Murphy elements. Our main result is an explicit formula for the top coefficients in…

In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of a finite group $G$. We compute $\eta (G)$ for all metacyclic $p$-groups. We show that if $G$ is a metacyclic $p$-group of order $p^n$ that…

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

A universal cycle for permutations of length $n$ is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length $n$, and containing all permutations of length $n$ as factors. It is well known…

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…

Gessel's famous Bessel determinant formula gives the generating function of the number of permutations without increasing subsequences of a given length. Ekhad and Zeilberger proposed the challenge of finding a suitable generalization for…

Answering a question of Bona, it is shown that for n>1 the probability that 1 and 2 are in the same cycle of a product of two n-cycles on the set {1,2,...,n} is 1/2 if n is odd and 1/2 - 2/(n-1){n+2) if n is even. Another result concerns…

A finite group $G$ is called $k$-factorizable if for any factorization $|G|=a_1\cdots a_k$ with $a_i>1$ there exist subsets $A_i$ of $G$ with $|A_i|=a_i$ such that $G=A_1\cdots A_k$. We say that $G$ is \textit{multifold-factorizable} if $G$…

In 2000, L. H\'{e}thelyi and B. K\"{u}lshammer proved that if $p$ is a prime number dividing the order of a finite solvable group $G$, then $G$ has at least $2\sqrt{p-1}$ conjugacy classes. In this paper we show that if $p$ is large, the…

In this note, we propose a factorization formula for gauge-theory scattering amplitudes up to two loops in the high-energy boosted limit. Our formula extends existing results in the literature by incorporating the contributions from massive…

For numerical semigroups with three generators, we study the asymptotic behavior of weighted factorization lengths, that is, linear functionals of the coefficients in the factorizations of semigroup elements. This work generalizes many…

We construct an infinite word $w$ over the $5$-letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a factor of $w$. In other words, $w$ does not contain a…

In a recent paper, Bacher and de la Harpe study conjugacy growth series of infinite permutation groups and their relationships with $p(n)$, the partition function, and $p(n)_{\textbf{e}}$, a generalized partition function. They prove…

In this paper, we shall prove the Chung-Feller Theorem in several ways. We provide an inductive proof, bijective proof, and proofs using generating functions, and the Cycle Lemma of Dvoretzky and Motzkin.