Permutations avoiding an increasing number of length-increasing forbidden subsequences.
Permutations avoiding arithmetic patterns.
Permutations avoiding two patterns of length three.
Permutations containing and avoiding 123 and 132 patterns.
Permutations, cycles and the pattern 2--13.
Permutations defining convex permutominoes.
Permutations et partitions : tableaux à marges égales et distance partitionnelle
Permutations generated by a stack of depth 2 and an infinite stack in series.
Permutations planaires généralisées
Permutations preserving sums of rearranged real series
The aim of this paper is to discuss one of the most interesting and unsolved problems of the real series theory: rearrangements that preserve sums of series. Certain hypothesis about combinatorial description of the corresponding permutations is presented and basic algebraic properties of the family , introduced by it, are investigated.
Permutations rectilignes de lettres égales deux à deux, où trois lettres consécutives sont toujours distinctes
Permutations rectilignes de lettres égales deux à deux, où trois lettres consécutives sont toujours distinctes
Permutations rectilignes de lettres égales deux à deux, quand deux lettres consécutives sont toujours distinctes
Permutations rectilignes de lettres égales trois à trois, quand deux lettres consécutives sont toujours distinctes
Permutations rectilignes de 3q lettres égales 3 à 3, quand 3 lettres consécutives sont distinctes ; calcul de la formule générale ; applications
Permutations rectilignes de 3q lettres égales 3 à 3, quand 3 lettres consécutives sont distinctes ; calcul de la formule générale ; applications
Permutations rectilignes de 3q lettres égales 3 à 3, quand 3 lettres consécutives sont distinctes ; calcul de la formule générale ; applications
Permutations which are the union of an increasing and a decreasing subsequence.
Permutations which avoid 1243 and 2143, continued fractions, and Chebyshev polynomials.
Permutations which make transitive groups primitive
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is primitive. The remaining generators ensure transitivity or comply with specific features of the group. We show that, other than the symmetric and alternating groups, there are infinitely many primitive groups with one primitive generator each. These primitive groups...