English
Related papers

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

200 papers

We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…

Data Structures and Algorithms · Computer Science 2015-07-29 Eric J. Friedman , Adam S. Landsberg

In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with $m$ edges and at least $T$ triangles, we show that an extra look over the stream yields a two-pass treaming algorithm…

Data Structures and Algorithms · Computer Science 2016-03-10 Graham Cormode , Hossein Jowhari

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

Number Theory · Mathematics 2016-11-16 Aleksandar Ivić

Given positive integers $h, N$ satisfying $1 \leqslant h \leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any…

Number Theory · Mathematics 2026-05-19 Jonathan Chapman , Akshat Mudgal

Bonnet, Kim, Thomass\'{e}, and Watrigant (2020) introduced the twin-width of a graph. We show that the twin-width of an $n$-vertex graph is less than $(n+\sqrt{n\ln n}+\sqrt{n}+2\ln n)/2$, and the twin-width of an $m$-edge graph for a…

Combinatorics · Mathematics 2022-10-05 Jungho Ahn , Kevin Hendrey , Donggyu Kim , Sang-il Oum

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

Combinatorics · Mathematics 2025-12-25 Gargi Mukherjee , Helen W. J. Zhang , Ying Zhong

In this article, we improve the recent work of Hasanalizade, Shen, and Wong by establishing \[ \left| N (T) - \frac{T}{ 2 \pi} \log \left( \frac{T}{2\pi e}\right) \right|\le 0.10076\log T+0.24460\log\log T+8.08344, \] for every $T\ge e$,…

Number Theory · Mathematics 2025-07-08 Chiara Bellotti , Peng-Jie Wong

For positive integers $m$ and $n$, define $f(m,n)$ to be the smallest integer such that any subset $A$ of the $m \times n$ integer grid with $|A| \geq f(m,n)$ contains a rectangle; that is, there are $x\in [m]$ and $y \in [n]$ and…

Combinatorics · Mathematics 2013-10-29 Jeremy F. Alm , Jacob Manske

We present an algorithm that computes the girth of the intersection graph of $n$ given line segments in the plane in $O(n^{1.483})$ expected time. This is the first such algorithm with $O(n^{3/2-\varepsilon})$ running time for a positive…

Computational Geometry · Computer Science 2026-03-24 Timothy M. Chan , Yuancheng Yu

We use character theory and character estimates to show that the number of $T_2$-systems of $A_n$ is at least \begin{equation*} \frac{1}{8n\sqrt{3}}\exp\left(\frac{2\pi}{\sqrt{6}}n^{1/2}\right)(1+o(1)). \end{equation*} Applying this result,…

Group Theory · Mathematics 2017-10-30 Stefan-Christoph Virchow

We derive an asymptotic formula for the number of strongly connected digraphs with $n$ vertices and $m$ arcs (directed edges), valid for $m-n\to\infty$ as $n\to \infty$ provided $m=O(n\log n)$. This fills the gap between Wright's results…

Combinatorics · Mathematics 2011-05-18 Xavier Perez-Gimenez , Nicholas Wormald

Let $n\ge 1$ and $\mathfrak{T}_{m}$ be the bilinear square Fourier multiplier operator associated with a symbol $m$, which is defined by $$ \mathfrak{T}_{m}(f_1,f_2)(x) = \biggl( \int_{0}^\infty\Big|\int_{(\mathbb{R}^n)^2} e^{2\pi ix\cdot…

Classical Analysis and ODEs · Mathematics 2016-04-20 Zengyan Si , Qingying Xue , Kozo Yabuta

Let $\overline{N}_2(a,c,n)$ be the number of overpartitions of $n$ whose the $M_2$-rank is congruent to $a$ modulo $c$. In this paper, we obtain the asymptotic formula of $\overline{N}_2(a,c,n)$ utilizing the Ingham Tauberian Theorem. As…

Combinatorics · Mathematics 2022-06-07 Helen W. J. Zhang , Ying Zhong

We consider tromino tilings of $m\times n$ domino-deficient rectangles, where $3|(mn-2)$ and $m,n\geq0$, and characterize all cases of domino removal that admit such tilings, thereby settling the open problem posed by J. M. Ash and S.…

Discrete Mathematics · Computer Science 2007-08-13 Mridul Aanjaneya

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

Number Theory · Mathematics 2017-08-24 Marco Cantarini

We provide completely effective error estimates for Stirling numbers of the first and second kind, denoted by $s(n,m)$ and $S(n,m)$, respectively. These bounds are useful for values of $m \geq n - O(\sqrt{n})$. An application of our Theorem…

Combinatorics · Mathematics 2016-09-12 Richard Arratia , Stephen DeSalvo

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T(2,n;k), prove some identities satisfied by these numbers,…

Combinatorics · Mathematics 2014-09-16 Jacob A. Siehler

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

Classical Analysis and ODEs · Mathematics 2025-02-17 T. M. Dunster

In this paper, considering the concept of Universal Multiplication Table, we show that for every $n\geq 2$, the inequality: $$ M(n)=#\{ij|1\leq i,j\leq n\}\geq\frac{n^2}{\mathfrak{N}(n^2)}, $$ holds true with: $$…

Number Theory · Mathematics 2007-06-13 Mehdi Hassani

We define two-dimensional Dirichlet spectrum (with respect to Euclidean norm) as D_2=\lambda\in\mathbf{R} | \exists \mathbf{v}=(v_1,v_2)\in \mathbf {R}^2: \limsup\limits_{t\rightarrow\infty} {t\cdot\psi_{v}^2(t)}=\lambda, where…

Number Theory · Mathematics 2013-06-11 Renat Akhunzhanov , Denis Shatskov