Cycles of random permutations with restricted cycle lengths

Consequently, we show that the distribution of the number of 3-cuts in a random rooted 3-connected planar triangula- tion with n + 3 vertices is asymptotically normal with mean

In other words, an extension of G is an admissible oriented edge-colored graph which can be obtained from G by successively adding vertices and/or edges without adding either

Using further properties of the induction functor one shows that the cohomology of a Deligne–Lusztig variety X(wF ) depends only on the conjugacy class of wF in the braid group..

We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of

We proposed to see a binary sequence of length 2 n as the truth table of a Boolean function, compute its nonlinearity and absolute indicator and compare it to the expected values

Our results can be interpreted as follows. The inverse problem is drastically reduced when the number of observations per subject increases, enabling, in a way, to invert the..

We use the finite Markov chain embedding technique to obtain the distribution of the number of cycles in the breakpoint graph of a random uniform signed permutation.. This further

We extend here the work initiated by Doignon and Labarre [1], who enumerated unsigned permutations whose breakpoint graph contains k cycles, to signed permutations, and prove