Related papers: Sparse juntas on the biased hypercube

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

Motivated by the orthogonal series density estimation in $L^2([0,1],\mu)$, in this project we consider a new class of functions that we call the approximate sparsity class. This new class is characterized by the rate of decay of the…

Learning approximations to smooth target functions of many variables from finite sets of pointwise samples is an important task in scientific computing and its many applications in computational science and engineering. Despite well over…

We study the transverse Poisson structure to adjoint orbits in a complex semi-simple Lie algebra. The problem is first reduced to the case of nilpotent orbits. We prove then that in suitably chosen quasi-homogeneous coordinates the…

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

We prove that for all constants $a\in\N$, $b\in\Z$, $c,d\in\R$, $c\neq 0$, the fractions $\phi(an+b)/(cn+d)$ lie dense in the interval $]0,D]$ (respectively $[D,0[$ if $c<0$), where $D=a\phi(\gcd(a,b))/(c\gcd(a,b))$. This interval is the…

We show that every Sobolev function in $W^{1,p}_{\textrm{loc}}(U)$ on a $p$-quasiopen set $U \subset {\bf R}^n$ with a.e.-vanishing $p$-fine gradient is a.e.-constant if and only if $U$ is $p$-quasiconnected. To prove this we use the theory…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

We study the entanglement entropy for open bosonic strings on multiple $Dp$-branes by using the covariant open string field theory. Choosing one of the spatial coordinates which are tangential to the hyperplane on which $Dp$-branes are…

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

We propose and analyze a continuous-time firing-rate neural network, the positive firing-rate competitive network (\pfcn), to tackle sparse reconstruction problems with non-negativity constraints. These problems, which involve approximating…

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

We study whether a uniformly random Boolean function $f : \{-1,1\}^p \to \{-1,1\}$ is determined by its Walsh--Fourier coefficients of degree at most $d$. We show that the threshold lies at $p/2$ up to an $O(\sqrt{p \log p})$ window: if \[…

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

We study the $\Gamma$-convergence of the following functional ($p>2$) $$ F_{\epsilon}(u):=\epsilon^{p-2}\int_{\Omega}|Du|^p d(x,\partial \Omega)^{a}dx+\frac{1}{\epsilon^{\frac{p-2}{p-1}}}\int_{\Omega}W(u) d(x,\partial…

We show how to develop an expansion of nearly oblate systems in terms of a set of potential-density pairs. A harmonic (multipole) structure is imposed on the potential set at infinity, and the density can be made everywhere regular. We…

In this paper, we aim to design sparse D-optimal (determinantoptimal) pose-graph SLAM problems through the synthesis of sparse graphs with the maximum weighted number of spanning trees. Characterizing graphs with the maximum number of…

In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…

We construct a family of closeness functions on the space of finite volume Lorentzian geometries using the abundance of discrete intervals in the underlying random causal sets. Although strictly weaker than a Lorentzian Gromov-Hausdorff…