𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of orthogonal permutations

✍ Scribed by Akihiro Nozaki; Masahiro Miyakawa; Grant Pogosyan; Ivo G Rosenberg

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
652 KB
Volume
16
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of baxter permutations
The number of baxter permutations
✍ F.R.K Chung; R.L Graham; V.E Hoggatt Jr.; M Kleiman πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 519 KB
On the Number of Permutations Avoiding a
On the Number of Permutations Avoiding a Given Pattern
✍ Noga Alon; Ehud Friedgut πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 118 KB

Let \_ # S k and { # S n be permutations. We say { contains \_ if there exist Stanley and Wilf conjectured that for any \_ # S k there exists a constant c=c(\_) such that F(n, \_) c n for all n. Here we prove the following weaker statement: For every fixed \_ # S k , F(n, \_) c n#\* (n) , where c=c

Bounding the Number of Geometric Permuta
Bounding the Number of Geometric Permutations Induced byk-Transversals
✍ Jacob E. Goodman; Richard Pollack; Rephael Wenger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 352 KB

We prove that a suitably separated family of n compact convex sets in R d can be met by k-flat transversals in at most d&k) , or for fixed k and d, O(n k(k+1)(d&k) ) different order types. This is the first non-trivial upper bound for 12.