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

The classic graphical Cheeger inequalities state that if $M$ is an $n\times n$ symmetric doubly stochastic matrix, then \[ \frac{1-\lambda_{2}(M)}{2}\leq\phi(M)\leq\sqrt{2\cdot(1-\lambda_{2}(M))} \] where…

We study the computational complexity of two Boolean nonlinearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time…

We study the value distribution of the Riemann zeta function near the line $\Re s = 1/2$. We find an asymptotic formula for the number of $a$-values in the rectangle $ 1/2 + h_1 / (\log T)^\theta \leq \Re s \leq 1/2+ h_2 /(\log T)^\theta $,…

Let $M(n)$ denote the number of distinct entries in the $n \times n$ multiplication table. The function $M(n)$ has been studied by Erd\H{o}s, Tenenbaum, Ford, and others, but the asymptotic behaviour of $M(n)$ as $n \to \infty$ is not known…

We give overcrowding estimates for the Sine_beta process, the bulk point process limit of the Gaussian beta-ensemble. We show that the probability of having at least n points in a fixed interval is given by $e^{-\frac{\beta}{2} n^2…

We give explicit upper bounds for the coefficients of arbitrary weight $k$, level 2 cusp forms, making Deligne's well-known $O(n^{\frac{k-1}{2}+\epsilon})$ bound precise. We also derive asymptotic formulas and explicit upper bounds for the…

Let $\Lambda\left(n\right)$ be the von Mangoldt function and $r_{SP}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)\Lambda\left(m_{2}\right)\Lambda\left(m_{3}\right)$ be the counting function for the numbers that…

For a positive integer $d$, a $d$-transversal set of a graph $G$ is an edge subset $T\subseteq E(G)$ such that $|T\cap M|\geq d$ for every maximum matching $M$ of $G$. The $d$-transversal number of $G$, denoted by $\tau_d(G)$, is the…

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. A function is a pebbling threshold for a sequence of graphs if a randomly chosen…

Let $(M,g)$ be a $n-$dimensional, compact Riemannian manifold. We define the frequency scale $\lambda$ of a function $f \in C^{0}(M)$ as the largest number such that $\left\langle f, \phi_k \right\rangle =0$ for all Laplacian eigenfunctions…

A trigonometric interpolation algorithm for non-periodic functions has been recently proposed and applied to study general ordinary differential equation (ODE). This paper enhances the algorithm to approximate functions in $2$-dim space.…

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

For a positive integer $t$, let $F_t$ denote the graph of the $t\times t$ grid. Motivated by a 50-year-old conjecture of Erd\H{o}s about Tur\'{a}n numbers of $r$-degenerate graphs, we prove that there exists a constant $C=C(t)$ such that…

We investigate the joint distribution of $L$-functions on the line $ \sigma= \frac12 + \frac1{G(T)}$ and $ t \in [ T, 2T]$, where $ \log \log T \leq G(T) \leq \frac{ \log T}{ ( \log \log T)^2 } $. We obtain an upper bound on the discrepancy…

We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at most $(\frac{1}{4}-\epsilon)\frac{n^{2}}{2}$ pairs of curves…

In this work, an extension of two-point Ostrowski's formula for $n$-times differentiable functions is proved. A generalization of Taylor formula is deduced. An identity of Fink type for this extension is provided. Error estimates for the…

We study the covering path problem on a grid of R^{2}. We generalize earlier results on a rectangular grid and prove that the covering path cost can be bounded by the area and perimeter of the grid. We provide (2+\epsilon) and…

In this note, we give an algorithm that computes the linearwidth of input $n$-vertex graphs in time $O^*(2^n)$, which improves a trivial $O^*(2^m)$-time algorithm, where $n$ and $m$ the number of vertices and edges, respectively.

We prove lower bounds on the number of product gates in bilinear and quadratic circuits that compute the product of two $n \cross n$ matrices over finite fields. In particular we obtain the following results: 1. We show that the number of…

Let $d(n)$ be the number of divisors of $n$, let $\gamma$ denote Euler's constant and $$ \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…