Related papers: On Block Sensitivity and Fractional Block Sensitiv…
Despite the large research effort devoted to learning dependencies between time series, the state of the art still faces a major limitation: existing methods learn partial correlations but fail to discriminate across distinct frequency…
Let $f(n)$ denote a multiplicative function with range $\{-1,0,1\}$, and let $F(x) = \sum_{n\leq x} f(n)$. Then $F(x)/\sqrt{x} = a\sqrt{x} + b + E(x)$, where $a$ and $b$ are constants and $E(x)$ is an error term that either tends to $0$ in…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to…
We present the first observation of the decay $B^+\to\rho^+K^0$, using a data sample of 348 fb$^{-1}$ collected at the $\Upsilon(4S)$ resonance with the \babar detector.The branching fraction and charge asymmetry are measured to be…
Fractional difference operators possess nonlocal structure which largely affects and complicates the qualitative analysis of fractional difference equations. In this article, we discuss the effect of this memory property on asymptotic…
Sensitivity is an important complexity measure of Boolean functions. In this paper we present properties of the minimal and maximal sensitivity of the simplified weighted sum function. A simple close formula of the minimal sensitivity of…
We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity. On the one hand, we employ symmetry breakers. On the other hand, we enrich the (relatively weak) QBF resolution calculus Q-Res with the…
The present work is concerned with the eqiucontinuity and sensitivity of iterated function systems (IFSs). Here, we consider more general case of IFSs, i.e. the IFSs generated by a family of relations. We generalize the concepts of…
In the first part of this talk I discuss two somewhat different supergravity approaches to calculating correlation functions in strongly coupled Yang-Mills theory. The older approach relates two-point functions to cross-sections for…
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We compare several different possible definitions. Our main…
Symbolic regression that aims to detect underlying data-driven models has become increasingly important for industrial data analysis. For most existing algorithms such as genetic programming (GP), the convergence speed might be too slow for…
A new measurement of the b -> \Lambda_b production fraction multiplied by the \Lambda_b -> J/\psi \Lambda branching fraction was performed by the D0 experiment using 6.1 fb^{-1} of p\bar{p} collisions at \sqrt{s} = 1.96 TeV. The result of…
A measurement of the branching fraction of the decay $B_s^0 \to K_S^0 K_S^0$ is performed using proton-proton collision data corresponding to an integrated luminosity of 5 $fb^{-1}$ collected by the LHCb experiment between 2011 and 2016.…
$ $Let $F$ be a multivariate function from a product set $\Sigma^n$ to an Abelian group $G$. A $k$-partition of $F$ with cost $\delta$ is a partition of the set of variables $\mathbf{V}$ into $k$ non-empty subsets $(\mathbf{X}_1, \dots,…
We explicitly quantify the empirically observed phenomenon that estimation under a stochastic block model (SBM) is hard if the model contains classes that are similar. More precisely, we consider estimation of certain functionals of random…
We improve both upper and lower bounds for the distribution-free testing of monotone conjunctions. Given oracle access to an unknown Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ and sampling oracle access to an unknown distribution…
In this note, we develop a bounded-error quantum algorithm that makes $\tilde O(n^{1/4}\varepsilon^{-1/2})$ queries to a Boolean function $f$, accepts a monotone function, and rejects a function that is $\varepsilon$-far from being…
Fission excitation functions have been measured for a chain of neighboring compound nuclei, from 207Po to 212Po. We present a new analysis which provides a determination of the fission barriers and ground state shell effects with nearly…