Cutting 4 by $n$ grids into two congruent pieces
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908913096458240 |
|---|---|
| author | Dougherty-Bliss, Robert Ter-Saakov, Natalya Zeilberger, Doron |
| author_facet | Dougherty-Bliss, Robert Ter-Saakov, Natalya Zeilberger, Doron |
| contents | In the March 2025 issue of Pour la Science, Jean-Paul Delahaye described a wonderful solution to the following problem: How many ways can you divide a 3 by 2n rectangle into two connected, congruent pieces? We show that this problem can be solved by the transfer matrix method, and demonstrate this by computing the generating function for the number of ways to divide a 4 by n rectangle into two connected, congruent parts. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_16153 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cutting 4 by $n$ grids into two congruent pieces Dougherty-Bliss, Robert Ter-Saakov, Natalya Zeilberger, Doron Combinatorics 05A15 In the March 2025 issue of Pour la Science, Jean-Paul Delahaye described a wonderful solution to the following problem: How many ways can you divide a 3 by 2n rectangle into two connected, congruent pieces? We show that this problem can be solved by the transfer matrix method, and demonstrate this by computing the generating function for the number of ways to divide a 4 by n rectangle into two connected, congruent parts. |
| title | Cutting 4 by $n$ grids into two congruent pieces |
| topic | Combinatorics 05A15 |
| url | https://arxiv.org/abs/2510.16153 |