Munich Personal RePEc Archive
metadata only
A Combinatorial Topology Approach to Arrow's Impossibility Theorem
Baryshnikov presented a remarkable algebraic topology proof of Arrow’s impossibility theorem trying to understand the underlying reason behind the numerous proofs of this fundamental result of social choice theory. We present a combinatorial topology proof that does not use advance mathematics, an
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Plural Slot Theory#720551
- Necessary and sufficient conditions for a resolution of the social choice paradox#1278065
- A Choice-Functional Characterization of Welfarism#102927
- Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs#1123701
- From Yang-Baxter to Robinson-Schensted-Knuth#1012684
Record · ID 1284428
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive