{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_1810"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_1810","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"Combinatorial and Fourier analytic L² methods for Buffon's needle problem","abstract":"For interpretation of the references to color in this and all other figures, the reader is referred to the electronic version of this thesis.}\\end{figure}In recent years, progress has been made on Buffon's needle problem, in which one considers a subset of the plane and asks how likely \"Buffon's needle\" - a long, straight needle with independent, uniform distributions on its position and orientation - is to intersect said set. The case in which the set is a small neighborhood of a one-dimensional unrectifiable Cantor-like set has been considered in recent years, and progress has been made, motivated in part by connections to analytic capacity.Call the set E, the radius of the neighborhood &#949;, and the neighborhood E<sub>&#949;</sub>. Then in some special cases, it has been confirmed that Buffon's needle intersects E<sub>&#949;</sub> with probability at most C|log&#949;|<super>-p</super>, for p>0 small enough, C>0 large enough. In the special case of the so-called \"four corner\" Cantor set and Sierpinski's gasket, the lower bound C*log|log&#949;|/|log&#949;| is known, replacing the previously-known lower bound C/|log&#949;| which is good for more general one-dimensional self-similar sets.In addition, the stronger lower bounds are still good if one \"bends the needle\" into the shape of a long circular arc, or \"Buffon's noodle.\" The radius one uses can be as small as |log&#949;|<super>&#949;<sub>0</sub></super>$, for any &#949;<sub>0</sub>, with the constant C depending on &#949;<sub>0</sub>. It is unknown whether this condition or anything like it is necessary.Work continues on generalizing the upper bound results.","abstract_html":"For interpretation of the references to color in this and all other figures, the reader is referred to the electronic version of this thesis.}\\end{figure}In recent years, progress has been made on Buffon&#x27;s needle problem, in which one considers a subset of the plane and asks how likely &quot;Buffon&#x27;s needle&quot; - a long, straight needle with independent, uniform distributions on its position and orientation - is to intersect said set. The case in which the set is a small neighborhood of a one-dimensional unrectifiable Cantor-like set has been considered in recent years, and progress has been made, motivated in part by connections to analytic capacity.Call the set E, the radius of the neighborhood &amp;#949;, and the neighborhood E&lt;sub&gt;&amp;#949;&lt;/sub&gt;. Then in some special cases, it has been confirmed that Buffon&#x27;s needle intersects E&lt;sub&gt;&amp;#949;&lt;/sub&gt; with probability at most C|log&amp;#949;|&lt;super&gt;-p&lt;/super&gt;, for p&gt;0 small enough, C&gt;0 large enough. In the special case of the so-called &quot;four corner&quot; Cantor set and Sierpinski&#x27;s gasket, the lower bound C*log|log&amp;#949;|/|log&amp;#949;| is known, replacing the previously-known lower bound C/|log&amp;#949;| which is good for more general one-dimensional self-similar sets.In addition, the stronger lower bounds are still good if one &quot;bends the needle&quot; into the shape of a long circular arc, or &quot;Buffon&#x27;s noodle.&quot; The radius one uses can be as small as |log&amp;#949;|&lt;super&gt;&amp;#949;&lt;sub&gt;0&lt;/sub&gt;&lt;/super&gt;$, for any &amp;#949;&lt;sub&gt;0&lt;/sub&gt;, with the constant C depending on &amp;#949;&lt;sub&gt;0&lt;/sub&gt;. It is unknown whether this condition or anything like it is necessary.Work continues on generalizing the upper bound results.","abstract_has_math":false,"creators":["Bond, Matthew Robert"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Bond, Matthew R.","Volberg, Alexander","Schenker, Jeffrey","Uriarte-Tuero, Ignacio","Peller, Vladimir","Wang, Yang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011","date_published":"2011","updated_at":"2026-11-18T17:42:28Z","subjects":["Combinatorial analysis","Fourier analysis","Probabilities"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:1810","isbn:9781124575162","isbn:1124575162","oclc:931839607","umi:3449816","local:Bond_grad.msu_0128D_10230"],"render_values":[{"text":"etd:1810","href":null,"code":true},{"text":"isbn:9781124575162","href":null,"code":true},{"text":"isbn:1124575162","href":null,"code":true},{"text":"oclc:931839607","href":null,"code":true},{"text":"umi:3449816","href":null,"code":true},{"text":"local:Bond_grad.msu_0128D_10230","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/doi:10.25335/jszs-hp47","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/doi:10.25335/jszs-hp47","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_1810","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Bond, Matthew R.","Volberg, Alexander","Schenker, Jeffrey","Uriarte-Tuero, Ignacio","Peller, Vladimir","Wang, Yang"]},{"key":"dc:creator","label":"Author","values":["Bond, Matthew Robert"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Combinatorial analysis","Fourier analysis","Probabilities"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:1810","isbn:9781124575162","isbn:1124575162","oclc:931839607","umi:3449816","local:Bond_grad.msu_0128D_10230","https://doi.org/doi:10.25335/jszs-hp47"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["For interpretation of the references to color in this and all other figures, the reader is referred to the electronic version of this thesis.}\\end{figure}In recent years, progress has been made on Buffon's needle problem, in which one considers a subset of the plane and asks how likely \"Buffon's needle\" - a long, straight needle with independent, uniform distributions on its position and orientation - is to intersect said set. The case in which the set is a small neighborhood of a one-dimensional unrectifiable Cantor-like set has been considered in recent years, and progress has been made, motivated in part by connections to analytic capacity.Call the set E, the radius of the neighborhood &#949;, and the neighborhood E<sub>&#949;</sub>. Then in some special cases, it has been confirmed that Buffon's needle intersects E<sub>&#949;</sub> with probability at most C|log&#949;|<super>-p</super>, for p>0 small enough, C>0 large enough. In the special case of the so-called \"four corner\" Cantor set and Sierpinski's gasket, the lower bound C*log|log&#949;|/|log&#949;| is known, replacing the previously-known lower bound C/|log&#949;| which is good for more general one-dimensional self-similar sets.In addition, the stronger lower bounds are still good if one \"bends the needle\" into the shape of a long circular arc, or \"Buffon's noodle.\" The radius one uses can be as small as |log&#949;|<super>&#949;<sub>0</sub></super>$, for any &#949;<sub>0</sub>, with the constant C depending on &#949;<sub>0</sub>. It is unknown whether this condition or anything like it is necessary.Work continues on generalizing the upper bound results.","Thesis (Ph. D.)--Michigan State University. Mathematics, 2011","Includes bibliographical references (pages 77-78)"]},{"key":"dc:format","label":"Dc Format","values":["viii, 78 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["Combinatorial and Fourier analytic L² methods for Buffon's needle problem"]}]}],"canonical_facts":{"dc:contributor":["Bond, Matthew R.","Volberg, Alexander","Schenker, Jeffrey","Uriarte-Tuero, Ignacio","Peller, Vladimir","Wang, Yang"],"dc:creator":["Bond, Matthew Robert"],"dc:date":["2011"],"dc:description":["For interpretation of the references to color in this and all other figures, the reader is referred to the electronic version of this thesis.}\\end{figure}In recent years, progress has been made on Buffon's needle problem, in which one considers a subset of the plane and asks how likely \"Buffon's needle\" - a long, straight needle with independent, uniform distributions on its position and orientation - is to intersect said set. The case in which the set is a small neighborhood of a one-dimensional unrectifiable Cantor-like set has been considered in recent years, and progress has been made, motivated in part by connections to analytic capacity.Call the set E, the radius of the neighborhood &#949;, and the neighborhood E<sub>&#949;</sub>. Then in some special cases, it has been confirmed that Buffon's needle intersects E<sub>&#949;</sub> with probability at most C|log&#949;|<super>-p</super>, for p>0 small enough, C>0 large enough. In the special case of the so-called \"four corner\" Cantor set and Sierpinski's gasket, the lower bound C*log|log&#949;|/|log&#949;| is known, replacing the previously-known lower bound C/|log&#949;| which is good for more general one-dimensional self-similar sets.In addition, the stronger lower bounds are still good if one \"bends the needle\" into the shape of a long circular arc, or \"Buffon's noodle.\" The radius one uses can be as small as |log&#949;|<super>&#949;<sub>0</sub></super>$, for any &#949;<sub>0</sub>, with the constant C depending on &#949;<sub>0</sub>. It is unknown whether this condition or anything like it is necessary.Work continues on generalizing the upper bound results.","Thesis (Ph. D.)--Michigan State University. Mathematics, 2011","Includes bibliographical references (pages 77-78)"],"dc:format":["viii, 78 pages","application/pdf"],"dc:identifier":["etd:1810","isbn:9781124575162","isbn:1124575162","oclc:931839607","umi:3449816","local:Bond_grad.msu_0128D_10230","https://doi.org/doi:10.25335/jszs-hp47"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Combinatorial analysis","Fourier analysis","Probabilities"],"dc:title":["Combinatorial and Fourier analytic L² methods for Buffon's needle problem"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T17:42:28Z"}