Related papers: On (not) computing the Mobius function using bound…

In this paper, we provide a solution to the open problem of computing the Fourier transform of a binary function defined over $n$-bit vectors taking $m$-bit vector values. In particular, we introduce the two-modular Fourier transform (TMFT)…

The functional derivative of the effective action with respect to an external field is part of the equation of motion of this field if one-loop effects induced by quantum fluctuations or thermal fluctuations are included when minimizing the…

We study some basic properties of the function $f_0:M\rightarrow\IR$ on Hadamard manifolds defined by $$ f_0(x):=\langle u_0,\exp_{x_0}^{-1}x\rangle\quad\mbox{for any $x\in M$}. $$ A characterization for the function to be linear affine is…

Let $(E,\mathcal E,\mu)$ be a measure space and $G\colon E\times E\to [0,\infty]$ be measurable. Moreover, let $\mathcal F\!_{ui}$ denote the set of all $q\in\mathcal E^+$ (measurable numerical functions $q\ge 0$ on $E$) such that…

We describe an algorithm for computing the inner product between a holomorphic modular form and a unary theta function, in order to determine whether the form is orthogonal to unary theta functions without needing a basis of the entire…

We prove that constant-depth quantum circuits are more powerful than their classical counterparts. To this end we introduce a non-oracular version of the Bernstein-Vazirani problem which we call the 2D Hidden Linear Function problem. An…

A completion of an m-by-n matrix A with entries in {0,1,*} is obtained by setting all *-entries to constants 0 or 1. A system of semi-linear equations over GF(2) has the form Mx=f(x), where M is a completion of A and f:{0,1}^n --> {0,1}^m…

Reversible computation is one of the most promising emerging technologies of the future. The usage of reversible circuits in computing devices can lead to a significantly lower power consumption. In this paper we study reversible logic…

For every integer \(n\ge 3\), every \(1\le \ell\le n-2\), and every sufficiently large integer \(m\), we construct harmonic functions \(u_{m,\ell}\) on the unit ball \(B_1(0)\subset\mathbb{R}^n\) such that the frequency is bounded…

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

Simple upper and lower bounds are established for the integral $\int_0^x\mathrm{e}^{-\beta t}t^\nu \mathbf{L}_\nu(t)\,\mathrm{d}t$, where $x>0$, $\nu>-1$, $0<\beta<1$ and $\mathbf{L}_\nu(x)$ is the modified Struve function of the first…

Based on a well known Sh.-T. Yau theorem we obtain that the real part of a holomorphic function on a K\"{a}hler manifold with the Ricci curvature bounded from below by $-1$ is contractive with respect to the distance on the manifold and the…

We prove that for a large class of functions $P$ and $Q$, there exists $d\in (0,1)$ such that the discrete bilinear Radon transform $$B^{\rm dis}_{P,Q}(f,g)(n)=\sum_{m\in\mathbb{Z}\setminus\{0\}} f(n-P(m))g(n-Q(m))\frac{1}{m}$$ is bounded…

We establish quantitative bounds on the $U^k[N]$ Gowers norms of the M\"obius function $\mu$ and the von Mangoldt function $\Lambda$ for all $k$, with error terms of shape $O((\log\log N)^{-c})$. As a consequence, we obtain quantitative…

We consider the problem of recovering a function input of a differential equation formulated on an unknown domain $M$. We assume to have access to a discrete domain $M_n=\{x_1, \dots, x_n\} \subset M$, and to noisy measurements of the…

We study the Fourier-Walsh spectrum $\{\hat\mu (S); S\subset\{1, ..., n\}\}$ of the Moebius function $\mu$ restricted to $\{0, 1, 2, ..., 2^n-1\}\simeq \{0, 1\}^n$ and prove that it is not captued by levels \{\hat\mu (S)| \, |S|< n^{\frac…

Let $\bf M$ be a smooth compact oriented Riemannian manifold, and let $\Delta$ be the Laplace-Beltrami operator on ${\bf M}$. Say $0 \neq f \in \mathcal{S}(\RR^+)$, and that $f(0) = 0$. For $t > 0$, let $K_t(x,y)$ denote the kernel of…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

We address long-standing open questions raised by Williamson, Goemans, Vazirani and Mihail pertaining to the design of approximation algorithms for problems in network design via the primal-dual method (Combinatorica 15(3):435-454, 1995).…

The main result of this paper is a Pfaffian formula for the partition function of the dimer model on a graph G embedded in a closed, possibly non-orientable surface S. This formula is suitable for computational purposes, and it is obtained…