Related papers: An Improved Composition Theorem of a Universal Rel…

In a recent issue of Linguistics and Philosophy Kasmi and Pelletier (1998) (K&P), and Westerstahl (1998) criticize Zadrozny's (1994) argument that any semantics can be represented compositionally. The argument is based upon Zadrozny's…

We generalize recent work of Andrews, Just, and Simay on modular palindromic compositions and anti-palindromic compositions by viewing all compositions partially (modular) palindromic or anti-palindromic. More precisely, we enumerate…

This paper presents a formalized analysis of the sigmoid function and a fully mechanized proof of the Universal Approximation Theorem (UAT) in Isabelle/HOL, a higher-order logic theorem prover. The sigmoid function plays a fundamental role…

For a (possibly partial) Boolean function $f\colon\{0,1\}^n\to\{0,1\}$ as well as a query complexity measure $M$ which maps Boolean functions to real numbers, define the composition limit of $M$ on $f$ by $M^*(f)=\lim_{k\to\infty}…

Let $0<r<1/4$, and $f$ be a non-vanishing continuous function in $|z|\leq r$, that is analytic in the interior. Voronin's universality theorem asserts that translates of the Riemann zeta function $\zeta(3/4 + z + it)$ can approximate $f$…

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

In this article we give strong versions for preparation theorems for $\mathbb{R}_{an,exp}$-definable functions outgoing from methods of Lion and Rolin ($\mathbb{R}_{an,exp}$ is the o-minimal structure generated by all restricted analytic…

By investigating which level of universality composition operators $C_f$ can have, where the symbol $f$ is given by the restriction of a transcendental entire function to suitable parts of the Fatou set of $f$, this work combines the theory…

The corona problem was motivated by the question of the density of the open unit disc in the maximal ideal space of the algebra of bounded holomorphic functions on the unit disc. The corona problem connects operator theory, function theory,…

We extend the classical theorem of Uchiyama about constructive Fefferman-Stein decompositions of ${\rm BMO}$ functions by systems of singular integrals to the rational Dunkl setting. On $\mathbb{R}^N$ equipped with a root system $R$ and a…

A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist…

We prove a lower bound on the communication complexity of computing the $n$-fold xor of an arbitrary function $f$, in terms of the communication complexity and rank of $f$. We prove that $D(f^{\oplus n}) \geq n \cdot…

For any Boolean functions $f$ and $g$, the question whether $R(f\circ g) = \tilde{\Theta}(R(f)R(g))$, is known as the composition question for the randomized query complexity. Similarly, the composition question for the approximate degree…

We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding…

We show that if $1 \leq_W F$ and $F \star F \leq_W F$, then $F^\diamond \leq_W F$, where $\star$ and $\diamond$ are the following operations in the Weihrauch lattice: $\star$ is the compositional product, which allows the use of two…

The purpose of this paper is to develop a new effective approach to higher-order mixing in the semisimple setting. We prove effective exponential mixing of all orders for partially hyperbolic algebraic actions, under a strong spectral-gap…

We introduce orderings between total functions f,g: N -> N which refine the pointwise "up to a constant" ordering <=cte and also insure that f(x) is often much less thang(x). With such orderings, we prove a strong hierarchy theorem for…

An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise…

Building meaningful representations of noun compounds is not trivial since many of them scarcely appear in the corpus. To that end, composition functions approximate the distributional representation of a noun compound by combining its…

Previously, we developed the technique of balayage of measures or charges and ($\delta$-)subharmonic functions of finite order onto an closed system of rays $S$ with a vertex at zero on the complex plane $\mathbb C$. In this article, we use…