English

Omnimosaics

Combinatorics 2010-09-24 v1 Probability

Abstract

An {\it omnimosaic} O(n,k,a)O(n,k,a) is defined to be an n×nn\times n matrix, with entries from the set A={1,2,.˙.,a}{\cal A}=\{1,2,\...,a\}, that contains, as a submatrix, each of the ak2a^{k^2} k×kk\times k matrices over A{\cal A}. We provide constructions of omnimosaics and show that for fixed aa the smallest possible size ω(k,a)\omega(k,a) of an O(n,k,a)O(n,k,a) omnimosaic satisfies kak/2eω(k,a)kak/2e(1+o(1))\frac{ka^{k/2}}{e}\le \omega(k,a)\le \frac{ka^{k/2}}{e}(1+o(1)) for a well-specified function o(1)o(1) that tends to zero as kk\to\infty.

Cite

@article{arxiv.1009.4626,
  title  = {Omnimosaics},
  author = {Katie R. Banks and Anant P. Godbole and Nicholas George Triantafillou},
  journal= {arXiv preprint arXiv:1009.4626},
  year   = {2010}
}

Comments

19 pages

R2 v1 2026-06-21T16:18:10.412Z