Cats in cubes

Noga Alon; Noah Kravitz

doi:10.37236/11735

Cats in cubes

Noga Alon, Noah Kravitz

School of Computer Science

Princeton University

Research output: Contribution to journal › Article › peer-review

Abstract

Answering a recent question of Patchell and Spiro, we show that when a ddimensional cube of side length n is filled with letters, the word CAT can appear contiguously at most (3^d−1/2)n^d times (allowing diagonals); we also characterize when equality occurs (in the toroidal analogue of the problems) and extend our results to words other than CAT.

Original language	English
Article number	P3.29
Journal	Electronic Journal of Combinatorics
Volume	31
Issue number	3
DOIs	https://doi.org/10.37236/11735
State	Published - 2024

Access to Document

10.37236/11735

Cite this

@article{300e1cdaf7d34993adc6c2d307aced2e,

title = "Cats in cubes",

abstract = "Answering a recent question of Patchell and Spiro, we show that when a ddimensional cube of side length n is filled with letters, the word CAT can appear contiguously at most (3d−1/2)nd times (allowing diagonals); we also characterize when equality occurs (in the toroidal analogue of the problems) and extend our results to words other than CAT.",

author = "Noga Alon and Noah Kravitz",

note = "Publisher Copyright: {\textcopyright} The authors.",

year = "2024",

doi = "10.37236/11735",

language = "אנגלית",

volume = "31",

journal = "Electronic Journal of Combinatorics",

issn = "0022-5282",

publisher = "Electronic Journal of Combinatorics",

number = "3",

}

TY - JOUR

T1 - Cats in cubes

AU - Alon, Noga

AU - Kravitz, Noah

N1 - Publisher Copyright: © The authors.

PY - 2024

Y1 - 2024

N2 - Answering a recent question of Patchell and Spiro, we show that when a ddimensional cube of side length n is filled with letters, the word CAT can appear contiguously at most (3d−1/2)nd times (allowing diagonals); we also characterize when equality occurs (in the toroidal analogue of the problems) and extend our results to words other than CAT.

AB - Answering a recent question of Patchell and Spiro, we show that when a ddimensional cube of side length n is filled with letters, the word CAT can appear contiguously at most (3d−1/2)nd times (allowing diagonals); we also characterize when equality occurs (in the toroidal analogue of the problems) and extend our results to words other than CAT.

UR - http://www.scopus.com/inward/record.url?scp=85205266771&partnerID=8YFLogxK

U2 - 10.37236/11735

DO - 10.37236/11735

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85205266771

SN - 0022-5282

VL - 31

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 3

M1 - P3.29

ER -

Cats in cubes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this