Generating Functions for Horses

dc.contributor.advisorGasarch, William
dc.contributor.authorSchreyer, Benjamin
dc.date.accessioned2025-05-07T15:25:50Z
dc.date.issued2025-04-23
dc.description.abstractBefore 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.
dc.identifierhttps://doi.org/10.13016/v4tk-qp82
dc.identifier.urihttp://hdl.handle.net/1903/33878
dc.language.isoen_US
dc.rightsAttribution-NonCommercial-ShareAlike 3.0 United Statesen
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/us/
dc.subjectGenerating Functions
dc.subjectWeak Ordering
dc.subjectCombinatorics
dc.titleGenerating Functions for Horses
dc.typePresentation

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Schreyer-OURD-Generating-Functions-for-Horses.pdf
Size:
126.37 KB
Format:
Adobe Portable Document Format