Generating Functions for Horses

dc.contributor.advisor	Gasarch, William
dc.contributor.author	Schreyer, Benjamin
dc.date.accessioned	2025-05-07T15:25:50Z
dc.date.issued	2025-04-23
dc.description.abstract	Before 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.identifier	https://doi.org/10.13016/v4tk-qp82
dc.identifier.uri	http://hdl.handle.net/1903/33878
dc.language.iso	en_US
dc.rights	Attribution-NonCommercial-ShareAlike 3.0 United States	en
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/
dc.subject	Generating Functions
dc.subject	Weak Ordering
dc.subject	Combinatorics
dc.title	Generating Functions for Horses
dc.type	Presentation

Files

Now showing 1 - 1 of 1