{"id":278,"date":"2016-03-29T19:05:18","date_gmt":"2016-03-29T19:05:18","guid":{"rendered":"http:\/\/pages.charlotte.edu\/probability-seminar\/?p=278"},"modified":"2016-08-30T18:45:52","modified_gmt":"2016-08-30T18:45:52","slug":"278","status":"publish","type":"post","link":"https:\/\/pages.charlotte.edu\/probability-seminar\/blog\/2016\/03\/29\/278\/","title":{"rendered":"Wed April 13, 2016 at 3:40PM in Fretwell 379 (Math Conference Room)"},"content":{"rendered":"<table style=\"height: 357px\" width=\"579\">\n<tbody>\n<tr>\n<td><a href=\"http:\/\/math2.uncc.edu\/~ghetyei\/\">Gabor Hetyei<\/a>, UNC Charlotte<\/td>\n<\/tr>\n<tr>\n<td>Title: Nontransitive coins and semiacyclic tournaments<\/td>\n<\/tr>\n<tr>\n<td>Abstract: We provide necessary and sufficient conditions for a tournament to be<br \/>\nthe dominance graph of a set of unfair coins. We completely characterize<br \/>\nthe tournaments that are dominance graphs of sets of coins in which each<br \/>\ncoin displays its larger side with greater probability. The class of<br \/>\nthese tournaments coincides with the class of tournaments whose vertices<br \/>\ncan be numbered in a way that makes them semiacyclic, as defined by<br \/>\nPostnikov and Stanley. We provide an example of a tournament on nine<br \/>\nvertices that can not be made semiacyclic, yet it may be represented as<br \/>\na dominance graph of coins, if we also allow coins that display their<br \/>\nsmaller side with greater probability. We conclude with an example of a<br \/>\ntournament with 81 vertices that is not the dominance graph of any<br \/>\nsystem of coins.<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Gabor Hetyei, UNC Charlotte Title: Nontransitive coins and semiacyclic tournaments Abstract: We provide necessary and sufficient conditions for a tournament to be the dominance graph of a set of unfair coins. We completely characterize the tournaments that are dominance graphs of sets of coins in which each coin displays its larger side with greater probability. [&hellip;]<\/p>\n","protected":false},"author":16,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[7],"tags":[],"class_list":["post-278","post","type-post","status-publish","format-standard","hentry","category-probability_seminar"],"_links":{"self":[{"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/posts\/278","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/users\/16"}],"replies":[{"embeddable":true,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/comments?post=278"}],"version-history":[{"count":3,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/posts\/278\/revisions"}],"predecessor-version":[{"id":286,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/posts\/278\/revisions\/286"}],"wp:attachment":[{"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/media?parent=278"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/categories?post=278"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/pages.charlotte.edu\/probability-seminar\/wp-json\/wp\/v2\/tags?post=278"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}