A More Malicious Maitre d

A More Malicious Maitre d

In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a circular table with napkins placed between ea...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Acton, Reed, Petersen, T. Kyle, Shirman, Blake, Toal, Daniel
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Acton, Reed
Petersen, T. Kyle
Shirman, Blake
Toal, Daniel
description In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a circular table with napkins placed between each pair of adjacent settings. The goal of the maitre d' is to seat the diners in a way that maximizes the number of diners who arrive at the table to find the napkins on both the left and right of their place already taken by their neighbors. Winkler proposes a solution to the problem that he claims is optimal. We analyze Winkler's solution using tools from enumerative combinatorics, then present a new strategy that performs better.
doi_str_mv 10.48550/arxiv.2209.11833
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2209_11833</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2209_11833</sourcerecordid><originalsourceid>FETCH-LOGICAL-a673-d04750f3705ccfb01e8b4a475dfbb78803e33a66251330ee8cf69be3889fc8123</originalsourceid><addsrcrecordid>eNotjr0OgjAURrs4GPQBmOQFwFsuhctIiH8JxoWdtKVNmmAwoEbfXkSn78sZTg5jPocoISFgK4eXe0ZxDHnEOSEumV8E534wwVl2Trv-MU7P3SfQrtjCym406_96rN7v6vIYVpfDqSyqUKYZhi0kmQCLGQitrQJuSCVyYq1VKiMCNIgyTWPBEcEY0jbNlUGi3GriMXps89PObc1tcFc5vJtvYzM34gcycjQy</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A More Malicious Maitre d</title><source>arXiv.org</source><creator>Acton, Reed ; Petersen, T. Kyle ; Shirman, Blake ; Toal, Daniel</creator><creatorcontrib>Acton, Reed ; Petersen, T. Kyle ; Shirman, Blake ; Toal, Daniel</creatorcontrib><description>In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a circular table with napkins placed between each pair of adjacent settings. The goal of the maitre d' is to seat the diners in a way that maximizes the number of diners who arrive at the table to find the napkins on both the left and right of their place already taken by their neighbors. Winkler proposes a solution to the problem that he claims is optimal. We analyze Winkler's solution using tools from enumerative combinatorics, then present a new strategy that performs better.</description><identifier>DOI: 10.48550/arxiv.2209.11833</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2022-09</creationdate><rights>http://creativecommons.org/licenses/by-nc-nd/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2209.11833$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2209.11833$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Acton, Reed</creatorcontrib><creatorcontrib>Petersen, T. Kyle</creatorcontrib><creatorcontrib>Shirman, Blake</creatorcontrib><creatorcontrib>Toal, Daniel</creatorcontrib><title>A More Malicious Maitre d</title><description>In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a circular table with napkins placed between each pair of adjacent settings. The goal of the maitre d' is to seat the diners in a way that maximizes the number of diners who arrive at the table to find the napkins on both the left and right of their place already taken by their neighbors. Winkler proposes a solution to the problem that he claims is optimal. We analyze Winkler's solution using tools from enumerative combinatorics, then present a new strategy that performs better.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjr0OgjAURrs4GPQBmOQFwFsuhctIiH8JxoWdtKVNmmAwoEbfXkSn78sZTg5jPocoISFgK4eXe0ZxDHnEOSEumV8E534wwVl2Trv-MU7P3SfQrtjCym406_96rN7v6vIYVpfDqSyqUKYZhi0kmQCLGQitrQJuSCVyYq1VKiMCNIgyTWPBEcEY0jbNlUGi3GriMXps89PObc1tcFc5vJtvYzM34gcycjQy</recordid><startdate>20220923</startdate><enddate>20220923</enddate><creator>Acton, Reed</creator><creator>Petersen, T. Kyle</creator><creator>Shirman, Blake</creator><creator>Toal, Daniel</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220923</creationdate><title>A More Malicious Maitre d</title><author>Acton, Reed ; Petersen, T. Kyle ; Shirman, Blake ; Toal, Daniel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a673-d04750f3705ccfb01e8b4a475dfbb78803e33a66251330ee8cf69be3889fc8123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Acton, Reed</creatorcontrib><creatorcontrib>Petersen, T. Kyle</creatorcontrib><creatorcontrib>Shirman, Blake</creatorcontrib><creatorcontrib>Toal, Daniel</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Acton, Reed</au><au>Petersen, T. Kyle</au><au>Shirman, Blake</au><au>Toal, Daniel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A More Malicious Maitre d</atitle><date>2022-09-23</date><risdate>2022</risdate><abstract>In this paper we study the problem of the Malicious Maitre d', as described in Peter Winkler's book Mathematical Puzzles: A Connoisseur's Collection. This problem, attributed to computer scientist Rob Pike, involves seating diners around a circular table with napkins placed between each pair of adjacent settings. The goal of the maitre d' is to seat the diners in a way that maximizes the number of diners who arrive at the table to find the napkins on both the left and right of their place already taken by their neighbors. Winkler proposes a solution to the problem that he claims is optimal. We analyze Winkler's solution using tools from enumerative combinatorics, then present a new strategy that performs better.</abstract><doi>10.48550/arxiv.2209.11833</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2209.11833
ispartof
issn
language eng
recordid cdi_arxiv_primary_2209_11833
source arXiv.org
subjects Mathematics - Combinatorics
title A More Malicious Maitre d
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T17%3A56%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20More%20Malicious%20Maitre%20d&rft.au=Acton,%20Reed&rft.date=2022-09-23&rft_id=info:doi/10.48550/arxiv.2209.11833&rft_dat=%3Carxiv_GOX%3E2209_11833%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true