English
Related papers

Related papers: On K-wise Independent Distributions and Boolean Fu…

200 papers

Let $X^n$ be a uniformly distributed $n$-dimensional binary vector, and $Y^n$ be the result of passing $X^n$ through a binary symmetric channel (BSC) with crossover probability $\alpha$. A recent conjecture postulated by Courtade and Kumar…

Information Theory · Computer Science 2019-07-18 Hengjie Yang , Richard D. Wesel

In this article, various results will be demonstrated that enable the delimitation of a zero-free region for holomorphic functions on a set $K$, studying the behavior of their imaginary or real part on the boundary of $K$. These findings…

General Mathematics · Mathematics 2024-03-19 Leonardo de Lima

We consider a probability distribution on the set of Boolean functions in n variables which is induced by random Boolean expressions. Such an expression is a random rooted plane tree where the internal vertices are labelled with connectives…

Combinatorics · Mathematics 2015-09-28 Antoine Genitrini , Bernhard Gittenberger , Veronika Kraus , Cécile Mailler

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…

Distributions over rankings are used to model data in a multitude of real world settings such as preference analysis and political elections. Modeling such distributions presents several computational challenges, however, due to the…

Machine Learning · Computer Science 2014-01-27 Jonathan Huang , Ashish Kapoor , Carlos Guestrin

We construct several new spaces of quantum sequences and their quantum families of maps in sense of So{\l}tan. Then, we introduce noncommutative distributional symmetries associated with these quantum maps and study simple relations between…

Operator Algebras · Mathematics 2015-05-12 Weihua Liu

Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…

Neural and Evolutionary Computing · Computer Science 2026-04-21 Claude Carlet , Marko Čupić , Marko Ðurasevic , Domagoj Jakobovic , Luca Mariot , Stjepan Picek

We study zero sets of twisted stationary Gaussian random functions on the complex plane, i.e., Gaussian random functions that are stochastically invariant under the action of the Weyl-Heisenberg group. This model includes translation…

Probability · Mathematics 2024-09-18 Naomi Feldheim , Antti Haimi , Günther Koliander , José Luis Romero

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…

Computational Complexity · Computer Science 2022-12-02 Edinah K. Gnang , Rongyu Xu

Correlations in music that exist within its waveform are studied. Monophonic wave files of random music are generated and the probability distribution function of time interval between large signal values is analyzed. A power law behavior…

Adaptation and Self-Organizing Systems · Physics 2008-11-25 Vishnu Sreekumar , Mahendra K. Verma , Gaurav Narain , Venkatesh K. S

Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bi-decomposition are often based on BDDs and, more recently,…

Logic in Computer Science · Computer Science 2011-12-15 Huan Chen , Mikolas Janota , Joao Marques-Silva

Call a function f : F_2^n -> {0,1} odd-cycle-free if there are no x_1, ..., x_k in F_2^n with k an odd integer such that f(x_1) = ... = f(x_k) = 1 and x_1 + ... + x_k = 0. We show that one can distinguish odd-cycle-free functions from those…

Data Structures and Algorithms · Computer Science 2012-07-16 Arnab Bhattacharyya , Elena Grigorescu , Prasad Raghavendra , Asaf Shapira

In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…

Data Structures and Algorithms · Computer Science 2026-04-08 Nader H. Bshouty , George Haddad

We investigate Threshold Random Boolean Networks with $K = 2$ inputs per node, which are equivalent to Kauffman networks, with only part of the canalyzing functions as update functions. According to the simplest consideration these networks…

Disordered Systems and Neural Networks · Physics 2007-07-16 Florian Greil , Barbara Drossel

Polynomial representations of Boolean functions over various rings such as $\mathbb{Z}$ and $\mathbb{Z}_m$ have been studied since Minsky and Papert (1969). From then on, they have been employed in a large variety of fields including…

Computational Complexity · Computer Science 2020-05-04 Xiaoming Sun , Yuan Sun , Jiaheng Wang , Kewen Wu , Zhiyu Xia , Yufan Zheng

Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…

Probability · Mathematics 2026-03-03 Bart Jacobs

Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…

Discrete Mathematics · Computer Science 2019-01-24 José E. R. Cury , Pedro T. Monteiro , Claudine Chaouiya

We show that any sequence of well-behaved (e.g. bounded and non-constant) real-valued functions of $n$ boolean variables $\{f_n\}$ admits a sequence of coordinates whose $L^1$ influence under the $p$-biased distribution, for any…

Discrete Mathematics · Computer Science 2024-06-18 Andrew J. Young , Henry D. Pfister

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

Combinatorics · Mathematics 2024-10-29 V. N. Potapov , A. A. Taranenko , Yu. V. Tarannikov