{"id":215,"date":"2019-06-13T04:20:57","date_gmt":"2019-06-13T04:20:57","guid":{"rendered":"http:\/\/francis-su.104.42.120.246.xip.io\/?page_id=215"},"modified":"2025-04-02T23:51:44","modified_gmt":"2025-04-02T23:51:44","slug":"research-papers-and-preprints","status":"publish","type":"page","link":"https:\/\/math.hmc.edu\/su\/research-papers-and-preprints\/","title":{"rendered":"Research"},"content":{"rendered":"\n<p>You can probably tell that my research interests have changed over the years. My Ph.D. was a mix of representation theory and probability used to analyze random walks on algebraic structures. More recently, I&#8217;ve been fascinated by mathematical questions arising from problems in the social sciences. I&#8217;ve been carving out a niche solving problems in geometric and topological combinatorics (e.g., triangulations of polytopes and fixed point theorems) and using them to study problems of fair division in mathematical economics, and voting problems in game theory.<\/p>\n\n\n\n<p>Be aware that preprints below may differ slightly from the published versions. Many of my papers have been jointly authored with&nbsp;undergraduates. Cell colors group related papers.<\/p>\n\n\n\n<p>If my recent papers are not here yet, they may appear on <a href=\"https:\/\/www.dropbox.com\/s\/uedp0xbvtf90lyp\/vita-current.pdf?st=zeaz23ga&amp;dl=0\">my CV<\/a> or on the <a href=\"https:\/\/arxiv.org\/search\/?searchtype=author&amp;query=Su%2C+F+E\">arXiV<\/a>. Some older papers are available through links at <a href=\"https:\/\/scholar.google.com\/citations?user=Av1e9qQAAAAJ&amp;hl=en&amp;oi=sra\">Google Scholar<\/a>.<\/p>\n\n\n\n<p>* = undergraduate co-authors<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">40. R. Alvarado, M. Averett, B. Gaines, C. Jackson, M. L. Karker, M. A. Marciniak, F. E. Su, S. Walker, The Game of Cycles.<br><em>The American Mathematical Monthly<\/em> 128 (2021), 868\u2013887.<br><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">39. K. Nyman, F. E. Su, S. Zerbib, Fair division with multiple pieces.<br><em>Discrete Applied Mathematics<\/em> 283 (2020), 115\u2013122.<br><a href=\"https:\/\/arxiv.org\/abs\/1710.09477\">arXiv:1710.09477<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">38. F. Meunier and F. E. Su. Multilabeled versions of Sperner\u2019s and Fan\u2019s lemmas and applications.<br><em>SIAM Journal on Applied Algebra and Geometry<\/em> 3(2019), 391\u2013411.<br><a href=\"https:\/\/arxiv.org\/abs\/1801.02044\">arXiv:1801.02044<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">37. F. E. Su and S. Zerbib, Piercing Numbers in Approval Voting. <br><em>Mathematical Social Sciences<\/em> 101(2019), 65\u201371.<br><a href=\"https:\/\/arxiv.org\/abs\/1710.09493\">arXiv:1710.09493<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">36. T. Seacrest* and F. E. Su. A lower bound technique for triangulations of simplotopes.<br><em>SIAM Journal on Discrete Mathematics<\/em> 32(2018) 1\u201328.<br><a href=\"https:\/\/arxiv.org\/abs\/0910.1134\">arXiv:0910.1134<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">35. F. E. Su, Mathematics for Human Flourishing.<br><em>Amer. Math. Monthly<\/em> 124(2017), 483\u2013493. <br>Also in <em>The Best Writing on Mathematics<\/em> 2018 (Mircea Petici, ed.), Princeton University Press, 2018.<br>Winner of the 2018 MAA Halmos-Ford Award for outstanding mathematical exposition.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">34. B. Kuture*, C. Loa*, O. Leong*, M. Sondjaja, F. E. Su, Proving Tucker\u2019s lemma with a volume argument.<br><em>Contemporary Mathematics<\/em> 685(2017), pp. 223\u2013230.<br><a href=\"https:\/\/arxiv.org\/abs\/1604.02395\">arXiv:1604.02395<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">33. F. E. Su,The Lesson of Grace in Teaching. 2013 Haimo Award Lecture.<br> In <em>The Best Writing onMathematics 2014<\/em> (Mircea Petici, ed.), Princeton University Press, 2014.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">32. M. Davis, M. E. Orrison, and F. E. Su. Voting for committees in agreeable societies.<br><em>Contemporary Mathematics<\/em> 624(2014), 147\u2013157.<br><a href=\"https:\/\/arxiv.org\/abs\/1402.0861\">arXiv:1402.0861<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">31. M. M. Klawe, K. L. Nyman, J. N. Scott*, and F. E. Su. Double-interval societies.<br><em>Contemporary Mathematics<\/em> 624(2014), 135\u2013146.<br><a href=\"https:\/\/arxiv.org\/abs\/1307.5094\">arXiv:1307.5094<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">30. Z. Landau and F. E. Su. Fair division and redistricting.<br><em>Contemporary Mathematics<\/em> 624(2014), 17\u201336.<br><a href=\"https:\/\/arxiv.org\/abs\/1402.0862\">arXiv:1402.0862<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">29. A. Niedermaier*, D. Rizzolo*, and F. E. Su. A Tree Sperner Lemma.<br><em>Contemporary Mathematics<\/em> 625(2014), 77\u201392.<br><a href=\"https:\/\/arxiv.org\/abs\/0909.0339\">arXiv:0909.0339<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">28. K. Nyman and F. E. Su. A Borsuk-Ulam equivalent that implies Sperner\u2019s Lemma.<br><em>Amer. Math. Monthly<\/em> 120(2013), 346\u2013354.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffddee\">27. Sanjai&nbsp;Gupta,&nbsp;Parousia Rockstroh*, and Francis&nbsp;Edward Su.&nbsp;Splitting fields and periods of Fibonacci sequences modulo primes.&nbsp; <br><em>Math. Mag.<\/em> Volume 85, Number 2, April 2012, 130-135.<br><a href=\"https:\/\/arxiv.org\/abs\/0909.0362\">arXiv:0909.0362<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">26. Francis&nbsp;Edward Su.&nbsp;The agreeable society theorem.&nbsp; <br>In&nbsp;<a href=\"http:\/\/www.amazon.com\/Expeditions-Mathematics-Tatiana-Shubin\/dp\/0883855712\/?tag=mathfunfacts-20\"><em>Expeditions in Mathematics<\/em><\/a>&nbsp;(Shubin, Hayes, Alexanderson, eds.), Mathematical Association of America, 2011.<br><a href=\"https:\/\/arxiv.org\/abs\/0811.3245\">[PDF at the arXiv]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffffcc\">25. Francis&nbsp;Edward Su.&nbsp;Teaching Research: Encouraging Discoveries.&nbsp; <em>Amer. Math. Monthly,<\/em> 117:159\u2013169, 2010.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Teaching-Research-Encouraging-Discoveries.pdf\">[PDF]<\/a> <br>Reprinted in&nbsp;<a href=\"http:\/\/www.amazon.com\/Best-Writing-Mathematics-2011\/dp\/0691153159?&amp;tag=mathfunfacts-20\"><em>Best Writing on Mathematics 2011<\/em><\/a><em>&nbsp;(M. Pitici, ed.), Princeton University Press, 2011.<\/em><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">24. Deborah&nbsp;Berg*, Serguei Norine, Francis&nbsp;Edward Su, Robin Thomas, and Paul Wollan.&nbsp;Voting in agreeable societies.&nbsp; <br><em>Amer. Math. Monthly&nbsp;<\/em>117:27&#8211;39, 2010.<br><a href=\"https:\/\/arxiv.org\/abs\/0811.3245\">arXiv:0811.3245<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">23. John&nbsp;Cloutier*, Kathryn L. Nyman, and Francis&nbsp;Edward Su.&nbsp;Two-player envy-free multi-cake division.&nbsp; <br><em>Math. Social Sci.<\/em>&nbsp;59:26&#8211;37, 2010.<br><a href=\"https:\/\/arxiv.org\/abs\/0909.0301\">arXiv:0909.0301<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-very-light-gray-background-color has-background\">22. Claus-Jochen Haake,&nbsp;Akemi Kashiwada*, and Francis&nbsp;Edward Su.&nbsp;The Shapley value of phylogenetic trees.&nbsp; <br><em>J. Math. Biol.,<\/em> 56(4):479\u2013497, 2008.<br><a href=\"https:\/\/arxiv.org\/abs\/q-bio\/0506034\">arXiv:q-bio\/0506034<\/a>&nbsp;&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">21. Douglas&nbsp;Rizzolo*&nbsp;and Francis&nbsp;Edward Su.&nbsp;A fixed point theorem for the infinite-dimensional simplex.&nbsp; <br><em>J. Math. Anal. Appl.,<\/em> 332(2):1063\u20131070, 2007.<br><a href=\"https:\/\/arxiv.org\/abs\/math\/0610707\">arXiv:math\/0610707<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">20. Gwen&nbsp;Spencer*&nbsp;and Francis&nbsp;Edward Su.&nbsp;The LSB theorem implies the KKM lemma.&nbsp; <br><em>Amer. Math. Monthly, <\/em>114(2):156\u2013159, 2007.<br><a href=\"https:\/\/arxiv.org\/abs\/math\/0409092\">arXiv:math\/0409092<\/a>&nbsp;&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">19. Timothy&nbsp;Prescott*&nbsp;and Francis&nbsp;Edward Su.&nbsp;A constructive proof of Ky Fan&#8217;s generalization of Tucker&#8217;s lemma.&nbsp; <br><em>J. Combin. Theory Ser. A,<\/em> 111(2):257\u2013265, 2005.<br>[<a href=\"https:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2025\/04\/Prescott-Su_Constructive-Proof-Ky-Fan-Tuckers-Lemma-with-errata.pdf\" data-type=\"link\" data-id=\"https:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2025\/04\/Prescott-Su_Constructive-Proof-Ky-Fan-Tuckers-Lemma-with-errata.pdf\">PDF with errata in comments<\/a>]<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">18. Adam&nbsp;Bliss*&nbsp;and Francis&nbsp;Edward Su.&nbsp;Lower bounds for simplicial covers and triangulations of cubes.&nbsp; <br><em>Discrete Comput. Geom.,<\/em> 33(4):669\u2013686, 2005.<br><a href=\"https:\/\/arxiv.org\/abs\/math\/0310142\">arXiv:math\/0310142<\/a>&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">17. Doug&nbsp;Hensley and Francis&nbsp;Edward Su.&nbsp;Random walks with badly approximable numbers.&nbsp; <br><em>In&nbsp;Unusual applications of number theory, <\/em>volume&nbsp;64 of<em>&nbsp;DIMACS Ser. Discrete Math. Theoret. Comput. Sci.,<\/em> pages 95\u2013101. Amer. Math. Soc., Providence, RI, 2004.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Random-walks.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">16. Timothy&nbsp;Prescott*&nbsp;and Francis&nbsp;Edward Su.&nbsp;Random walks on the torus with several generators.&nbsp; <br><em>Random Structures Algorithms,<\/em> 25(3):336\u2013345, 2004.<br><a href=\"https:\/\/arxiv.org\/abs\/math\/0309011\">arXiv:math\/0309011<\/a> Version April 2004.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">15. Forest&nbsp;W. Simmons and Francis&nbsp;Edward Su.&nbsp;Consensus-halving via theorems of Borsuk-Ulam and Tucker.&nbsp; <br><em>Math. Social Sci.,<\/em> 45(1):15\u201325, 2003.&nbsp;<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Consensus-halving-via-theorems.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffddee\">14. Arthur&nbsp;T. Benjamin,&nbsp;Christopher R.&nbsp;H. Hanusa*, and Francis&nbsp;Edward Su.&nbsp;Linear recurrences through tilings and Markov chains.&nbsp; <br><em>Util. Math.,<\/em> 64:3\u201317, 2003.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/LINEAR-RECURRENCES.pdf\">[PDF]<\/a> Version June 2001.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">13. Jesus&nbsp;A. De&nbsp;Loera,&nbsp;Elisha Peterson*, and Francis&nbsp;Edward Su.&nbsp;A polytopal generalization of Sperner&#8217;s lemma.&nbsp; <br><em>J. Combin. Theory Ser. A,<\/em> 100(1):1\u201326, 2002.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/A-Polytopal-Generalization.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">12. Alison&nbsp;L. Gibbs and Francis&nbsp;Edward Su.&nbsp;On choosing and bounding probability metrics. <br><em>International Statistical Review,<\/em> 70(3):419\u2013435, 2002.<br><a href=\"https:\/\/arxiv.org\/abs\/math\/0209021\">arXiv:math\/0209021<\/a>&nbsp;Version February 2002.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">11. Elisha&nbsp;Peterson*&nbsp;and Francis&nbsp;Edward Su.&nbsp;Four-Person Envy-Free Chore Division. <br><em>Math. Mag., <\/em>75(2):117\u2013122, 2002.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Four-Person-Envy-Free-Chore-Division.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">10. Claus-Jochen Haake, Matthias&nbsp;G. Raith, and Francis&nbsp;Edward Su.&nbsp;Bidding for envy-freeness: a procedural approach to n-player fair-division problems.&nbsp; <br><em>Soc. Choice Welf.,<\/em> 19(4):723\u2013749, 2002.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Bidding-for-envy-freeness.pdf\">[PDF]<\/a> This algorithm in this paper has been implemented in <a href=\"https:\/\/www.nytimes.com\/interactive\/2014\/science\/rent-division-calculator.html\">The Fair Division Calculator<\/a> (New York Times Version).<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">9. Francis&nbsp;Edward Su.&nbsp;Discrepancy convergence for the drunkard&#8217;s walk on the sphere.&nbsp; <br><em>Electron. J. Probab.,<\/em> 6:no. 2, 20 pp. (electronic), 2001.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Discrepancy-convergence.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddcc\">8. Matthias&nbsp;G. Raith, and Francis&nbsp;Edward Su.&nbsp;Procedural support for cooperative negotiations: theory and implementation.&nbsp; <br>In&nbsp;<em>Advances in Decision Technology and Intelligent Information Systems, Volume I,<\/em> pages 21\u201336. The International Institute for Advanced Studies in Systems Research and Cybernetics, Windsor, Canada, 2000.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Procedural-support-for-cooperative-negotiations.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddcc\">7. Francis&nbsp;Edward Su.&nbsp;Reviews: Cake-Cutting Algorithms: Be Fair if You Can.&nbsp; <br><em>Amer. Math. Monthly,<\/em> 107(2):185\u2013188, 2000.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Cake-Cutting-Algorithms.pdf\">[PDF]<\/a> [<a href=\"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00029890.2000.12005180\">published version<\/a>]<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">6. Francis&nbsp;Edward Su.&nbsp;A LeVeque-type lower bound for discrepancy.&nbsp; <br>In&nbsp;<em>Monte Carlo and quasi-Monte Carlo methods 1998 (Claremont, CA),<\/em> pages 448\u2013458. Springer, Berlin, 2000.&nbsp;<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/A-LeVeque-type.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffddee\">5. Arthur&nbsp;T. Benjamin, Francis&nbsp;Edward Su, and Jennifer&nbsp;J. Quinn.&nbsp;Counting on Continued Fractions.&nbsp; <br><em>Math. Mag.,<\/em> 73(2):98\u2013104, 2000.&nbsp;<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Counting-on-Continued-Fractions.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffddee\">4. Arthur&nbsp;T. Benjamin, Jennifer&nbsp;J. Quinn, and Francis&nbsp;Edward Su.&nbsp;Phased tilings and generalized Fibonacci identities.&nbsp; <br><em>Fibonacci Quart.,<\/em> 38(3):282\u2013288, 2000.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Phased-tilings.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">3. Francis Edward Su.&nbsp;Rental harmony: Sperner&#8217;s lemma in fair division.&nbsp;<br><em>Amer. Math. Monthly,<\/em> 106(10):930\u2013942, 1999.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Rental-harmony.pdf\">[PDF]<\/a> This article was awarded the MAA&#8217;s <a href=\"https:\/\/www.maa.org\/about-the-maa-5\">2001 Merten M. Hasse Prize<\/a> for mathematical exposition.<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">2. Francis&nbsp;Edward Su.&nbsp;Convergence of random walks on the circle generated by an irrational rotation. <br><em>Trans. Amer. Math. Soc.,<\/em> 350(9):3717\u20133741, 1998.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Convergence-of-random-walks.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">1. Francis&nbsp;Edward Su.&nbsp;Borsuk-Ulam implies Brouwer: a direct construction.<br><em>Amer. Math. Monthly,<\/em> 104(9):855\u2013859, 1997.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Borsuk-Ulam-implies-Brouwer.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddff\">0. Francis Edward Su. Methods for Quantifying Rates of Convergence for Random Walks on Groups.&nbsp;<br><em>Ph.D. Thesis, Harvard University. Advisor: Persi Diaconis.<\/em><\/p>\n\n\n\n<hr class=\"wp-block-separator has-css-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\">Not Yet Published<\/h2>\n\n\n\n<p><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">Roberto Barrera,&nbsp;Kathryn Nyman,&nbsp;Amanda Ruiz,&nbsp;Francis Edward Su,&nbsp;Yan X. Zhang, Discrete Envy-free Division of Necklaces and Maps.<br><a href=\"https:\/\/arxiv.org\/abs\/1510.02132\">arXiv:1510.02132<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">Rosalie&nbsp;Carlson*, Stephen Flood,&nbsp;Kevin O&#8217;Neill*, and Francis&nbsp;Edward Su.&nbsp;A Turan-type theorem for circular arc graphs.&nbsp;<br><a href=\"http:\/\/front.math.ucdavis.edu\/1110.4205\"><\/a><a href=\"https:\/\/arxiv.org\/abs\/1110.4205\">arXiv:1110.4205<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#eeddcc\">Claus-Jochen Haake and Francis&nbsp;Edward Su.&nbsp;Fair division procedures: why use Mathematics?&nbsp; <br>In&nbsp;<em>Procedural Approaches to Conflict Resolution<\/em>&nbsp;(Matthias Raith, ed.), to appear.<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/Fair-Division-Procedures.pdf\">[PDF]<\/a><\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">Elisha Peterson* and Francis Edward Su. N-person envy-free chore division.<br><a href=\"https:\/\/arxiv.org\/abs\/0909.0303\">arXiv:0909.0303<\/a>&nbsp;&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">Kyle&nbsp;E. Kinneberg*, Aaron Mazel-Gee*, Tia Sondjaja*,&nbsp;and Francis&nbsp;Edward Su.&nbsp;A cubical antipodal theorem.<br><a href=\"https:\/\/arxiv.org\/abs\/0909.0471\">arXiv:0909.0471<\/a>&nbsp;&nbsp;<\/p>\n\n\n\n<p class=\"has-background\" style=\"background-color:#ffeedd\">Sarah&nbsp;Fletcher*, Christopher Hardin, and Francis&nbsp;Edward Su.&nbsp;The agreement number of tree societies.<\/p>\n\n\n\n<hr class=\"wp-block-separator has-css-opacity\" \/>\n\n\n\n<h2 class=\"wp-block-heading\">Other Writings<\/h2>\n\n\n\n<p>The Banach-Tarski Paradox.&nbsp; An expository paper for my&nbsp;<em>Minor Thesis<\/em>&nbsp;requirement, Harvard University.&nbsp;<br><a href=\"http:\/\/math.hmc.edu\/su\/wp-content\/uploads\/sites\/10\/2019\/06\/The-Banach-Tarski-Paradox.pdf\">[PDF]<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>You can probably tell that my research interests have changed over the years. My Ph.D. was a mix of representation theory and probability used to analyze random walks on algebraic structures. More recently, I&#8217;ve been fascinated by mathematical questions arising from problems in the social sciences. I&#8217;ve been carving out a niche solving problems in [&hellip;]<\/p>\n","protected":false},"author":9,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"tags":[],"class_list":["post-215","page","type-page","status-publish","hentry"],"jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/pages\/215","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/users\/9"}],"replies":[{"embeddable":true,"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/comments?post=215"}],"version-history":[{"count":40,"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/pages\/215\/revisions"}],"predecessor-version":[{"id":1350,"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/pages\/215\/revisions\/1350"}],"wp:attachment":[{"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/media?parent=215"}],"wp:term":[{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/math.hmc.edu\/su\/wp-json\/wp\/v2\/tags?post=215"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}