相关论文: On the Sensitivity of Cyclically-Invariant Boolean…
The Bloom-Gilman local duality of the inelastic structure function of the proton, the deuteron and light complex nuclei is investigated using available experimental data in the squared four-momentum transfer range from 0.3 to 5 (GeV/c)**2.…
The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is epsilon-far from having that property. The performance of the algorithm is judged by how many calls need to be made to…
The three invariants of C$^{1/2}$ are key to expressing this tensor and its inverse as a polynomial in C. Simple and symmetric expressions are presented connecting the two sets of invariants $I_1, I_2,I_3$ and $i_1, i_2,i_3 $ of C and…
We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{…
We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…
We prove a new bound on the average sensitivity of polynomial threshold functions. In particular we show that a polynomial threshold function of degree $d$ in at most $n$ variables has average sensitivity at most…
The results showing a quantum query complexity of $\Theta(N^{1/3})$ for the collision problem do not apply to random functions. The issues are two-fold. First, the $\Omega(N^{1/3})$ lower bound only applies when the range is no larger than…
Transient algebra is a multi-valued algebra for hazard detection in gate circuits. Sequences of alternating 0's and 1's, called transients, represent signal values, and gates are modeled by extensions of boolean functions to transients.…
Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root…
In this paper, we mainly study the relation between regularity, independence and mean sensitivity for minimal systems. In the first part, we show that if a minimal system is incontractible, or local Bronstein with an invariant Borel…
We give a $2^{\tilde{O}(\sqrt{n}/\epsilon)}$-time algorithm for properly learning monotone Boolean functions under the uniform distribution over $\{0,1\}^n$. Our algorithm is robust to adversarial label noise and has a running time nearly…
A boolean function of $n$ boolean variables is {correlation-immune} of order $k$ if the function value is uncorrelated with the values of any $k$ of the arguments. Such functions are of considerable interest due to their cryptographic…
The equivalence of the characteristic function approach and the probabilistic approach to monotone and boolean convolutions is proven for non-compactly supported probability measures. A probabilistically motivated definition of the…
We investigate a possibility of scale invariant but non-conformal supersymmetric field theories from a perturbative approach. The explicit existence of monotonically decreasing a-function that generates beta-functions as a gradient flow…
The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…
We define the notion of an invariant function on a cluster ensemble with respect to an action of the cluster modular group on its associated function fields. We realize many examples of previously studied functions as elements of this type…
We consider a particular class of n-dimensional homogeneous diffusions all of which have an identity diffusion matrix and a drift function that is piecewise constant and scale invariant. Abstract stochastic calculus immediately gives us…
We consider non oscillatory functions and prove an everywhere Fourier Inversion Theorem for functions of very moderate decrease. The proofs rely on some ideas in nonstandard analysis.
We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit Boolean function. We compare the classical and the quantum case, and we determine for how many…
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…