English
Related papers

Related papers: Structure of sparse Boolean functions over Abelian…

200 papers

Let $N_1(m)=\max\{n \colon \phi(n) \leq m\}$ and $N_1 = \{N_1(m) \colon m \in \phi(\mathbb{N})\}$ where $\phi(n)$ denotes the Euler's totient function. Masser and Shiu \cite{masser} call the elements of $N_1$ as `sparsely totient numbers'…

Number Theory · Mathematics 2019-07-24 Mithun Kumar Das , Pramod Eyyunni , Bhuwanesh Rao Patil

We will establish in this note a stability result for sparse convolutions on torsion-free additive (discrete) abelian groups. Sparse convolutions on torsion-free groups are free of cancellations and hence admit stability, i.e. injectivity…

Discrete Mathematics · Computer Science 2014-04-09 Philipp Walk , Peter Jung

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

Combinatorics · Mathematics 2025-06-27 Kevin Zhao

Let $f:\{-1,1\}^n$ be a polynomial with at most $s$ non-zero real coefficients. We give an algorithm for exactly reconstructing f given random examples from the uniform distribution on $\{-1,1\}^n$ that runs in time polynomial in $n$ and…

Machine Learning · Computer Science 2014-11-10 Murat Kocaoglu , Karthikeyan Shanmugam , Alexandros G. Dimakis , Adam Klivans

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

Data Structures and Algorithms · Computer Science 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

Bourgain showed that any noise stable Boolean function $f$ can be well-approximated by a junta. In this note we give an exponential sharpening of the parameters of Bourgain's result under the additional assumption that $f$ is a halfspace.

Computational Complexity · Computer Science 2012-03-01 Ilias Diakonikolas , Ragesh Jaiswal , Rocco A. Servedio , Li-Yang Tan , Andrew Wan

We consider the Stochastic Boolean Function Evaluation (SBFE) problem in the well-studied case of $k$-of-$n$ functions: There are independent Boolean random variables $x_1,\dots,x_n$ where each variable $i$ has a known probability $p_i$ of…

Data Structures and Algorithms · Computer Science 2025-11-25 Mads Anker Nielsen , Lars Rohwedder , Kevin Schewior

In this paper we study the separation between two complexity measures: the degree of a Boolean function as a polynomial over the reals and its block sensitivity. We show that separation between these two measures can be improved from $…

Computational Complexity · Computer Science 2021-06-22 Nikolay V. Proskurin

The approximate degree of a Boolean function $f \colon \{-1, 1\}^n \rightarrow \{-1, 1\}$ is the least degree of a real polynomial that approximates $f$ pointwise to error at most $1/3$. We introduce a generic method for increasing the…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler

Let $G$ be a finite abelian group. Let $f: G \to {\mathbb C}$ be a signal (i.e. function). The classical uncertainty principle asserts that the product of the size of the support of $f$ and its Fourier transform $\hat f$, $\text{supp}(f)$…

Classical Analysis and ODEs · Mathematics 2023-11-09 Alex Iosevich , Azita Mayeli

This paper presents a systematic study for the general theory of non-Abelian Fourier series of integrable functions on the homogeneous space $\mathbf{\Gamma}\backslash SE(d)$, where $SE(d)$ is the special Euclidean group in dimension $d$,…

Functional Analysis · Mathematics 2024-03-26 Arash Ghaani Farashahi , Gregory S. Chirikjian

We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…

Logic · Mathematics 2026-03-23 Eugenio Clerico

Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…

Symbolic Computation · Computer Science 2014-06-26 Jean-Charles Faugere , Pierre-Jean Spaenlehauer , Jules Svartz

This manuscript includes some classical results we select apart from the new results we've found on the Analysis of Boolean Functions and Fourier-Entropy-Influence conjecture. We try to ensure the self-completeness of this work so that…

Combinatorics · Mathematics 2023-11-21 Xiao Han

Indicator functions mentioned in the title are constructed on an arbitrary nondiscrete locally compact Abelian group of finite dimension. Moreover, they can be obtained by small perturbation from any indicator function fixed beforehand. In…

Classical Analysis and ODEs · Mathematics 2020-06-05 S. V. Kislyakov , P. S. Perstneva

Assume that we observe a sample of size n composed of p-dimensional signals, each signal having independent entries drawn from a scaled Poisson distribution with an unknown intensity. We are interested in estimating the sum of the n unknown…

Statistics Theory · Mathematics 2018-01-19 Olivier Collier , Arnak Dalalyan

Let $G$ be a topological Abelian semigroup with unit, let $E$ be a Banach space, and let $C(G,E)$ denote the set of continuous functions $f\colon G\to E$. A function $f\in C(G,E)$ is a generalized polynomial, if there is an $n\ge 0$ such…

Functional Analysis · Mathematics 2020-06-24 Miklos Laczkovich
‹ Prev 1 4 5 6 7 8 10 Next ›