<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>how to eat food</title>
  <id>http://www.howtoeatfood.com/tag/stacking</id>
  <updated>2016-12-21T11:19:00-05:00</updated>
  <author>
    <name>how to eat food</name>
  </author>
  <entry>
    <title>Maximum Overhang</title>
    <link rel="alternate" href="http://www.maa.org/sites/default/files/pdf/upload_library/22/Robbins/Patterson2.pdf"/>
    <id>5ba10e828a1c510bf5982231c098fec6</id>
    <published>2016-12-21T11:19:00-05:00</published>
    <updated>2016-12-21T11:19:00-05:00</updated>
    <author>
      <name>jaw</name>
    </author>
    <summary type="html">Maximum Overhang</summary>
    <content type="html">How far can a stack of n identical blocks be made to hang over the edge of a table? The question has a long history and the answer was widely believed to be of order log n. Recently, Paterson and Zwick constructed n-block stacks with overhangs of order n1/3, exponentially better than previously thought possible. We show here that order n1/3 is indeed best possible, resolving the long-standing overhang problem up to a constant factor.</content>
  </entry>
</feed>
