O rekurentním vzorci k sestrojování rovin involučních
Odd graphs
On a certain numbering of the vertices of a hypergraph
On a conjecture of Frankl and Füredi.
On a conjecture of Turán
On a generalization of binomial coefficients. (Sur une généralisation des coefficients binomiaux.)
On a problem of Davenport and Schinzel
On a problem of Steinhaus concerning binary sequences.
On a Two-Dimensional Search Problem
In this article we explore the so-called two-dimensional tree− search problem. We prove that for integers m of the form m = (2^(st) − 1)/(2^s − 1) the rectangles A(m, n) are all tight, no matter what n is. On the other hand, we prove that there exist infinitely many integers m for which there is an infinite number of n’s such that A(m, n) is loose. Furthermore, we determine the smallest loose rectangle as well as the smallest loose square (A(181, 181)). It is still undecided whether there exist...
On an extension of Euler numbers and records of alternating permutations. (Sur une extension des nombres d'Euler et les records des permutations alternantes.)
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 .