Asymptotics of the number of threshold functions on a two-dimensional rectangular grid
From MaRDI portal
Abstract: Let , . It is well-known that the number of (two-dimensional) threshold functions on an 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).
Recommendations
Cited in
(6)- A characterization of 2-threshold functions via pairs of prime segments
- Asymptotics for numbers of line segments and lines in a square grid
- A further study for the upper bound of the cardinality of Farey vertices and application in discrete geometry
- Erratum to: ``A further study for the upper bound of the cardinality of Farey vertices and applications in discrete geometry
- Asymptotics of the number of 2-threshold functions
- On the number of two-dimensional threshold functions
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)