Related papers: Annular noncrossing permutations and minimal trans…

In this paper, we compute the distributions of the statistic number of crossings over permutations avoiding one of the pairs $\{321,231\}$, $\{123,132\}$ and $\{123,213\}$. The obtained results are new combinatorial interpretations of two…

Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…

Let $G$ be a permutation group, and denote with $\mu(G)$ and $b(G)$ its minimal degree and base size respectively. We show that for every $\varepsilon>0$, there exists a transitive permutation group $G$ of degree $n$ with \[ \mu(G)b(G) \geq…

Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and…

A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments, nor representation theory.

The notion of noncrossing linked partition arose from the study of certain transforms in free probability theory. It is known that the number of noncrossing linked partitions of [n+1] is equal to the n-th large Schroder number $r_n$, which…

We prove an upper bound for the number of cyclic transitive subgroups in a finite permutation group and clarify the structure of the groups for which this bound becomes sharp. We also give an application in the theory of number fields.

We study random typical minimal factorizations of the $n$-cycle into transpositions, which are factorizations of $(1, \ldots,n)$ as a product of $n-1$ transpositions. By viewing transpositions as chords of the unit disk and by reading them…

We give a modern account of Alfred Bochert's results from 1892 on the minimal degree of doubly, triply and quadruply transitive permutation groups.

We prove that for n>2 there exists a quandle of cyclic type of size n if and only if n is a power of a prime number. This establishes a conjecture of S. Kamada, H. Tamaru and K. Wada. As a corollary, every finite quandle of cyclic type is…

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding…

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

In this paper, we study a conjecture of Gao and Wang concerning a proposed formula $K_1^*(G)$ for the maximal cross number $K_1(G)$ taken over all unique factorization indexed multisets over a given finite abelian group $G$. As a corollary…

In this short note we present a simple combinatorial trick which can be effectively applied to show the non--existence of sharply transitive sets of permutations in certain finite permutation groups.

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…

In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…

We prove a conjecture of Drake and Kim: the number of $2$-distant noncrossing partitions of $\{1,2,...,n\}$ is equal to the sum of weights of Motzkin paths of length $n$, where the weight of a Motzkin path is a product of certain fractions…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

We treat the problem of finding transitive subgroups G of S_n containing normal subgroups N_1 and N_2, with N_1 transitive and N_2 not transitive, such that G/N_1 is isomorphic G/N_2. We show that such G exist whenever n has a prime factor…