Related papers: Fooling intersections of low-weight halfspaces

The main objective of this paper is to prove the monodromy conjecture for the local Igusa zeta function of a quasi-ordinary polynomial of arbitrary dimension defined over a number field. In order to do it, we compute the local Denef-Loeser…

Given a way to evaluate an unknown polynomial with integer coefficients, we present new algorithms to recover its nonzero coefficients and corresponding exponents. As an application, we adapt this interpolation algorithm to the problem of…

We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\log^2 n)$, where $n$ is the length of the branching…

For $S \subseteq \{0,1\}^n$ a Boolean function $f \colon S \to \{-1,1\}$ is a polynomial threshold function (PTF) of degree $d$ and weight $W$ if there is a polynomial $p$ with integer coefficients of degree $d$ and with sum of absolute…

We analyze a sublinear RAlSFA (Randomized Algorithm for Sparse Fourier Analysis) that finds a near-optimal B-term Sparse Representation R for a given discrete signal S of length N, in time and space poly(B,log(N)), following the approach…

Let $f_n(z) = \sum_{k = 0}^n \varepsilon_k z^k$ be a random polynomial where $\varepsilon_0,\ldots,\varepsilon_n$ are i.i.d. random variables with $\mathbb{E} \varepsilon_1 = 0$ and $\mathbb{E} \varepsilon_1^2 = 1$. Letting $r_1,…

Helfgott and Seress have proved the existence of a quasipolynomial upper bound on the diameter of $\mathrm{Alt}(n)$. In this paper, we walk partway towards removing the dependence on CFSG from that result, by using the algorithm solving the…

A function g, with domain the natural numbers, is a quasi-polynomial if there exists a period m and polynomials p_0,p_1,...,p_{m-1} such that g(t)=p_i(t) for t=i mod m. Quasi-polynomials classically -- and "reasonably" -- appear in Ehrhart…

In his Ph.D. disseration, Feldman and his collaborators define the linear programming decoder for binary linear codes, which is a linear programming relaxation of the maximum-likelihood decoding problem. This decoder does not, in general,…

We give almost-linear-time algorithms for constructing sparsifiers with $n\ poly(\log n)$ edges that approximately preserve weighted $(\ell^{2}_2 + \ell^{p}_p)$ flow or voltage objectives on graphs. For flow objectives, this is the first…

Let $W_i=\{W_i(t_i), t_i\in \R_+\}, i=1,2,\ldots,d$ are independent Wiener processes. $W=\{W(\mathbf{t}),t\in \R_+^d\}$ be the additive Wiener field define as the sum of $W_i$. For any trend $f$ in $\kHC$ (the reproducing kernel Hilbert…

Interpolation-based techniques have become popularized in recent years because of their inherently modular and local reasoning, which can scale up existing formal verification techniques like theorem proving, model-checking, abstraction…

This paper solves the combinatorics relating the intersection theory of $\psi$-classes of Hassett spaces to that of $\overline{\mathcal{M}}_{g,n}$. A generating function for intersection numbers of $\psi$ classes on all Hassett spaces is…

We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the 'short code' of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and Guruswami [FOCS 2013] to incorporate this…

Let $G\sim G(n,p)$ be a (hidden) Erd\H{o}s-R\'enyi random graph with $p=(1+ \varepsilon)/n$ for some fixed constant $ \varepsilon >0$. Ferber, Krivelevich, Sudakov, and Vieira showed that to reveal a path of length…

The Rosenfeld functional provides excellent results for the prediction of the fluid phase of hard convex particle systems but fails beyond the freezing point. The reason for this limitation is the neglect of orientational and distance…

Standard present day large-scale structure (LSS) analyses make a major assumption in their Bayesian parameter inference --- that the likelihood has a Gaussian form. For summary statistics currently used in LSS, this assumption, even if the…

We consider the well-studied problem of learning intersections of halfspaces under the Gaussian distribution in the challenging \emph{agnostic learning} model. Recent work of Diakonikolas et al. (2021) shows that any Statistical Query (SQ)…

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

For the random 2-SAT formula $F(n,p)$, let $F_C (n,p)$ be the formula left after the pure literal algorithm applied to $F(n,p)$ stops. Using the recently developed Poisson cloning model together with the cut-off line algorithm (COLA), we…