Multivalued matrices and forbidden configurations
Richard Anstee, Jeffrey Dawson, Linyuan Lu, Attila Sali

TL;DR
This paper investigates the maximum size of simple multivalued matrices avoiding certain forbidden submatrices, extending known results from binary matrices to multivalued cases and establishing bounds related to specific matrix families.
Contribution
It generalizes forbidden configuration results from binary to multivalued matrices and characterizes when the maximum size is polynomial or constant.
Findings
Forb(m,r,{}T_{}()) is a constant for certain matrix families.
Established conditions under which forb(m,r,{}T_{}(3)ackslash {}T_{}(2)) matches the growth of forb(m,2,{}F).
Most 2-columned F cases affirm the conjectured bounds.
Abstract
An -matrix is a matrix with symbols in . A matrix is simple if it has no repeated columns. Let be a finite set of -matrices. Let denote the maximum number of columns possible in a simple -matrix that has no submatrix which is a row and column permutation of any . Many investigations have involved . For general , is polynomial in if and only if for every pair there is a matrix in whose entries are only or . Let denote the following -matrices. For a pair we form four matrices namely the matrix with 's on the diagonal and 's off the diagonal and the matrix with 's on and above the diagonal and 's below the diagonal and the two matrices…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Matrix Theory and Algorithms · Mathematics and Applications
