Related papers: FKN theorem for the multislice, with applications

The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a…

This paper is concerned with a class of generalized slice Fueter-regular functions on arbitrary domains in O with local stem functions. Some classical theorems such as the maximum modulus principle will be generalized to our setting. Some…

Keller and Kindler recently established a quantitative version of the famous Benjamini~--Kalai--Schramm Theorem on noise sensitivity of Boolean functions. The result was extended to the continuous Gaussian setting by Keller, Mossel and Sen…

The rapid growth of multimodal intelligence on resource-constrained and heterogeneous domestic hardware exposes critical bottlenecks: multimodal feature heterogeneity, real-time requirements in dynamic scenarios, and hardware-specific…

The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a…

Motivated by Fredholm theory, we develop a framework to establish the convergence of spectral methods for operator equations $\mathcal L u = f$. The framework posits the existence of a left-Fredholm regulator for $\mathcal L$ and the…

A function approximation method is developed that aims to approximate a function in a small neighborhood of a state that travels within a compact set. The development is based on the theory of universal reproducing kernel Hilbert spaces…

The Borsuk-Ulam theorem states that a continuous function $f:S^n \to \R^n$ has a point $x\in S^n$ with $f(x)=f(-x)$. We give an analogue of this theorem for digital images, which are modeled as discrete spaces of adjacent pixels equipped…

We introduce the notion of an approximate jacobian Newton diagram which is the jacobian Newton diagram of the morphism $(f^{(k)},f)$, where $f$ is a branch and $f^{(k)}$ is a characteristic approximate root of $f$. We prove that the set of…

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

Many molecular "quantum" theories, like "quantum chemistry", conceal that they are actually quantum-classical approaches---they treat one set of molecular degrees of freedom classically while the remaining degrees of freedom follow the laws…

The forward-backward splitting method (FBS) for minimizing a nonsmooth composite function can be interpreted as a (variable-metric) gradient method over a continuously differentiable function which we call forward-backward envelope (FBE).…

A Boolean function f of n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma(x)=f_sigma(x_1, ..., x_n) = f(x_sigma(1), ..., x_sigma(n)) of f, we can compute…

We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…

Let $G$ be a graph. A good function is a function $f:V(G)\rightarrow \{-1,1\}$, satisfying $f(N(v))\geq 1$, for each $v\in V(G)$, where $ N(v)=\{u\in V(G)\, |\, uv\in E(G) \} $ and $f(S) = \sum_{u\in S} f(u)$ for every $S \subseteq V(G) $.…

We give tight bounds on the degree $\ell$ homogenous parts $f_\ell$ of a bounded function $f$ on the cube. We show that if $f: \{\pm 1\}^n \rightarrow [-1,1]$ has degree $d$, then $\| f_\ell \|_\infty$ is bounded by $d^\ell/\ell!$, and $\|…

On the basis of a renormalization group analysis of the kernel and of the solutions of the BFKL equation with subleading corrections, we propose and calculate a novel expansion of a properly defined effective eigenvalue function. We argue…

We present a quantum algorithm for approximating the linear structures of a Boolean function $f$. Different from previous algorithms (such as Simon's and Shor's algorithms) which rely on restrictions on the Boolean function, our algorithm…

We strengthen the classical approximation theorems of Weierstrass, Runge and Mergelyan by showing the polynomial and rational approximants can be taken to have a simple geometric structure. In particular, when approximating a function $f$…

Let f be a germ of an analytic function at infinity that can be analytically continued along any path in the complex plane deprived of a finite set of points, f \in\mathcal{A}(\bar{\C} \setminus A), \sharp A <\infty. J. Nuttall has put…