wp-plugin-hostgator domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114ol-scrapes domain was triggered too early. This is usually an indicator for some code in the plugin or theme running too early. Translations should be loaded at the init action or later. Please see Debugging in WordPress for more information. (This message was added in version 6.7.0.) in /home4/scienrds/scienceandnerds/wp-includes/functions.php on line 6114Source:https:\/\/www.quantamagazine.org\/mathematicians-find-hidden-structure-in-a-common-type-of-space-20230412\/#comments<\/a><\/br> In the fall of 2017, Mehtaab Sawhney<\/a>, then an undergraduate at the Massachusetts Institute of Technology, joined a graduate reading group that set out to study a single paper over a semester. But by the semester\u2019s end, Sawhney recalls, they decided to move on, flummoxed by the proof\u2019s complexity. \u201cIt was really amazing,\u201d he said. \u201cIt just seemed completely out there.\u201d<\/p>\n The paper was by Peter Keevash<\/a> of the University of Oxford. Its subject: mathematical objects called designs.<\/p>\n The study of designs can be traced back to 1850, when Thomas Kirkman, a vicar in a parish in the north of England who dabbled in mathematics, posed a seemingly straightforward problem in a magazine called the Lady\u2019s and Gentleman\u2019s Diary<\/em>. Say 15 girls walk to school in rows of three every day for a week. Can you arrange them<\/a> so that over the course of those seven days, no two girls ever find themselves in the same row more than once?<\/p>\n Soon, mathematicians were asking a more general version of Kirkman\u2019s question: If you have n<\/em> elements in a set (our 15 schoolgirls), can you always sort them into groups of size k <\/em>(rows of three) so that every smaller set of size t<\/em> (every pair of girls) appears in exactly one of those groups?<\/p>\n Such configurations, known as (n<\/em>, k<\/em>, t<\/em>) designs, have since been used to help develop error-correcting codes, design experiments, test software, and win sports brackets and lotteries.<\/p>\n But they also get exceedingly difficult to construct as k<\/em> and t<\/em> grow larger. In fact, mathematicians have yet to find a design with a value of t<\/em> greater than 5. And so it came as a great surprise when, in 2014, Keevash showed<\/a> that even if you don\u2019t know how to build such designs, they always exist<\/a>, so long as n<\/em> is large enough and satisfies some simple conditions.<\/p>\n Now Keevash, Sawhney and Ashwin Sah<\/a>, a graduate student at MIT, have shown that even more elusive objects, called subspace designs, always exist as well<\/a>. \u201cThey\u2019ve proved the existence of objects whose existence is not at all obvious,\u201d said David Conlon<\/a>, a mathematician at the California Institute of Technology.<\/p>\n To do so, they had to revamp Keevash\u2019s original approach \u2014 which involved an almost magical blend of randomness and careful construction \u2014 to get it to work in a much more restrictive setting. And so Sawhney, now also pursuing his doctorate at MIT, found himself face to face with the paper that had stumped him just a few years earlier. \u201cIt was really, really enjoyable to fully understand the techniques, and to really suffer and work through them and develop them,\u201d he said.<\/p>\n For decades, mathematicians have translated problems about sets and subsets \u2014 like the design question \u2014 into problems about so-called vector spaces and subspaces.<\/p>\n A vector space is a special kind of set whose elements \u2014 vectors \u2014 are related to one another in a much more rigid way than a simple collection of points can be. A point tells you where you are. A vector tells you how far you\u2019ve moved, and in what direction. They can be added and subtracted, made bigger or smaller.<\/p>\n Consider the room you\u2019re in. It contains an infinite number of points, and an infinite number of vectors \u2014 ones stretching from where you are to every point in the room. All of those vectors can be constructed out of three fundamental ones: a vector pointing horizontally in front of you, another to your right, and another pointing up. By adding these vectors, multiplying them by real numbers, or doing some combination of the two, you can generate the three-dimensional vector space in which you live. (The number of vectors needed to generate the whole space is the dimension of the vector space.)<\/p>\n Various subspaces lie inside each vector space. Take just the vectors pointing to your right and in front of you. These define a two-dimensional subspace \u2014 a flat plane parallel to the floor.<\/p>\n Mathematicians often work with finite vector spaces and subspaces, where vectors can\u2019t point in every possible direction (and don\u2019t have the same notion of length). In this world, each vector space has only a finite number of vectors.<\/p>\n The subspace design problem deals with n<\/em>-dimensional vector spaces and their subspaces. In such vector spaces \u2014 again, so long as n<\/em> is sufficiently large and satisfies simple conditions \u2014 can you find a collection of k<\/em>-dimensional subspaces such that any t<\/em>-dimensional subspace is contained in exactly one of them? Such an object is called an (n<\/em>, k<\/em>, t<\/em>) subspace design. It\u2019s conceptually similar to the ordinary designs problem, but it involves arrangements that are much more tightly constrained.<\/p>\n \u201cIt\u2019s an important problem because it\u2019s one corner of a very deep analogy between sets and subsets on the one hand, and vector spaces and subspaces on the other,\u201d said Peter Cameron<\/a> of the University of St. Andrews in Scotland.<\/p>\n In the 50 years since mathematicians started thinking about this problem, they\u2019ve found only one nontrivial example<\/a> (though they know that more general kinds of subspace designs exist): In a 13-dimensional vector space, it\u2019s possible to cover two-dimensional subspaces with three-dimensional ones exactly once. <\/span>The result required a massive computer-based proof, because even for such small values of n<\/em>, k<\/em> and t<\/em>, you end up working with millions of subspaces. The complexity of such systems \u201cisn\u2019t just beyond our imagination; it\u2019s beyond what is beyond our imagination,\u201d said Tuvi Etzion<\/a> of the Technion in Israel, who helped discover the example.<\/p>\n But do subspace designs always exist, for any k<\/em> and t<\/em>? Some mathematicians conjectured that, by and large, such objects are impossible. Others, heartened by work done over the years on designs, figured that \u201cit may be hard to prove, but if there isn\u2019t an obvious reason for them not to exist, then they should exist,\u201d Keevash said.<\/p>\n Compared to the designs realm, \u201cfor this problem, there was just nothing,\u201d Sah said. \u201cI guess that prompts a bit of curiosity whenever that happens.\u201d<\/p>\n
\nMathematicians Find Hidden Structure in a Common Type of Space<\/br>
\n2023-04-13 21:58:08<\/br><\/p>\n\u2018Beyond What Is Beyond Our Imagination\u2019<\/strong><\/h2>\n
A Sponge for Errors<\/strong><\/h2>\n