English
Related papers

Related papers: Structure of sparse Boolean functions over Abelian…

200 papers

Several recent works [DHLNSY25, CPPS25a, CPPS25b] have studied a model of property testing of Boolean functions under a \emph{relative-error} criterion. In this model, the distance from a target function $f: \{0,1\}^n \to \{0,1\}$ that is…

Computational Complexity · Computer Science 2026-03-24 Xi Chen , Anindya De , Yizhi Huang , Shivam Nadimpalli , Rocco A. Servedio , Tianqi Yang

We show that for a locally compact group $G$, amongst a class which contains amenable and small invariant neighbourhood groups, that its Fourier algebra $A(G)$ satisfies a completely bounded version Pisier's similarity property with…

Functional Analysis · Mathematics 2016-03-21 Hun Hee Lee , Ebrahim Samei , Nico Spronk

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

Computational Complexity · Computer Science 2026-05-27 Haakon Larsen , Tushant Mittal , Silas Richelson , Sourya Roy

We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…

Combinatorics · Mathematics 2017-06-30 David Ellis , Yuval Filmus , Ehud Friedgut

$\newcommand{\EC}{\mathsf{EC}}\newcommand{\KW}{\mathsf{KW}}\newcommand{\DT}{\mathsf{DT}}\newcommand{\psens}{\mathsf{psens}} \newcommand{\calB}{{\cal B}} $ For a Boolean function $f:\{0,1\}^n \to \{0,1\}$ computed by a circuit $C$ over a…

Computational Complexity · Computer Science 2020-09-17 Krishnamoorthy Dinesh , Samir Otiv , Jayalal Sarma

This is the first installment in a series of papers devoted to examining certain aspects of the asymptotic value distribution and distribution of zeros manifested by members of a broad class of linear combinations of L-functions in the…

Number Theory · Mathematics 2013-11-20 D. A. Hejhal

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

A function $f$ from an Abelian group $(A,+)$ to an Abelian group $(B,+)$ is $(n, m, S)$ zero-difference (ZD), if $S=\{\lambda_\alpha \mid \alpha \in A\setminus\{0\}\}$ where $n=|A|$, $m=|f(A)|$ and $\lambda_\alpha=|\{x \in A \mid…

Combinatorics · Mathematics 2026-01-01 Zongxiang Yi , Dingyi Pei , ChunmingTang

We give a stability result for sparse convolutions on $\ell^2(G)\times \ell^1(G)$ for torsion-free discrete Abelian groups $G$ such as $\mathbb{Z}$. It turns out, that the torsion-free property prevents full cancellation in the convolution…

Information Theory · Computer Science 2014-11-25 Philipp Walk , Peter Jung , Götz E. Pfander

In this paper we approximate high-dimensional functions $f\colon\mathbb T^d\to\mathbb C$ by sparse trigonometric polynomials based on function evaluations. Recently it was shown that a dimension-incremental sparse Fourier transform (SFT)…

Numerical Analysis · Mathematics 2023-06-07 Felix Bartel , Fabian Taubert

Stochastic Boolean Function Evaluation is the problem of determining the value of a given Boolean function f on an unknown input x, when each bit of x_i of x can only be determined by paying an associated cost c_i. The assumption is that x…

Data Structures and Algorithms · Computer Science 2013-08-12 Amol Deshpande , Lisa Hellerstein , Devorah Kletenik

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

In 2007, Carlet and Ding introduced two parameters, denoted by $Nb_F$ and $NB_F$, quantifying respectively the balancedness of general functions $F$ between finite Abelian groups and the (global) balancedness of their derivatives $D_a…

Information Theory · Computer Science 2023-05-11 Shihui Fu , Xiutao Feng , Qiang Wang , Claude Carlet

Let $G$ be a locally compact Abelian group, and $w: G\to (0, \infty)$ be a Borel measurable weighted function. In this paper, the algebraic and topological properties of group algebra are studied and assessed. We show that the weighted…

Functional Analysis · Mathematics 2023-01-10 Maryam Aghakoochai , Ali Rejali

We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…

Computational Complexity · Computer Science 2018-02-27 R. Ryan Williams

When the infection prevalence of a disease is low, Dorfman showed 80 years ago that testing groups of people can prove more efficient than testing people individually. Our goal in this paper is to propose new group testing algorithms that…

Methodology · Statistics 2020-07-23 Marco Cuturi , Olivier Teboul , Quentin Berthet , Arnaud Doucet , Jean-Philippe Vert

We show that any Littlewood--Paley square function $S$ satisfying a minimal local testing condition is dominated by a sparse form, \begin{equation*} \langle (Sf)^2,g \rangle\le C \sum_{I \in \mathscr{S}} \langle \lvert f\rvert\rangle_I^2…

Classical Analysis and ODEs · Mathematics 2020-11-03 Gianmarco Brocchi

A partial difference set $S$ in a finite group $G$ satisfying $1 \notin S$ and $S = S^{-1}$ corresponds to an undirected strongly regular Cayley graph ${\rm Cay}(G,S)$. While the case when $G$ is abelian has been thoroughly studied, there…

Combinatorics · Mathematics 2020-09-17 Eric Swartz , Gabrielle Tauscheck

Let $T_{\epsilon}$ be the noise operator acting on Boolean functions $f:\{0, 1\}^n\to \{0, 1\}$, where $\epsilon\in[0, 1/2]$ is the noise parameter. Given $\alpha>1$ and fixed mean $\mathbb{E} f$, which Boolean function $f$ has the largest…

Probability · Mathematics 2021-01-27 Jiange Li , Muriel Medard

We present a new deterministic algorithm for the sparse Fourier transform problem, in which we seek to identify k << N significant Fourier coefficients from a signal of bandwidth N. Previous deterministic algorithms exhibit quadratic…

Numerical Analysis · Mathematics 2012-07-27 David Lawlor , Yang Wang , Andrew Christlieb
‹ Prev 1 3 4 5 6 7 10 Next ›