Related papers: Lifting with Inner Functions of Polynomial Discrep…
Lifting theorems are theorems that relate the query complexity of a function $f:\{0,1\}^{n}\to\{0,1\}$ to the communication complexity of the composed function $f \circ g^{n}$, for some "gadget" $g:\{0,1\}^{b}\times\{0,1\}^{b}\to\{0,1\}$.…
Query-to-communication lifting theorems, which connect the query complexity of a Boolean function to the communication complexity of an associated `lifted' function obtained by composing the function with many copies of another function…
One of the major open problems in complexity theory is proving super-logarithmic lower bounds on the depth of circuits (i.e., $\mathbf{P}\not\subseteq\mathbf{NC}^1$). Karchmer, Raz, and Wigderson (Computational Complexity 5(3/4), 1995)…
The Implicit and Inverse Function Theorems are special cases of a general Implicit/Inverse Function Theorem which can be easily derived from either theorem. The theorems can thus be easily deduced from each other via the generalized…
In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…
Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…
We prove a sensitivity-to-communication lifting theorem for arbitrary gadgets. Given functions $f: \{0,1\}^n\to \{0,1\}$ and $g : \mathcal X\times \mathcal Y\to \{0,1\}$, denote $f\circ g(x,y) := f(g(x_1,y_1),\ldots,g(x_n,y_n))$. We show…
Functional lifting methods provide a tool for approximating solutions of difficult non-convex problems by embedding them into a larger space. In this work, we investigate a mathematically rigorous formulation based on embedding into the…
There has been a recent coming together of the Converse Theorem for $\gln$ and the Langlands-Shahidi method of controlling the analytic properties of automorphic $L$-functions which has allowed us to establish a number of new cases of…
The great advances of learning-based approaches in image processing and computer vision are largely based on deeply nested networks that compose linear transfer functions with suitable non-linearities. Interestingly, the most frequently…
Set-disjointness problems are one of the most fundamental problems in communication complexity and have been extensively studied in past decades. Given its importance, many lower bound techniques were introduced to prove communication lower…
The BKK theorem states that the mixed volume of the Newton polytopes of a system of polynomial equations upper bounds the number of isolated torus solutions of the system. Homotopy continuation solvers make use of this fact to pick…
A correspondence between arbitrary Fourier series and certain analytic functions on the unit disk of the complex plane is established. The expression of the Fourier coefficients is derived from the structure of complex analysis. The…
We give the theorem of coincidence of a class of functions defined by a generalised modulus of smoothness with a class of functions defined by the order of the best approximation by algebraic polynomials. We also prove the appropriate…
We prove lifting theorems for complex representations $V$ of finite groups $G$. Let $\sigma=(\sigma_1,\dots,\sigma_n)$ be a minimal system of homogeneous basic invariants and let $d$ be their maximal degree. We prove that any continuous map…
Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…
We introduce an asymmetric operator of generalised translation, define the generalised modulus of smoothness by its means, and obtain the direct and inverse theorems in approximation theory for it.
This work introduces liftings and their associated Young measures as new tools to study the asymptotic behaviour of sequences of pairs $(u_j,Du_j)j$ for $(u_j)_j \in \mathrm{BV}(\Omega;\mathbb{R}^m)$ under weak* convergence. These tools are…
This article is centered around generalizing a previous implicit function theorem of the author to be applicable for maps f:E sqcap F to F which can be lifted to Keller C^k_pi maps f_i:E sqcap F_i to F_i with F_i Banach and F=projlim F_i .…
Function approximation is a generic process in a variety of computational problems, from data interpolation to the solution of differential equations and inverse problems. In this work, a unified approach for such techniques is…