Related papers: Asymptotics of the number of threshold functions o…
Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…
In this work, we define an orthogonal graph on the set of equivalence classes of $(2\nu + \delta)-$tuples over $\mathbb{Z}_{2^n}$ where $n$ and $\nu$ are positive integers and $\delta = 0, 1$ or $2$. We classify our graph if it is strongly…
We study the number of meromorphic functions on a Riemann surface with given critical values and prescribed multiplicities of critical points and values. When the Riemann surface is $\CP^1$ and the function is a polynomial, we give an…
The present work introduces an efficient Monte Carlo algorithm for continuum percolation composed of randomly-oriented rectangles. By conducting extensive simulations, we report high precision percolation thresholds for a variety of…
We show that the number of $1$'s in the first $N$ digits of the binary expansion of $\sqrt{2}$ is at least $\sqrt{2N}(1+o(1))$ and show that this bound can be improved to around $2\sqrt{N}/\sqrt{2\sqrt{2}-1}$ infinitely often.
We study quasi-Monte Carlo integration for twice differentiable functions defined over a triangle. We provide an explicit construction of infinite sequences of points including one by Basu and Owen (2015) as a special case, which achieves…
The geometry of Arithmetic Random Waves has been extensively investigated in the last fifteen years, starting from the seminal papers [RW08, ORW08]. In this paper we study the correlation structure among different functionals such as nodal…
We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…
We consider asymptotics of planar orthogonal polynomials $P_{n,N}$ (where $\mathrm{deg}P_{n,N}=n$) with respect to the weight $$\frac{|z-w|^{2NQ_1}}{(1+|z|^2)^{N(1+Q_0+Q_1)+1}}, \quad(Q_0,Q_1 > 0)$$ in the whole complex plane. With $n,…
For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…
We consider fluctuations of error terms $\Delta(x)$ appearing in the asymptotic formula for a summatory function of coefficients of the Dirichlet series. These are quantified via $\Omega$ and $\Omega_{\pm}$ estimates. We obtain $\Omega$…
A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem…
Let $\Delta(x)$ denote the error term in the Dirichlet divisor problem, and $E(T)$ the error term in the asymptotic formula for the mean square of $|\zeta(1/2+it)|$. If $E^*(t) = E(t) - 2\pi\Delta^*(t/2\pi)$ with $\Delta^*(x) = -\Delta(x) +…
We prove several analogs of Gromov's macroscopic dimension conjecture with extra curvature assumptions. More explicitly, we show that for an open Riemannian $n$-manifold $(M,g)$ of nonnegative Ricci (resp. sectional) curvature, if it has…
Given a graph $H$ and a function $f:\mathbb{Z}^+ \longrightarrow \mathbb{Z}^+ $, the Ramsey-Tur\'an number of $H$ and $f$, denoted by $RT(n, H, f(n))$, is the maximum number of edges a graph $G$ on $n$ vertices can have, which does not…
We study asymptotic behavior of the stability thresholds of a big line bundle, and prove explicit bounds on the error terms. This answers Jin--Rubinstein--Tian's questions affirmatively. A key step in our proof is to show that the stability…
What proportion of integers $n \leqslant N$ may be expressed as $x^2 + dy^2$ for some $d \leqslant \Delta$, with $x,y $ integers? Writing $\Delta$ as $(\log N)^{\log 2} 2^{\alpha \sqrt{\log \log N}}$ for some $\alpha \in (-\infty, \infty)$,…
A graph $G = (V,E)$ is a double-threshold graph if there exist a vertex-weight function $w \colon V \to \mathbb{R}$ and two real numbers $\mathtt{lb}, \mathtt{ub} \in \mathbb{R}$ such that $uv \in E$ if and only if $\mathtt{lb} \le…
We prove that the sensitivity of any non-trivial graph property on $n$ vertices is at least $\lfloor \frac{1}{2}n \rfloor$ , provided $n$ is sufficiently large.
Trotter and Erd\"os found conditions for when a directed $m \times n$ grid graph on a torus is Hamiltonian. We consider the analogous graphs on a two-holed torus, and study their Hamiltonicity. We find an $\mathcal{O}(n^4)$ algorithm to…