Related papers: Fooling intersections of low-weight halfspaces

We study the probabilistic degree over reals of the OR function on $n$ variables. For an error parameter $\epsilon$ in (0,1/3), the $\epsilon$-error probabilistic degree of any Boolean function $f$ over reals is the smallest non-negative…

The degrees of polynomials representing or approximating Boolean functions are a prominent tool in various branches of complexity theory. Sherstov recently characterized the minimal degree deg_{\eps}(f) among all polynomials (over the…

The statistical translation invariance of cosmological random fields is broken by a finite survey boundary, correlating the observable Fourier modes. Standard methods for generating Gaussian fields either neglect these correlations, or are…

First-principles calculations rely heavily on pseudopotentials, yet their impact on accuracy is hardly addressed. In this work, we show that most pseudopotentials to date introduce errors, which manifest themselves as errors of atomic…

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…

We discuss random interpolation in weighted Dirichlet spaces $\mathcal{D}_\alpha$, $0\leq \alpha\leq 1$. While conditions for deterministic interpolation in these spaces depend on capacities which are very hard to estimate in general, we…

Every polynomial $P(X)\in \mathbb Z[X]$ satisfies the congruences $P(n+m)\equiv P(n) \mod m$ for all integers $n, m\ge 0$. An integer valued sequence $(a_n)_{n\ge 0}$ is called a pseudo-polynomial when it satisfies these congruences. Hall…

We prove that there is a randomized polynomial-time algorithm that given an edge-weighted graph $G$ excluding a fixed-minor $Q$ on $n$ vertices and an accuracy parameter $\varepsilon>0$, constructs an edge-weighted graph~$H$ and an…

Fix $\alpha,\theta >0$, and consider the sequence $(\alpha n^{\theta} \mod 1)_{n\ge 1}$. Since the seminal work of Rudnick--Sarnak (1998), and due to the Berry--Tabor conjecture in quantum chaos, the fine-scale properties of these dilated…

We give the first fully polynomial-time algorithm for learning halfspaces with respect to the uniform distribution on the hypercube in the presence of contamination, where an adversary may corrupt some fraction of examples and labels…

We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…

We performed density functional calculations to estimate the formation energies of intermetallic alloys. We used two semilocal approximations, the generalized gradient approximation (GGA) by Perdew-Burke-Ernzerhof (PBE) and the strongly…

Let x be a random vector coming from any k-wise independent distribution over {-1,1}^n. For an n-variate degree-2 polynomial p, we prove that E[sgn(p(x))] is determined up to an additive epsilon for k = poly(1/epsilon). This answers an open…

We describe a new statistical test for pseudorandom number generators (PRNGs). Our test can find bias induced by dependencies among the Hamming weights of the outputs of a PRNG, even for PRNGs that pass state-of-the-art tests of the same…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Parametric Presburger arithmetic concerns families of sets S_t in Z^d, for t in N, that are defined using addition, inequalities, constants in Z, Boolean operations, multiplication by t, and quantifiers on variables ranging over Z. That is,…

We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…

We use an all-electron implementation of the GW approximation to analyze several possible sources of error in the theory and its implementation. Among these are convergence in the polarization and Green's functions, the dependence of QP…