English
Related papers

Related papers: On the Sensitivity of Cyclically-Invariant Boolean…

200 papers

We introduce a variational theory for processes adapted to the multi-dimensional Brownian motion filtration that provides a differential structure allowing to describe infinitesimal evolution of Wiener functionals at very small scales. The…

Probability · Mathematics 2017-12-01 Dorival Leão , Alberto Ohashi , Alexandre B. Simas

Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.

Combinatorics · Mathematics 2009-10-01 Demetres Christofides

The Sensitivity Conjecture and the Log-rank Conjecture are among the most important and challenging problems in concrete complexity. Incidentally, the Sensitivity Conjecture is known to hold for monotone functions, and so is the Log-rank…

Computational Complexity · Computer Science 2016-04-08 Chengyu Lin , Shengyu Zhang

We construct the field theory which describes the universal properties of the quasi-static isotropic depinning transition for interfaces and elastic periodic systems at zero temperature, taking properly into account the non-analytic form of…

Condensed Matter · Physics 2009-11-07 Pierre Le Doussal , Kay Joerg Wiese , Pascal Chauve

It is known that the order of correlation immunity of a nonconstant unbalanced Boolean function in $n$ variables cannot exceed $2n/3-1$; moreover, it is $2n/3-1$ if and only if the function corresponds to an equitable $2$-partition of the…

Combinatorics · Mathematics 2023-04-11 Denis S. Krotov , Konstantin V. Vorob'ev

We define the local trace function for subspaces of $\ltworn$ which are invariant under integer translation. Our trace function contains the dimension function and the spectral function defined by Bownik and Rzeszotnik and completely…

Functional Analysis · Mathematics 2007-10-25 Dorin Ervin Dutkay

$\beta$-functions for abelian and non-abelian gauge theories are studied in the regime where the large $N$ flavor expansion is applicable. The first nontrivial order in the 1/$N$ expansion is known for any value of $N\alpha$, and there are…

High Energy Physics - Phenomenology · Physics 2010-10-21 B. Holdom

Correlation-immune (CI) multi-output Boolean functions have the property of keeping the same output distribution when some input variables are fixed. Recently, a new application of CI functions has appeared in the system of resisting…

Information Theory · Computer Science 2019-08-27 Jinjin Chai , Zilong Wang , Sihem Mesnager , Guang Gong

We extend the definitions of complexity measures of functions to domains such as the symmetric group. The complexity measures we consider include degree, approximate degree, decision tree complexity, sensitivity, block sensitivity, and a…

Computational Complexity · Computer Science 2020-10-16 Neta Dafni , Yuval Filmus , Noam Lifshitz , Nathan Lindzey , Marc Vinyals

In a private communication, K. Ono conjectured that any mock theta function of weight 1/2 or 3/2 can be congruent modulo a prime $p$ to a weakly holomorphic modular form for just a few values of $p$. In this paper we describe when such a…

Number Theory · Mathematics 2014-02-27 René Olivetto

The $O(d,d)$ invariant worldsheet theory for bosonic string theory with $d$ abelian isometries is employed to compute the beta functions and Weyl anomaly at one-loop. We show that vanishing of the Weyl anomaly coefficients implies the…

High Energy Physics - Theory · Physics 2021-11-10 Roberto Bonezzi , Tomas Codina , Olaf Hohm

We present a conformal theory for intermittent scalar fields. As an example, we consider the energy flux from large to small scales in the developed turbulent flow. The conformal correlation functions are found in the inertial range of…

Chaotic Dynamics · Physics 2007-05-23 G. A. Kuzmin

A Boolean function $f:\{0,1\}^n\to \{0,1\}$ is $k$-linear if it returns the sum (over the binary field $F_2$) of $k$ coordinates of the input. In this paper, we study property testing of the classes $k$-Linear, the class of all $k$-linear…

Computational Complexity · Computer Science 2020-06-09 Nader H. Bshouty

We show that unbounded fan-in boolean formulas of depth $d+1$ and size $s$ have average sensitivity $O(\frac{1}{d}\log s)^d$. In particular, this gives a tight $2^{\Omega(d(n^{1/d}-1))}$ lower bound on the size of depth $d+1$ formulas…

Computational Complexity · Computer Science 2015-09-01 Benjamin Rossman

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

Quantum Algebra · Mathematics 2016-08-02 Guus Regts , Alexander Schrijver , Bart Sevenster

We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials $P_n$ in $n$ variables, all of whose monomials have positive coefficients, such that $P_n$ can be…

Computational Complexity · Computer Science 2025-12-23 Bruno Cavalar , Théo Borém Fabris , Partha Mukhopadhyay , Srikanth Srinivasan , Amir Yehudayoff

The aim of this paper is to develop analytic techniques to deal with certain monotonicity of combinatorial sequences. (1) A criterion for the monotonicity of the function $\sqrt[x]{f(x)}$ is given, which is a continuous analog for one…

Combinatorics · Mathematics 2015-04-29 Bao-Xuan Zhu

We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…

Data Structures and Algorithms · Computer Science 2019-04-11 Xi Chen , Erik Waingarten

We prove that the Poisson Boolean model, also known as the Gilbert disc model, is noise sensitive at criticality. This is the first such result for a Continuum Percolation model, and the first for which the critical probability p_c \ne 1/2.…

Probability · Mathematics 2015-07-07 Daniel Ahlberg , Erik Broman , Simon Griffiths , Robert Morris

In a recent paper by Jonasson and Steif, definitions to describe the volatility of sequences of Boolean functions, \( f_n \colon \{ -1,1 \}^n \to \{ -1,1 \} \) were introduced. We continue their study of how these definitions relate to…

Probability · Mathematics 2020-05-28 Malin Palö Forsström