Asymptotics of the number of threshold functions on a two-dimensional rectangular grid

From MaRDI portal




Abstract: Let m,nge2, mlen. It is well-known that the number of (two-dimensional) threshold functions on an mimesn rectangular grid is {eqnarray*} t(m,n)=frac{6}{pi^2}(mn)^2+O(m^2nlog{n})+O(mn^2log{log{n}})= frac{6}{pi^2}(mn)^2+O(mn^2log{m}). {eqnarray*} We improve the error term by showing that t(m,n)=frac{6}{pi^2}(mn)^2+O(mn^2).









This page was built for publication: Asymptotics of the number of threshold functions on a two-dimensional rectangular grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759858)