✦ LIBER ✦

Geometric sets of permutations

✍ Scribed by Peter J. Cameron

Publisher: Springer
Year: 1988
Tongue: English
Weight: 487 KB
Volume: 25
Category: Article
ISSN: 0046-5755
DOI: 10.1007/bf00191931

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometric permutations for convex sets

✍ M Katchalski; T Lewis; J Zaks 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 657 KB

Geometric permutations of disjoint trans

Geometric permutations of disjoint translates of convex sets

✍ M. Katchalski; T. Lewis; A. Liu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 565 KB

The object of this paper is to study how many essentially different common transversals a family of convex sets on the plane can have. In particular we consider the case where the family consists of pairwise disjoint translates of a single convex set.

Regular closed sets of permutations

✍ M.H. Albert; M.D. Atkinson; N. Ruškuc 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of ÿnite automata and avoided pattern techniques. Conditions are given for these sets to be enumerated by rational generating functions. As a consequence we give the ÿrs

Sets Completely Creative Via Recursive P

Sets Completely Creative Via Recursive Permutations

✍ Bruce M. Horowitz 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

Maximal sets of permutations constructed

Maximal sets of permutations constructed from projective planes

✍ Peter Lorimer 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 406 KB

On the set of n2+ n + 1 points of a projective plane, a set of ta2 + n -I-1 permutations is constructed with the property that any two are a Hamming distance 2n + 1 apart. Another set is constructed in which every pak are a Hamming distance not greater than 2n + 1 apart. Both sets are maximal with r

Doubly transitive sets of permutations c

Doubly transitive sets of permutations characterising projective planes

✍ R. P. Burn 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 295 KB

If U and V are distinct points of a projective plane and I is a line not through U or V, then to each/, there corresponds a unique mapping, 2, of the pencil of lines through U onto the pencil through V such that for any line u, U su, u c~ u2 eL if a set R is used to label the lines through U, and th