{"id":137234,"date":"2026-06-23T12:11:35","date_gmt":"2026-06-23T16:11:35","guid":{"rendered":"https:\/\/www.simonsfoundation.org\/?p=137234"},"modified":"2026-06-23T12:11:43","modified_gmt":"2026-06-23T16:11:43","slug":"the-twisted-mathematics-of-richard-schwartz-and-mobius-bands","status":"publish","type":"post","link":"https:\/\/www.simonsfoundation.org\/2026\/06\/23\/the-twisted-mathematics-of-richard-schwartz-and-mobius-bands\/","title":{"rendered":"The Twisted Mathematics of Richard Schwartz and M\u00f6bius Bands"},"content":{"rendered":"","protected":false},"excerpt":{"rendered":"","protected":false},"author":432,"featured_media":137554,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_relevanssi_hide_post":"","_relevanssi_hide_content":"","_relevanssi_pin_for_all":"","_relevanssi_pin_keywords":"","_relevanssi_unpin_keywords":"","_relevanssi_related_keywords":"","_relevanssi_related_include_ids":"","_relevanssi_related_exclude_ids":"","_relevanssi_related_no_append":"","_relevanssi_related_not_related":"","_relevanssi_related_posts":"","_relevanssi_noindex_reason":"","footnotes":""},"categories":[],"tags":[],"class_list":["post-137234","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","news_type-article"],"acf":{"block_editor":[{"acf_fc_layout":"video","embed_code":"https:\/\/vimeo.com\/1202522225?share=copy&fl=sv&fe=ci","title":"An animation of hill climbing, a mathematical optimization technique used by mathematician Richard Schwartz when he was researching how to make a torus shape with the smallest number of vertices. The algorithm starts with an arbitrary solution to a problem and then makes incremental changes to the solution to find a more optimized outcome.","caption":"Courtesy of Richard Schwartz","video_autoplay":true,"video_loop":true,"video_width":"","video_height":"","video_container_size":"video_large"},{"acf_fc_layout":"text","text":"<p class=\"p1\"><span class=\"s1\">Take a rectangular strip of paper, give it a half twist and connect its short ends to each other. You have made a M\u00f6bius band, also known as a M\u00f6bius strip or loop. It is a familiar staple of recreational mathematics and a simple illustration of the mathematical concept of nonorientability. (That is, it has no universal \u2018up\u2019 or \u2018down\u2019 direction.) Plus, it\u2019s just fun to play with.<\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">If you start with a long, skinny strip of paper, it\u2019s easy to make a M\u00f6bius band. With shorter strips, it gets harder to twist and connect the ends. You\u2019ll eventually hit the point where you physically can\u2019t make a M\u00f6bius band because the ratio between the length and width is too low. There is a clever folding pattern that produces a M\u00f6bius band from a strip of paper with an aspect ratio of the square root of 3 (around 1.73) to 1. Even though this construction has been described in papers since as early as 1930, no one was able to prove that it was impossible to twist a strip with a smaller aspect ratio into a M\u00f6bius band.<\/span><\/p>"},{"acf_fc_layout":"image","type":"image_medium","image":137576,"title":"A M\u00f6bius strip is a surface that connects to itself with a half twist. Mathematician Richard Schwartz recently proved the minimum aspect ratio possible for such a band. ","caption":"Krishnavedala\/Wikimedia","caption_full":"","less_margin":false},{"acf_fc_layout":"text","text":"<p class=\"p1\"><span class=\"s1\">When Richard Schwartz heard about the conundrum, he asked himself, \u201cWhat\u2019s so hard about this problem? I could do this.\u201d Schwartz is a math professor at Brown University and four-time <a href=\"https:\/\/www.simonsfoundation.org\/grant\/simons-fellows-in-mathematics\/\">Simons Fellow in Mathematics<\/a> with broad interests, from geometry and topology to writing colorful, mind-bending children\u2019s books about math. <\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">His first instinct when faced with the M\u00f6bius strip question was to model it on the computer. That exploration gave him some immediate gratification, an improvement on what were then the best-known bounds of the problem based on an argument that involved cutting the M\u00f6bius band along a particular set of lines. When he first programmed it into the computer, he erroneously assumed those cuts left him with a parallelogram. \u201cThere followed three years where I was trying to push this argument further using the parallelogram idea,\u201d he says. His chain of reasoning kept getting more complicated, but the bound never budged. Finally, he started playing with a paper model. \u201cI cut one open, and oh my God, you get a trapezoid.\u201d The entire parallelogram argument evaporated, taking with it his original improvement.<\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">While he was trying to correct his earlier erroneous paper, he realized, \u201cWhen I did the calculation right, it solved the whole conjecture.\u201d In just a few days, <a href=\"https:\/\/arxiv.org\/abs\/2308.12641\">he was able to prove<\/a> that the square root of 3 to 1 is indeed the lower limit of aspect ratios for a M\u00f6bius band. He circulated his proof among some other interested mathematicians and, with their feedback and improvements, \u201cit got to be a razor-sharp argument,\u201d he says. \u201cI\u2019m thrilled with it.\u201d<\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">The optimal M\u00f6bius band is the answer to a problem of geometric optimization. Such problems ask, given certain geometric constraints, what the limits are of the shapes that fit those constraints \u2014 for instance, the smallest or the largest. The questions are often natural and intuitive (such as identifying the widest M\u00f6bius strip), but actually proving that a particular shape is optimal can be fiendishly difficult. Schwartz\u2019s misadventure among the specious parallelograms illustrates the combination of playfulness and tenacity that allows him to latch on to these curiosity-driven questions and see them through to the end.<\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">During a trip to the Institut des Hautes \u00c9tudes Scientifiques (IHES) outside Paris during his 2024\u20132025 Simons Fellowship, Schwartz turned his attention to another geometric optimization problem involving a well-known shape: an origami-like folding of a flat surface into a torus. A torus is the mathematical name for the shape of an inner tube or the layer of glaze covering a doughnut. The term refers to the shape topologically: That is, the shape can be stretched, twisted and deformed and, so long as it isn\u2019t torn or glued, still be called a torus.<\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">A flat torus is a representation of the torus as a square, or any parallelogram, with opposite sides \u2018identified.\u2019 That is, the sides behave like the sides in the classic arcade game Asteroids. When the user-controlled spaceship travels off the right side of the screen, it reappears on the left side, continuing in the same direction. Just as in the game, the sides of the flat torus are linked. <\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">If you actually sat at your desk, took a square of paper and taped the edges together to realize that flat torus in three-dimensional space, it wouldn\u2019t be smooth and pretty like an inner tube \u2014 it would be folded or crumpled in some places. The smooth surface of an inner tube requires the stretching of rubber. A flat torus can\u2019t fit in three-dimensional space in a smooth way without distortion, but if you allow some folding, you can do it. <\/span><\/p>"},{"acf_fc_layout":"code","code":"<div class=\"sketchfab-embed-wrapper\" style=\"width: 100%; aspect-ratio: 16\/9;\"> \r\n  <iframe style=\"width: 100%; height: 100%;\" title=\"Pup Tent\" frameborder=\"0\" allowfullscreen mozallowfullscreen=\"true\" webkitallowfullscreen=\"true\" allow=\"autoplay; fullscreen; xr-spatial-tracking\" xr-spatial-tracking execution-while-out-of-viewport execution-while-not-rendered web-share src=\"https:\/\/sketchfab.com\/models\/2a90b9e0a588470c92ce8000356983eb\/embed?camera=0&transparent=1\"> <\/iframe> \r\n<\/div>"},{"acf_fc_layout":"code","code":"<div style=\"font-size: 15px; line-height: 20px; font-weight: 300;\">3D model of a \u2018pup tent,\u2019 a family of eight-vertex tori invented by mathematician Richard Schwartz while he was researching how to create a torus with a minimum number of vertices. <span style=\"color: #666;\">Thomas Sumner\/Simons Foundation<\/span><\/div>\r\n<style>\r\n.o-blocks>.m-block:nth-of-type(1), .m-block-text>div:not(.m-block-info__wrapper):not(.m-block-info) {\r\nmargin-bottom: 15px;\r\n}\r\n<\/style>\r\n<br>"},{"acf_fc_layout":"text","text":"<p class=\"p1\"><span class=\"s1\">Your first attempt at making a flat torus out of paper will probably look randomly crumpled. A natural mathematical question is whether there is a flat torus that is \u2018best\u2019 in some way. Schwartz was specifically interested in origami flat tori, which are formed by fitting flat triangles together in three-dimensional space so that the total angle around every point \u2014 including the vertices where the triangles intersect \u2014 is 360 degrees, the same as in a full circle. <\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">Schwartz sought to find origami tori with the fewest vertices possible, a challenge known as the minimum-vertex problem. He had heard about the problem years ago from colleagues, and conversations he had during his fellowship visit to IHES rekindled his interest in the problem. Previous research had established that any such torus must have at least seven vertices and had produced examples with nine. Schwartz set to work proving that nine vertices was the smallest number possible. First, he demonstrated that no seven-vertex triangulation could work, using computer modeling to explore the space of possible configurations of seven points and employing arguments from projective geometry and combinatorics to reduce the total number of cases to be examined. <\/span><\/p>"},{"acf_fc_layout":"quote","text":"\u201cI don't know how to solve it. But if I don\u2019t try to solve it, then it\u2019s 100 percent guaranteed I\u2019m not going to solve it.\u201d","attribution":"Richard Schwartz"},{"acf_fc_layout":"text","text":"<p class=\"p1\"><span class=\"s1\">When he tried to extend his arguments to eight vertices, though, he kept failing. He reduced millions of cases to thousands but couldn\u2019t narrow them down further. \u201cIt just wasn\u2019t quite working,\u201d he says. \u201cAt some point, my brain switched.\u201d He began to wonder whether an eight-vertex torus might be possible after all. He ran some experiments and eventually settled on a supervised machine learning approach to find triangulations that could work. After that, it took more work to show that the potential triangulations, which involved numerical approximation, actually yielded honest-to-goodness flat tori. When all the numbers worked out, he ended up with a family of eight-vertex tori <a href=\"https:\/\/www.math.brown.edu\/reschwar\/Papers\/universal.pdf\">he calls \u2018pup tents\u2019<\/a> because of their squat shape. <\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">These pup tents are not intended for the shelves of camping goods stores, nor are they likely to have any other practical use. \u201cI just like to play around,\u201d Schwartz says. But behind that play are serious questions about the limits of human imagination and understanding. Mathematics is riddled with problems that are simple to state and nearly impossible to solve. When he runs up against one of these questions, he thinks, \u201cWe humans ought to be able to answer this question, and we can\u2019t. That means that there\u2019s some idea that we\u2019re missing.\u201d <\/span><\/p>\r\n<p class=\"p1\"><span class=\"s1\">The quest for the proof of one of these deceptively difficult problems continues to drive Schwartz, whether it\u2019s a twisted piece of paper, an origami doughnut or something else. For many years, he has had his sights set on the square peg problem, \u201clike Ahab looking for the whale,\u201d he says. That problem asks whether every curve that reconnects with itself in a closed loop without crossing over itself has four points that form the corners of a square. \u201cI don\u2019t know how to solve it,\u201d he says. No human has yet looked at the question in quite the right way. An elegant solution could be right around the corner or never found in a thousand years. \u201cBut if I don\u2019t try to solve it, then it\u2019s 100 percent guaranteed I\u2019m not going to solve it.\u201d<\/span><\/p>"}]},"_links":{"self":[{"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/posts\/137234"}],"collection":[{"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/users\/432"}],"replies":[{"embeddable":true,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/comments?post=137234"}],"version-history":[{"count":20,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/posts\/137234\/revisions"}],"predecessor-version":[{"id":137732,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/posts\/137234\/revisions\/137732"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/media\/137554"}],"wp:attachment":[{"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/media?parent=137234"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/categories?post=137234"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.simonsfoundation.org\/wp-json\/wp\/v2\/tags?post=137234"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}