相关论文: On the Sensitivity of Cyclically-Invariant Boolean…
We study the problem of testing whether an unknown $n$-variable Boolean function is a $k$-junta in the distribution-free property testing model, where the distance between functions is measured with respect to an arbitrary and unknown…
In this note we explore the relationship between the operation of convolution of functions and the Eulerian integrals. This approach allow us to obtain some expressions for the convolution of a certain class of functions in terms of the…
Properties of four quintic theta functions are developed in parallel with those of the classical Jacobi null theta functions. The quintic theta functions are shown to satisfy analogues of Jacobi's quartic theta function identity and…
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
A non-negative function $f$ is said to be 'bell-shaped' if $f$ tends to zero at $\pm \infty$ and the $n$-th derivative of $f$ changes its sign $n$ times for every $n = 0, 1, 2, \ldots$ We provide a complete characterisation of the class of…
Beurling slow variation is generalized to Beurling regular variation. A Uniform Convergence Theorem, not previously known, is proved for those functions of this class that are measurable or have the Baire property. This permits their…
We prove that any non-adaptive algorithm that tests whether an unknown Boolean function $f: \{0, 1\}^n\to \{0, 1\}$ is a $k$-junta or $\epsilon$-far from every $k$-junta must make $\widetilde{\Omega}(k^{3/2} / \epsilon)$ many queries for a…
We study monotonicity testing of Boolean functions over the hypergrid $[n]^d$ and design a non-adaptive tester with $1$-sided error whose query complexity is $\tilde{O}(d^{5/6})\cdot \text{poly}(\log n,1/\epsilon)$. Previous to our work,…
We study functions on the infinite-dimensional Hamming cube $\{-1,1\}^\infty$, in particular Boolean functions into $\{-1,1\}$, generalising results on analysis of Boolean functions on $\{-1,1\}^n$ for $n\in\mathbb{N}$. The notion of noise…
We show how to distinguish circuits with $\log k$ negations (a.k.a $k$-monotone functions) from uniformly random functions in $\exp\left(\tilde{O}\left(n^{1/3}k^{2/3}\right)\right)$ time using random samples. The previous best…
Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…
Homogeneous rotation symmetric Boolean functions have been extensively studied in recent years because of their applications in cryptography. Little is known about the basic question of when two such functions are affine equivalent. The…
We describe a new construction of Boolean functions. A specific instance of our construction provides a 30-variable Boolean function having min-entropy/influence ratio to be $128/45 \approx 2.8444$ which is presently the highest known value…
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…
We develop a sensitivity function for the design of electron optics using an adjoint approach based on a form of reciprocity implicit in Hamilton's equations of motion. The sensitivity function, which is computed with a small number of…
We pose some open problems related to boundedness of real-valued functions on balleans and coarse spaces. Also we prove that the Bergman property of groups is a coarse invariant. A special attention is payed to balleans on groups.
It has long been known that any Boolean function that depends on n input variables has both degree and exact quantum query complexity of Omega(log n), and that this bound is achieved for some functions. In this paper we study the case of…
In this paper, we study the properties of the Eberlein convolution of measures and introduce a twisted version of it. For functions we show that the twisted Eberlein convolution can be seen as a translation invariant function-valued inner…
The approximate degree of a Boolean function is the least degree of a real multilinear polynomial approximating it in the $\ell_\infty$-norm over the Boolean hypercube. We show that the approximate degree of the Bipartite Perfect Matching…
There exist several interesting results in the literature on subnormal operator tuples having their spectral properties tied to the geometry of strictly pseudoconvex domains or to that of bounded symmetric domains in $\C^n$. We introduce a…