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

We study an old geometric optimization problem in the plane. Given a perfect matching $M$ on a set of $n$ points in the plane, we can transform it to a non-crossing perfect matching by a finite sequence of flip operations. The flip…

The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…

Godel's theory T can be understood as a theory of the simply-typed lambda calculus that is extended to include the constant 0, the successor function S, and the operator R_tau for primitive recursion on objects of type tau. It is known that…

In recent years, a very exciting and promising method for proving lower bounds for arithmetic circuits has been proposed. This method combines the method of {\it depth reduction} developed in the works of Agrawal-Vinay [AV08], Koiran…

We develop a general technique for computing functional integrals with fixed area and boundary length constraints. The correct quantum dimensions for the vertex functions are recovered by properly regularizing the Green function. Explicit…

Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…

We study bounds for the backward shift operator $f \mapsto (f(z)-f(0))/z$ and the related operator $f \mapsto f - f(0)$ on Hardy and Bergman spaces of analytic and harmonic functions. If $u$ is a real valued harmonic function, we also find…

The Friedgut--Kalai--Naor theorem states that if a Boolean function $f\colon \{0,1\}^n \to \{0,1\}$ is close (in $L^2$-distance) to an affine function $\ell(x_1,...,x_n) = c_0 + \sum_i c_i x_i$, then $f$ is close to a Boolean affine…

Let $x\geq 1$ be a large integer, and let $a_0<a_1<\cdots<a_{k-1}$ be a small fixed integer $k$-tuple, and let $\mu(n)\in\{-1,0,1\}$ be the periodic Mobius function. This note shows that discrete Fourier transform analysis produces a simple…

For a finite dimensional algebra $A$ with $0 < \phi dim (A) = m < \infty$ we prove that there always exist modules $M$ and $N$ such that $\phi(M) = m-1$ and $\phi (N) = 1$. On the other hand, we see an example of an algebra that not every…

We prove Fatou's theorem for nonnegative harmonic functions with respect to subordinate Brownian motions with Gaussian components on bounded $C^{1,1}$ open sets $D$. We prove that nonnegative harmonic functions with respect to such…

The multilinear framework has achieved the breakthrough $1-1/e$ approximation for maximizing a monotone submodular function subject to a matroid constraint. This framework has a continuous optimization part and a rounding part. We extend…

Let $0<\alpha<n$ and $M_{\alpha}$ be the fractional maximal function. The nonlinear commutator of $M_{\alpha}$ and a locally integrable function $b$ is given by $[b,M_{\alpha}](f)=bM_{\alpha}(f)-M_{\alpha}(bf)$. In this paper, we mainly…

We address optimization of nonlinear functions of the form $f(Wx)$, where $f:\R^d\to \R$ is a nonlinear function, $W$ is a $d\times n$ matrix, and feasible $x$ are in some large finite set $F$ of integer points in $\R^n$. One motivation is…

The possibilities for limit functions on a Fatou component for the iteration of a single polynomial or rational function are well understood and quite restricted. In non-autonomous iteration, where one considers compositions of arbitrary…

Bounded holomorphic functions on the disk have radial limits in almost every direction, as follows from Fatou's theorem. Given a zero-measure set $E$ in the torus $\mathbb T$, we study the set of functions such that $\lim_{r \to 1^{-}} f(r…

The multi-commodity flow-cut gap is a fundamental parameter that affects the performance of several divide \& conquer algorithms, and has been extensively studied for various classes of undirected graphs. It has been shown by Linial, London…

We give the first super-polynomial separation in the power of bounded-depth boolean formulas vs. circuits. Specifically, we consider the problem Distance $k(n)$ Connectivity, which asks whether two specified nodes in a graph of size $n$ are…

We establish the existence of a regular functional $M$-position, in the sense of Pisier, for geometric log-concave functions. This provides a functional analogue of Pisier's regular $M$-positions for convex bodies and yields uniform control…

We consider a closed Riemannian manifold $M$ of negative curvature and dimension at least 3 with marked length spectrum sufficiently close (multiplicatively) to that of a locally symmetric space $N$. Using the methods of Hamenst\"adt, we…