| Speaker: Arkadii Slinko Affiliation: Department of Mathematics Time: 2:30 pm Wednesday, 4 March, 2020 Location: Building 260, Room 5115 |
| Danilov, Karzanov and Koshevoy (2012) geometrically introduced an interesting operation of composition on Condorcet domains and using it they disproved a long-standing problem of Fishburn about the maximal size of connected Condorcet domains. We give an algebraic definition of this operation and investigate its properties. We give a precise formula for the cardinality of composition of two Condorcet domains and improve the Danilov-Karzanov-Koshevoy result showing that Fishburn’s alternating scheme does not always produce a largest connected Condorcet domain. Everyone Welcome! |