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...
Permutations with ascending and descending blocks.
Permutations with inversions.
Pfaff's method. III: Comparison with the WZ method.
Pilesize dynamic one-pile Nim and Beatty's theorem.
Place-difference-value patterns: a generalization of generalized permutation and word patterns.
Planar maps as labeled mobiles.
Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments.
Plane partition diamonds and generalizations.
Plane partitions IV: A conjecture of Mills-Robbins-Rumsey.
Plane trivalent trees and their patterns
The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.
Playing with some identities of Andrews.
Počátkové nauky o determinantech. [I.]
Počátkové nauky o determinantech. [II.]
Počátkové nauky o determinantech. [III.]
Point Sets and Sequences with Small Discrepancy.