Schreyer, BenjaminBefore the photo-finish, ties were common in races. With ties we call these arrangements weak orderings. If we have n horses in a race we define that there are H(n) ways for the horses to be ranked. Further we want to more easily count outcomes of horse races where some horses have ”rigged”the race.en-USGenerating FunctionsWeak OrderingCombinatoricsPresentation