Graduate Programs      Graduate Home Ph D Programs Masters Degree Ph D Program Requirements Course Descriptions Current Courses Admissions Current Graduate Students Graduate Student Seminar SIAM Chapter Seminar Recent Graduates Incoming Students Graduate Seminar Samuel Cohn Carnegie Mellon University Title: Markovian Algorithms for Randomly Knotted Oral Verbosity Abstract: Anyone who has worked in mathematics can testify to the storied use of verbosity in the literature. Creating math is challenging yet with very little content one can use verbosity to develop impressive sounding theorems and an improved funding situation for mathematical research. Hence verbosity is highly desirable. There has been a troubling trend to create conciseness and clarity in the presentation of mathematics that could lead to comprehensible results and hence rendering much of our work seemingly trivial. Intuitively, randomly knotted oral verbosity sounds like it's related to tongue twisters and thus is an important first step in the direction of a general method to generate verbose mathematics. We discuss a body of recent work to address this which uses a Markovian Algorithm to produce highly verbose mathematics with negligible content in this context (can be shown to be of $o(\epsilon^{2-\delta})$ for all $\delta >0$).Date: Tuesday, May 2, 2017Time: 5:30 pmLocation: Wean Hall 8220Submitted by:  Yangxi OuNote: The Fifth Annual M.A.R.K.O.V. Talk Video on Youtube: https://youtu.be/n_JDE_Hys18