Foot-Sorting for Socks
If your socks come out of the laundry all mixed up, how should you sort them? We introduce and study a novel foot-sorting algorithm that uses feet to attempt to sort a sock ordering; one can view this algorithm as an analogue of Knuth's stack-sorting algorithm for set partitions. The sock order...
Saved in:
| Published in | The Electronic journal of combinatorics Vol. 31; no. 3 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
12.07.2024
|
| Online Access | Get full text |
| ISSN | 1077-8926 1077-8926 |
| DOI | 10.37236/11934 |
Cover
Loading…
| Abstract | If your socks come out of the laundry all mixed up, how should you sort them? We introduce and study a novel foot-sorting algorithm that uses feet to attempt to sort a sock ordering; one can view this algorithm as an analogue of Knuth's stack-sorting algorithm for set partitions. The sock orderings that can be sorted using a fixed number of feet are characterized by Klazar's notion of set partition pattern containment. We give an enumeration involving Fibonacci numbers for the $1$-foot-sortable sock orderings within a naturally-arising class. We also prove that if you have socks of $n$ different colors, then you can always sort them using at most $\left\lceil\log_2(n)\right\rceil$ feet, and we use a Ramsey-theoretic argument to show that this bound is tight. |
|---|---|
| AbstractList | If your socks come out of the laundry all mixed up, how should you sort them? We introduce and study a novel foot-sorting algorithm that uses feet to attempt to sort a sock ordering; one can view this algorithm as an analogue of Knuth's stack-sorting algorithm for set partitions. The sock orderings that can be sorted using a fixed number of feet are characterized by Klazar's notion of set partition pattern containment. We give an enumeration involving Fibonacci numbers for the $1$-foot-sortable sock orderings within a naturally-arising class. We also prove that if you have socks of $n$ different colors, then you can always sort them using at most $\left\lceil\log_2(n)\right\rceil$ feet, and we use a Ramsey-theoretic argument to show that this bound is tight. |
| Author | Kravitz, Noah Defant, Colin |
| Author_xml | – sequence: 1 givenname: Colin surname: Defant fullname: Defant, Colin – sequence: 2 givenname: Noah surname: Kravitz fullname: Kravitz, Noah |
| BookMark | eNpNjztPAkEURm8MJAJiaU1lNzh3XnenNETAhIQCrDfzWoOPHTOzjf9eghZW32m-k5wpjPrcJ4Bb5EtJQpoHRCvVFUyQE7HGCjP6x9cwrfWNcxTW6gncrXMe2CGX4dS_LrpcFocc3usNjDv3UdP8b2fwsn46rrZst988rx53LAhsBqaNMmjcWRaCD6nxXgqKKWkKgoRWiMpxF5FIxfNBd0mQb3S0XmI0SsgZ3P96Q8m1ltS1X-X06cp3i7y91LSXGvkDtqo6-g |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.37236/11934 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1077-8926 |
| ExternalDocumentID | 10_37236_11934 |
| GroupedDBID | -~9 29G 2WC 5GY 5VS AAFWJ AAYXX ACGFO ACIPV ADBBV AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS BCNDV CITATION E3Z EBS EJD FRP GROUPED_DOAJ H13 KWQ M~E OK1 OVT P2P REM RNS TR2 XSB |
| ID | FETCH-LOGICAL-c218t-564616a012ccbce8bb327dee57c27254114a0ad1774d2185fe27b85d9b31d6423 |
| ISSN | 1077-8926 |
| IngestDate | Tue Jul 01 04:24:58 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c218t-564616a012ccbce8bb327dee57c27254114a0ad1774d2185fe27b85d9b31d6423 |
| OpenAccessLink | https://www.combinatorics.org/ojs/index.php/eljc/article/download/v31i3p5/9072 |
| ParticipantIDs | crossref_primary_10_37236_11934 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2024-07-12 |
| PublicationDateYYYYMMDD | 2024-07-12 |
| PublicationDate_xml | – month: 07 year: 2024 text: 2024-07-12 day: 12 |
| PublicationDecade | 2020 |
| PublicationTitle | The Electronic journal of combinatorics |
| PublicationYear | 2024 |
| SSID | ssj0012995 |
| Score | 2.344186 |
| Snippet | If your socks come out of the laundry all mixed up, how should you sort them? We introduce and study a novel foot-sorting algorithm that uses feet to attempt... |
| SourceID | crossref |
| SourceType | Index Database |
| Title | Foot-Sorting for Socks |
| Volume | 31 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07a8MwEBZturRD6Sv0mXroVtzG1sseS0gIhWRJAtmCJMuQJS6J06FDf3tPsmK7IdDHYozwGVmfufvuTrpD6IHjmAhpUv5YMJ9ERPsxx9wkeTlLDWO3vQ4HQ9afkNcpnVaVd-3pklw-qY-d50r-gyqMAa7mlOwfkC1fCgNwD_jCFRCG668w7mVZ7o-yZb7ZDjkC7baq803zF3SrTje1OhEwH3CKha0RUjWX16koChF0TDOfUhsvxfvcNn59HGYugOwiBSExIcigFjwETw8sUhy60tM7xpxGdHp5XjnM24oW89C2ggmA_5HKlGzS51sWptz3Bx6HlZxZuX10EAK5N-p08Nktcz9gIGmxU7SYWdERyso9W7kahahxgfEJOnYk3nspEDlFe3pxho4GZQXc1Tlq1rHxABvPYnOBJr3uuNP3XQ8KXwH5yX3KCAuYgFkpJZWOpMQhT7SmXIUcnGtwJ0VbJAGw6AQEaKpDLiOaxBIHCfh2uIkai2yhL5EXJLrNVZqkMVACKVnEOJMY9GMcRUpSfIXuN581eytKjcy-L9j1j0_coMMK-VvUyJdrfQesKZctG21o2aX-AoLYFRA |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Foot-Sorting+for+Socks&rft.jtitle=The+Electronic+journal+of+combinatorics&rft.au=Defant%2C+Colin&rft.au=Kravitz%2C+Noah&rft.date=2024-07-12&rft.issn=1077-8926&rft.eissn=1077-8926&rft.volume=31&rft.issue=3&rft_id=info:doi/10.37236%2F11934&rft.externalDBID=n%2Fa&rft.externalDocID=10_37236_11934 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1077-8926&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1077-8926&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1077-8926&client=summon |