• Login
    View Item 
    •   Home
    • Research
    • Articles
    • View Item
    •   Home
    • Research
    • Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Packing a cake into a box

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Type
    Article
    Authors
    Skopenkov, Mikhail
    KAUST Department
    Visual Computing Center (VCC)
    Date
    2011-06-13
    Preprint Posting Date
    2010-03-10
    Online Publication Date
    2011-06-13
    Print Publication Date
    2011
    Permanent link to this record
    http://hdl.handle.net/10754/561765
    
    Metadata
    Show full item record
    Abstract
    Given a triangular cake and a box in the shape of its mirror image, how can the cake be cut into a minimal number of pieces so that it can be put into the box? The cake has icing, so we are not allowed to put it into the box upside down. V. G. Boltyansky asked this question in 1977 and showed that three pieces always suffice. In this paper we provide examples of cakes that cannot be cut into two pieces to be put into the box. This shows that three is the answer to Boltyansky's question. We also give examples of cakes which can be cut into two pieces. © THE MATHEMATICAL ASSOCIATION OF AMERICA.
    Citation
    M. Skopenkov. (2011). Packing a Cake into a Box. The American Mathematical Monthly, 118(5), 424. doi:10.4169/amer.math.monthly.118.05.424
    Sponsors
    The author is grateful to R. Clawson, B. R. Frenkin, A. A. Glazyrin, I. V. Izmestiev, and M. V. Prasolov for useful discussions. The author is also grateful to his wife Anastasia for some figures and cakes. The author was supported in part by the Moebius Contest Foundation for Young Scientists and the Euler Foundation.
    Publisher
    Informa UK Limited
    Journal
    The American Mathematical Monthly
    DOI
    10.4169/amer.math.monthly.118.05.424
    arXiv
    1003.2101
    Additional Links
    http://arxiv.org/abs/arXiv:1003.2101v1
    ae974a485f413a2113503eed53cd6c53
    10.4169/amer.math.monthly.118.05.424
    Scopus Count
    Collections
    Articles; Visual Computing Center (VCC)

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.