{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:22Z","timestamp":1753893862562,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>The extremal function $ex(n, P)$ is the maximum possible number of ones in any 0-1 matrix with $n$ rows and $n$ columns that avoids $P$. A 0-1 matrix $P$ is called minimally nonlinear if $ex(n, P) = \\omega(n)$ but $ex(n, P') = O(n)$ for every $P'$ that is contained in $P$ but not equal to $P$.\r\nBounds on the number of ones and the number of columns in a minimally nonlinear 0-1 matrix with $k$ rows were found in (CrowdMath, 2018). In this paper, we improve the upper bound on the number of ones in a minimally nonlinear 0-1 matrix with $k$ rows from $5k-3$ to $4k-4$. As a corollary, this improves the upper bound on the number of columns in a minimally nonlinear 0-1 matrix with $k$ rows from $4k-2$ to $4k-4$.\r\nWe also prove that there are not more than four ones in the top and bottom rows of a minimally nonlinear matrix and that there are not more than six ones in any other row of a minimally nonlinear matrix. Furthermore, we prove that if a minimally nonlinear 0-1 matrix has ones in the same row with exactly $d$ columns between them, then within these columns there are at most $2d-1$ rows above and $2d-1$ rows below with ones.<\/jats:p>","DOI":"10.37236\/7801","type":"journal-article","created":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T08:55:39Z","timestamp":1604048139000},"source":"Crossref","is-referenced-by-count":1,"title":["Sharper Bounds and Structural Results for Minimally Nonlinear 0-1 Matrices"],"prefix":"10.37236","volume":"27","author":[{"given":"Jesse","family":"Geneson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shen-Fu","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,10,30]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p24\/8205","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i4p24\/8205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T08:55:40Z","timestamp":1604048140000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i4p24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,10,2]]}},"URL":"https:\/\/doi.org\/10.37236\/7801","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2020,10,30]]},"article-number":"P4.24"}}