Related papers: Structure of sparse Boolean functions over Abelian…

Let $G$ be a non-trivial torsion free group and $s(t)=g_{1}t^{\epsilon_{1}}g_{2}t^{\epsilon_{2}} \cdots g_{n}t^{\epsilon_{n}}=1 \; (g_{i} \in G,\ \epsilon_i=\pm 1)$ be an equation over $G$ containing no blocks of the form…

We investigate the possibility of the existence of nonsparse strongly summable ultrafilters on certain abelian groups. In particular, we show that every strongly summable ultrafilter on the countably infinite Boolean group is sparse. This…

We investigate threshold phenomena in weighted $\ell^2$-spaces and characterize the critical regimes where elements with either small support or maximally bad range can be constructed. Our results are shown to be optimal in several…

Consider a_1,a_2,...,a_n, arbitrary elements of R. We characterize those real functions f that decompose into the sum of a_j-periodic functions, i.e., f=f_1+...+f_n with D_{a_j}f(x):=f(x+a_j)-f(x)=0. We show that f has such a decomposition…

A key fact in the theory of Boolean functions $f : \{0,1\}^n \to \{0,1\}$ is that they often undergo sharp thresholds. For example: if the function $f : \{0,1\}^n \to \{0,1\}$ is monotone and symmetric under a transitive action with…

Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been…

Block sparsity is a widely exploited structure in sparse recovery, offering significant gains when signal blocks are known. Yet, practical signals often exhibit unknown block boundaries and isolated non-zero entries, which challenge…

We propose an approach for decomposing Boolean satisfiability problems while extending recent results of \cite{sul2} on solving Boolean systems of equations. Developments in \cite{sul2} were aimed at the expansion of functions $f$ in…

The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…

For any finite group $G$, any transitive $G$-set $X$ and any field ${\Bbb F}$, we consider the vector space ${\Bbb F}^X$ of all functions from $X$ to ${\Bbb F}$, which is a $G$-space isomorphic to the permutation ${\Bbb F} G$-module ${\Bbb…

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

In the problem of classical group testing one aims to identify a small subset (of size $d$) diseased individuals/defective items in a large population (of size $n$). This process is based on a minimal number of suitably-designed group tests…

Let $G$ be a compact group. For $1\leq p\leq\infty$ we introduce a class of Banach function algebras $\mathrm{A}^p(G)$ on $G$ which are the Fourier algebras in the case $p=1$, and for $p=2$ are certain algebras discovered in…

Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…

Standard sparse pseudo-input approximations to the Gaussian process (GP) cannot handle complex functions well. Sparse spectrum alternatives attempt to answer this but are known to over-fit. We suggest the use of variational inference for…

Lusin's Theorem states that, for every Borel-measurable function $\bf{f}$ on $\mathbb R$ and every $\epsilon>0$, there exists a continuous function $\bf{g}$ on $\mathbb R$ which is equal to $\bf{f}$ except on a set of measure $<\epsilon$.…

Let $\mathsf{TH}_k$ denote the $k$-out-of-$n$ threshold function: given $n$ input Boolean variables, the output is $1$ if and only if at least $k$ of the inputs are $1$. We consider the problem of computing the $\mathsf{TH}_k$ function…

In this paper we elaborate on earlier work by the same authors in which a novel Bayesian inference framework for testing the strong-field dynamics of General Relativity using coalescing compact binaries was proposed. Unlike methods that…

The degree-$d$ Chow parameters of a Boolean function $f: \{-1,1\}^n \to \mathbb{R}$ are its degree at most $d$ Fourier coefficients. It is well-known that degree-$d$ Chow parameters uniquely characterize degree-$d$ polynomial threshold…

Accurately specifying covariance structures is critical for valid inference in longitudinal and functional data analysis, particularly when data are sparsely observed. In this study, we develop a global goodness-of-fit test to assess…