Saturation of multidimensional 0-1 matrices
Shen-Fu Tsai

TL;DR
This paper extends the study of saturation and semisaturation functions from two-dimensional to multidimensional 0-1 matrices, providing exact values for certain cases and conditions for boundedness.
Contribution
It generalizes known results to multidimensional matrices, finds exact saturation and extremal values for identity matrices, and characterizes when semisaturation functions are bounded.
Findings
Exact values of ex(n;P,d) and sat(n;P,d) for multidimensional identity matrices.
Necessary and sufficient conditions for bounded semisaturation functions in multidimensional matrices.
Abstract
A 0-1 matrix is saturating for a 0-1 matrix if does not contain a submatrix that can be turned into by flipping any number of its -entries to -entries, and changing any -entry to -entry of introduces a copy of . Matrix is semisaturating for if changing any -entry to -entry of introduces a new copy of , regardless of whether originally contains or not. The functions and are the maximum and minimum possible number of -entries a 0-1 matrix saturating for can have, respectively. Function is the minimum possible number of -entries a 0-1 matrix semisaturating for can have. Function has been studied for decades, while investigation on and was initiated recently. In this paper, we make nontrivial generalization of results…
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
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Topics in Algebra
