相关论文: On (not) computing the Mobius function using bound…

We obtain new bounds for short sums of isotypic trace functions associated to some sheaf modulo prime $p$ of bounded conductor, twisted by the Mobius function and also by the generalised divisor function. These trace functions include…

A multiplicative function $f$ is said to be resembling the M\"{o}bius function if $f$ is supported on the square-free integers, and $f(p)=\pm 1$ for each prime $p$. We prove $O$- and $\Omega$-results for the summatory function $\sum_{n\leq…

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…

In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…

We establish an explicit link between depth-3 formulas and one-sided approximation by depth-2 formulas, which were previously studied independently. Specifically, we show that the minimum size of depth-3 formulas is (up to a factor of n)…

We study the approximation of measurable functions on the hypercube by functions arising from affine neural networks. Our main achievement is an approximation of any measurable function $f \colon W_n \to [-1,1]$ up to a prescribed precision…

A number theoretical model of $1/f$ noise found in phase locked loops is developed. The dynamics of phases and frequencies involved in the nonlinear mixing of oscillators and the low-pass filtering is formulated thanks to the rules of the…

We say that two arithmetic functions f and g form a Mobius pair if f(n) = \sum_{d \mid n} g(d) for all natural numbers n. In that case, g can be expressed in terms of f by the familiar Mobius inversion formula of elementary number theory.…

This paper gives the first separation between the power of {\em formulas} and {\em circuits} of equal depth in the $\mathrm{AC}^0[\oplus]$ basis (unbounded fan-in AND, OR, NOT and MOD$_2$ gates). We show, for all $d(n) \le O(\frac{\log…

We study systems of equations of the form X1 = f1(X1, ..., Xn), ..., Xn = fn(X1, ..., Xn), where each fi is a polynomial with nonnegative coefficients that add up to 1. The least nonnegative solution, say mu, of such equation systems is…

The Fourier transform of a bounded measurable function, $f$, on the real line is shown to be the second distributional derivative of a H\"older continuous function. The Fourier transform is written as the difference of $\int_{-1}^1…

In this paper, we describe an algorithm for approximating functions of the form $f(x)=\int_{a}^{b} x^{\mu} \sigma(\mu) \, d \mu$ over $[0,1]$, where $\sigma(\mu)$ is some signed Radon measure, or, more generally, of the form $f(x) =…

Let $\mu(n)$ be the M\"obius function, $e(z) = \exp(2\pi iz)$, $x$ real and $2\leq y \leq x$. This paper proves two sequences $(\mu(n))$ and $(e(n^k \alpha))$ are strongly orthogonal in short intervals. That is, if $k \geq 3$ being fixed…

Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…

Finite fields of the form GF(2^m) play an important role in coding theory and cryptography. We show that the choice of how to represent the elements of these fields can have a significant impact on the resource requirements for quantum…

By closely following a construction by Ganelius, we construct Faber rational functions that allow us to derive tight and explicit bounds on Zolotarev numbers. We use our results to bound the singular values of matrices, including…

We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…

This paper is a part of our programme to generalise the Hardy-Littlewood method to handle systems of linear questions in primes. This programme is laid out in our paper Linear Equations in Primes [LEP], which accompanies this submission. In…

We consider a model of computation motivated by possible limitations on quantum computers. We have a linear array of n wires, and we may perform operations only on pairs of adjacent wires. Our goal is to build a circuits that perform…

We show that $$ \sum_{n\neq m}\frac{\mu(n)\mu(m)}{nm}E_{X}\left(\{nx\}\{mx\}\right)=-\frac{9}{2\pi^{2}}+O\left(\frac{1}{X}\right), $$ where $x$ is uniformly distributed in $[0,X]$ with $X\in \mathbb{N}$, $E_{X}(.)$ denotes the expected…