Related papers: New separation between $s(f)$ and $bs(f)$
Using $(2259.3 \pm 11.1)\times10^{6}$ $\psi(2S)$ events acquired with the BESIII detector, the branching fraction of $\psi(2S)\rightarrow\tau^{+}\tau^{-}$ is measured with improved precision to be…
In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree…
We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Based on $(2712.4\pm14.1)\times10^{6}~\psi(2S)$ events, 7.9 fb$^{-1}$ $\psi(3773)$ data, and 0.8 fb$^{-1}$ off-resonance data samples collected with the BESIII detector, we measure the branching fraction of…
We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…
Using samples of (5.93 +/- 0.10) x 10^6 Upsilon(3S) decays and (9.11 +/- 0.14) x 10^6 Upsilon(2S) decays collected with the CLEO detector, we report improved measurements of the branching fractions for the following five transitions:…
We propose a quantum algorithm to estimate the Gowers $U_2$ norm of a Boolean function, and extend it into a second algorithm to distinguish between linear Boolean functions and Boolean functions that are $\epsilon$-far from the set of…
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…
Various nonleptonic decay channels mediated by the quark-level subprocess $b\to s\bar{s} s$ show hints of deviation from the Standard Model expectations. We analyse the double-vector decay $B\to\phi K^\ast$ with different generic new…
The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…
We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…
For a discrete function $f\left( x\right) $ on a discrete set, the finite difference can be either forward and backward. However, we observe that if $ f\left( x\right) $ is a sum of two functions $f\left( x\right) =f_{1}\left( x\right)…
The ability of new instruments for providing accurate inferences of vector magnetic fields and line-of-sight velocities of the solar plasma depends a great deal on the sensitivity to these physical quantities of the spectral lines chosen to…
A new way of probing new physics in the $B$ meson system is provided. We define double ratios for the observables of $B_{d,s}$-$\Bbar_{d,s}$ mixings and $B_{d,s}\to\mu^+\mu^-$ decays, and find simple relations between the observables. By…
We have measured the frequency splitting between the $(2S, F=1/2)$ and $(2S, F=3/2)$ hyperfine sublevels in atomic deuterium by an optical differential method based on two-photon Doppler-free spectroscopy on a cold atomic beam. The result…
Recently, Deshpande et al. introduced a new measure of the complexity of a Boolean function. We call this measure the "goal value" of the function. The goal value of $f$ is defined in terms of a monotone, submodular utility function…
We review new studies of the time dependence of B0s - B0s-bar mixing by the ALEPH, DELPHI and SLD Collaborations, with an emphasis on the different analysis methods used. Combining all available results yields a preliminary lower limit on…
Detection of correlation in a pair of random graphs is a fundamental statistical and computational problem that has been extensively studied in recent years. In this work, we consider a pair of correlated (sparse) stochastic block models…
We present an adaptive tester for the unateness property of Boolean functions. Given a function $f:\{0,1\}^n \to \{0,1\}$ the tester makes $O(n \log(n)/\epsilon)$ adaptive queries to the function. The tester always accepts a unate function,…