Learn More
A set of permutations I ⊂ S n is said to be k-intersecting if any two permutations in I agree on at least k points. We show that for any k ∈ N, if n is sufficiently large depending on k, then the largest k-intersecting subsets of S n are cosets of stabilizers of k points, proving a conjecture of Deza and Frankl. We also prove a similar result concerning(More)
Our project has investigated the processes of mediated information retrieval (IR) searching during human information seeking processes to characterize aspects of this process, including information seekers' changing situational contexts; information problems; uncertainty reduction; successive searching, cognitive styles; and cognitive and affective states.(More)