On an extremal characterization of partitions
On an open problem of Green and Losonczy: exact enumeration of freely braided permutations.
On automatic infinite permutations∗
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships...
On automatic infinite permutations
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships between these definitions and prove that...
On automatic infinite permutations∗
An infinite permutation α is a linear ordering of N. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this paper, we try to extend to permutations the notion of automaticity. As we shall show, the standard definitions which are equivalent in the case of words are not equivalent in the context of permutations. We investigate the relationships...
On binary trees and permutations
Every binary tree is associated to a permutation with repetitions, which determines it uniquely. Two operations are introduced and used for the construction of the set of all binary trees. The set of all permutations which correspond to a given binary tree is determined and its cardinal number is evaluated.
On common transversals of seperating families.
On counting permutations by pairs of congruence classes of major index.
On degrees in the hasse diagram of the strong Bruhat order.
On derangement polynomials of type .
On growth rates of closed permutation classes.
On Hallian digraphs, permanents and transversals
On Hall's condition in transversal theory.
On Hultman numbers.
On M-operators of q-lattices
It is well known that every complete lattice can be considered as a complete lattice of closed sets with respect to appropriate closure operator. The theory of q-lattices as a natural generalization of lattices gives rise to a question whether a similar statement is true in the case of q-lattices. In the paper the so-called M-operators are introduced and it is shown that complete q-lattices are q-lattices of closed sets with respect to M-operators.
On packing densities of permutations.
On permutation polynomials over finite fields.
On permutations generated by infinite binary words.
On permutations involving pairs of twins.
On separating sets of words. I.