Related papers: Asymptotics of the number of threshold functions o…

A $k$-threshold function on a rectangular grid of size $m \times n$ is the conjunction of $k$ threshold functions on the same domain. In this paper, we focus on the case $k=2$ and show that the number of two-dimensional 2-threshold…

It is known that a minimal teaching set of any threshold function on the twodimensional rectangular grid consists of 3 or 4 points. We derive exact formulae for the numbers of functions corresponding to these values and further refine them…

A two-dimensional threshold function of k-valued logic can be viewed as coloring of the points of a k x k square lattice into two colors such that there exists a straight line separating points of different colors. For the number of such…

A $\{0,1\}$-valued function on a two-dimensional rectangular grid is called threshold if its sets of zeros and ones are separable by a straight line. In this paper we study 2-threshold functions, i.e. functions representable as the…

In this article, we show that $$ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right| \le 0.1038 \log T + 0.2573 \log\log T + 9.3675 $$ where $N(T)$ denotes the number of non-trivial zeros $\rho$, with $0<\Im(\rho)…

We prove that the pigeonhole upper bound $\lambda(s,m) \leq \binom{m}{2}(s+1)$ is asymptotically tight whenever $s/\!\sqrt{m} \to \infty$. In particular, $\lambda(s,m) \sim \binom{m}{2}\,s$ in this regime. As corollaries: $\lambda(n,n)/n^3…

We show that the distance in total variation between $(\mathrm{Tr}\ U, \frac{1}{\sqrt{2}}\mathrm{Tr}\ U^2, \cdots, \frac{1}{\sqrt{m}}\mathrm{Tr}\ U^m)$ and a real Gaussian vector, where $U$ is a Haar distributed orthogonal or symplectic…

We study the asymptotic behaviour of $\sum_{m,n\le x} \tau_{1,2}(mn)$, where $\tau_{1,2}(n) = \sum_{a b^2 = n} 1$, using multidimensional Perron formula and complex integration method. An asymptotic formula with an error term $O(x^{10/7})$…

We prove that the order of the double reduced 2-factor transfer digraph ${\cal R}^{**}_{m}$ which is needed for the enumeration of the spanning unions of cycles in the rectangular grid graph $P_m \times P_n$ ($m,n \in N$), when $m$ is odd,…

First, we consider order-$n$ ribbon tilings of an $M$-by-$N$ rectangle $R_{M,N}$ where $M$ and $N$ are much larger than $n$. We prove the existence of the growth rate $\gamma_n$ of the number of tilings and show that $\gamma_n \leq (n-1)…

In this report we present an algorithm solving Triangle Counting in time $O(d^2n+m)$, where n and m, respectively, denote the number of vertices and edges of a graph G and d denotes its twin-width, a recently introduced graph parameter. We…

Accuracy of a simulation is strongly depend on the grid quality. Here, quality means orthogonality at the boundaries and quasi-orthogonality within the critical regions, smoothness, bounded aspect ratios, solution adaptive behaviour, etc.…

We count tilings of the $n \times m$ rectangular grid, cylinder, and torus with arbitrary tile sets up to arbitrary symmetries of the square and rectangle, along with cyclic shifting of rows and columns. This provides a unifying framework…

We show that the bandwidth of a square two-dimensional grid of arbitrary size can be reduced if two (but not less than two) edges are deleted. The two deleted edges may not be chosen arbitrarily, but they may be chosen to share a common…

Let $f(m,n)$ be the number of primitive lattice triangulations of an $m \times n$ rectangle. We express the limits $\lim_n f(m,n)^{1/n}$ for $m = 4$ and $m=5$ in terms of certain systems of Fredholm integral equations on generating…

We present an asymptotic formula for the number of line segments connecting q+1 points of an nxn square grid, and a sharper formula, assuming the Riemann hypothesis. We also present asymptotic formulas for the number of lines through at…

We show that the size-Ramsey number of the $\sqrt{n} \times \sqrt{n}$ grid graph is $O(n^{5/4})$, improving a previous bound of $n^{3/2 + o(1)}$ by Clemens, Miralaei, Reding, Schacht, and Taraz.

We investigate the threshold widths of some symmetric properties which range asymptotically between 1/\sqrt{n} and 1/(log n). These properties are built using a combination of failure sets arising from reliability theory. This combination…

Let $ACC \circ THR$ be the class of constant-depth circuits comprised of AND, OR, and MOD$m$ gates (for some constant $m > 1$), with a bottom layer of gates computing arbitrary linear threshold functions. This class of circuits can be seen…

Suppose that $a$ and $b$ are positive integers subject to $(a,b)=1$. For $n\in\mathbb{Z}^+$, denote by $\tau_{a,b}(n;\ell_1,M_1,l_2,M_2)$ the asymmetric two--dimensional divisor function with congruence conditions, i.e., \begin{equation*}…