<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2012-06-06 05:08:27Permutations Abstract algebra Permutation Formal languages Inversion String Job shop scheduling Permutation pattern Mathematics Combinatorics Discrete mathematics |
Add to Reading List |
Complete Characterization of Near-Optimal Sequences for the Two-Machine Flow Shop Scheduling Problem Jean-Charles Billaut1 , Emmanuel Hebrard2 , and Pierre Lopez2 1
![A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!](https://www.pdfsearch.io/img/1dd1dd0fef39f361843f9cf70a461d35.jpg "A comment on Intersecting Families of Permutations Yuval Filmus July 3, 2017 Abstract Ellis, Friedgut and Pilpel [EFP11] prove that for large enough n, a t-intersecting family of permutations contains at most (n − t)!")
