English
Related papers

Related papers: Are most Boolean functions determined by low frequ…

200 papers

Let $f$ be a real-valued, degree-$d$ Boolean function defined on the $n$-dimensional Boolean cube $\{\pm 1\}^{n}$, and $f(x) = \sum_{S \subset \{1,\ldots,d\}} \widehat{f}(S) \prod_{k \in S} x_k$ its Fourier-Walsh expansion. The main result…

Functional Analysis · Mathematics 2017-06-13 Andreas Defant , Mieczysław Mastyło , Antonio Pérez

A Boolean function $g$ is said to be an optimal predictor for another Boolean function $f$, if it minimizes the probability that $f(X^{n})\neq g(Y^{n})$ among all functions, where $X^{n}$ is uniform over the Hamming cube and $Y^{n}$ is…

Discrete Mathematics · Computer Science 2019-03-27 Nir Weinberger , Ofer Shayevitz

Boolean networks constitute relevant mathematical models to study the behaviours of genetic and signalling networks. These networks define regulatory influences between molecular nodes, each being associated to a Boolean variable and a…

Discrete Mathematics · Computer Science 2025-06-24 José E. R. Cury , Patrícia Tenera Roxo , Vasco Manquinho , Claudine Chaouiya , Pedro T. Monteiro

We use a method of Goulden and Jackson to bound freq_1(K), the limiting frequency of 1 in the Kolakoski word K. We prove that |freq_1(K) - 1/2| <= 17/762, assuming the limit exists, and establish the semi-rigorous bound |freq_1(K) - 1/2| <=…

Combinatorics · Mathematics 2008-09-26 Elizabeth J. Kupin , Eric S. Rowland

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…

Quantum Physics · Physics 2016-09-08 Fabio Benatti , Luca Marinatto

In this paper some cryptographic properties of Boolean functions, including weight, balancedness and nonlinearity, are studied, particularly focusing on splitting functions and cubic Boolean functions. Moreover, we present some quantities…

Cryptography and Security · Computer Science 2024-06-17 Augustine Musukwa , Massimiliano Sala , Marco Zaninelli

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

Information Theory · Computer Science 2014-04-11 Emanuele Bellini

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…

Classical Analysis and ODEs · Mathematics 2017-03-21 Zoltan Buczolich

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…

Computational Complexity · Computer Science 2017-03-20 Mark Bun , Justin Thaler

The origin of the low-frequency noise with power spectrum $1/f^\beta$ (also known as $1/f$ fluctuations or flicker noise) remains a challenge. Recently, the nonlinear stochastic differential equations for modeling $1/f^\beta$ noise have…

Data Analysis, Statistics and Probability · Physics 2016-01-20 B. Kaulakys , M. Alaburda , J. Ruseckas

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

Recently the H1 collaboration has published a ``determination'' of the structure function F_L(x,Q^2) at low x. I address the question of how reliable this determination really is. I argue that it is in fact a consistency check of a given…

High Energy Physics - Phenomenology · Physics 2009-10-30 Robert S. Thorne

Given a continuous real-valued function on [0, 1], and a closed subset E \subset [0, 1] we denote by f E the restriction of f to E, that is, the function defined only on E that takes the same values as f at every point of E >. The…

Classical Analysis and ODEs · Mathematics 2007-11-29 Jean-Pierre Kahane , Yitzhak Katznelson

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form $f(x)=\sum_{i=1}^{\frac{m}{2}-1} Tr^n_1(c_ix^{1+2^{ei}})+ Tr_1^{n/2}(c_{m/2}x^{1+2^{n/2}}) ,$ where $n=me$, $m$ is even and $c_i\in…

Information Theory · Computer Science 2013-08-14 Chunming Tang , Yanfeng Qi

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Combinatorics · Mathematics 2007-05-23 Constanza Riera , Lars Eirik Danielsen , Matthew G. Parker

In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean functions and show that they are almost balanced.

Information Theory · Computer Science 2011-08-24 Jiyou Li

Extending previous analyses on function classes like linear functions, we analyze how the simple (1+1) evolutionary algorithm optimizes pseudo-Boolean functions that are strictly monotone. Contrary to what one would expect, not all of these…

Neural and Evolutionary Computing · Computer Science 2015-03-17 Benjamin Doerr , Thomas Jansen , Dirk Sudholt , Carola Winzen , Christine Zarges

Under certain conditions, we obtain sharp bounds on some functionals defined in the coefficient space of starlike functions. It has been found that the functionals are closely associated with certain coefficient problems, which are of…

Complex Variables · Mathematics 2009-10-23 K. O. Babalola

We prove that $1-o(1)$ fraction of all $k$-SAT functions on $n$ Boolean variables are unate (i.e., monotone after first negating some variables), for any fixed positive integer $k$ and as $n \to \infty$. This resolves a conjecture by…

Combinatorics · Mathematics 2023-10-04 József Balogh , Dingding Dong , Bernard Lidický , Nitya Mani , Yufei Zhao

A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…

Information Theory · Computer Science 2016-11-22 Lin Sok , MinJia Shi , Patrick Solé