English
Related papers

Related papers: Local Correction of Juntas

200 papers

We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas. Our structure theorem implies that such functions are…

Computational Complexity · Computer Science 2024-08-07 Irit Dinur , Yuval Filmus , Prahladh Harsha

In this article we prove that the singular set of Dirichlet-minimizing $Q$-valued functions is countably $(m-2)$-rectifiable and we give upper bounds for the $(m-2)$-dimensional Minkowski content of the set of singular points with…

Analysis of PDEs · Mathematics 2020-10-14 Camillo de Lellis , Andrea Marchese , Emanuele Spadaro , Daniele Valtorta

Given a proper map f : M $\rightarrow$ Q, having cell-like point-inverses, from a manifold-without-boundary M onto an ANR Q, it is a much-studied problem to find when f is approximable by homeomorphisms, i.e., when the decomposition of M…

Geometric Topology · Mathematics 2016-07-29 Robert D. Edwards

With $G_k(n)$ the number of functions of $n$ boolean variables definable by $k$-SAT formulae, we prove that $G_3(n)$ is asymptotic to $2^{n+\binom{n}{3}}$. This is a strong form of the case $k=3$ of a conjecture of Bollob\'as, Brightwell…

Combinatorics · Mathematics 2010-05-18 Liviu Ilinca , Jeff Kahn

We prove a local $Tb$ theorem under close to minimal (up to certain `buffering') integrability assumptions, conjectured by S. Hofmann (El Escorial, 2008): Every cube is assumed to support two non-degenerate functions $b^1_Q\in L^p$ and…

Classical Analysis and ODEs · Mathematics 2020-07-10 Tuomas Hytönen , Fedor Nazarov

Given a collection A of holomorphic functions, we consider how to describe all the holomorphic functions locally definable from A. The notion of local definability of holomorphic functions was introduced by Wilkie, who gave a complete…

Logic · Mathematics 2019-09-05 Gareth Jones , Jonathan Kirby , Olivier Le Gal , Tamara Servi

There has been much recent interest in the satisfiability of random Boolean formulas. A random k-SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known…

Probability · Mathematics 2012-06-19 David B. Wilson

Local search algorithms and iterated local search algorithms are a basic technique. Local search can be a stand along search methods, but it can also be hybridized with evolutionary algorithms. Recently, it has been shown that it is…

Artificial Intelligence · Computer Science 2016-01-29 Francisco Chicano , Darrell Whitley , Renato Tinos

Let $K$ be a finite simplicial complex, let $g\colon K\to K$ be a simplicial map and let $f$ be a discrete Morse-Bott function on $K$ satisfying $f(g(\sigma))\leq f(\sigma)$ for all simplices $\sigma$ in $K$. We establish a set of…

Let $M$ be a complete non-compact Riemannian manifold and $\sigma $ be a Radon measure on $M$, we study the existence and non-existence of positive solutions to a nonlocal elliptic inequality \begin{equation*} (-\Delta)^{\alpha} u\geq…

Analysis of PDEs · Mathematics 2023-04-07 Qingsong Gu , Xueping Huang , Yuhua Sun

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Classical Analysis and ODEs · Mathematics 2022-01-19 Peter D. Dragnev , Alan R. Legg , Ramon Orive

We consider local modifications $\omega_n+f^*\omega_d$ of the Fubini-Study metric (with associated $(1,1)$-form $\omega_n$) on an open subset $\Omega\subset \bC\bP^n$ induced by a local holomorphic mapping $f\colon \Omega\to \bP^d$. Our…

Complex Variables · Mathematics 2014-07-29 Peter Ebenfelt

In this work the implicit function theorem is used for searching local symbolic resolution of differential equations. General results of existence for first order equations are proven and some examples, one relative to cavitation in a…

Numerical Analysis · Mathematics 2025-10-20 Gianluca Argentini

We show that $C(X)$ admits an equivalent pointwise lower semicontinuous locally uniformly rotund norm provided $X$ is Fedorchuk compact of spectral height 3. In other words $X$ admits a fully closed map $f$ onto a metric compact $Y$ such…

Functional Analysis · Mathematics 2018-11-26 S. P. Gul'ko , A. V. Ivanov , M. S. Shulikina , S. Troyanski

Q-functions are widely used in discrete-time learning and control to model future costs arising from a given control policy, when the initial state and input are given. Although some of their properties are understood, Q-functions…

Optimization and Control · Mathematics 2019-02-21 Joseph Warrington

We obtain Dini conditions with "exponent 2" that guarantee that an asymptotically conformal quasisphere is rectifiable. In particular, we show that for any e>0 integrability of (esssup_{1-t < |x| < 1+t} K_f(x)-1)^{2-e} dt/t implies that the…

Classical Analysis and ODEs · Mathematics 2014-03-13 Matthew Badger , James T. Gill , Steffen Rohde , Tatiana Toro

A smooth complex quasi-affine algebraic variety $Y$ is flexible if its special group $\SAut (Y)$ of automorphisms (generated by the elements of one-dimensional unipotent subgroups of $\Aut (Y)$) acts transitively on $Y$. An irreducible…

Algebraic Geometry · Mathematics 2017-01-31 Shulim Kaliman , Frank Kutzschebauch , Tuyen Trung Truong

Let ${\mathfrak g}$ be a finite dimensional simple Lie algebra over an algebraically closed field $K$ of characteristic $0$. A linear map $\varphi:{\mathfrak g}\to {\mathfrak g}$ is called a local automorphism if for every $x$ in…

Rings and Algebras · Mathematics 2018-05-30 Mauro Costantini

We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…

Databases · Computer Science 2025-02-26 Diego Figueira , Anantha Padmanabha , Luc Segoufin , Cristina Sirangelo

We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…

Discrete Mathematics · Computer Science 2024-08-14 Matthias Walter