English
Related papers

Related papers: A Note on "On the Construction of Boolean Function…

200 papers

In this work we find a new formula for matrix averages over the Gaussian ensemble. Let ${\bf H}$ be an $n\times n$ Gaussian random matrix with complex, independent, and identically distributed entries of zero mean and unit variance. Given…

Probability · Mathematics 2013-07-16 Gabriel H. Tucci , Maria V. Vega

We study the problem of maximizing a monotone submodular set function subject to linear packing constraints. An instance of this problem consists of a matrix $A \in [0,1]^{m \times n}$, a vector $b \in [1,\infty)^m$, and a monotone…

Data Structures and Algorithms · Computer Science 2012-05-01 Yossi Azar , Iftah Gamzu

In this article we present an algorithm to efficiently evaluate the exchange matrix in periodic systems when Gaussian basis set with pseudopotentials are used. The usual algorithm for evaluating exchange matrix scales cubically with the…

Strongly Correlated Electrons · Physics 2022-11-11 Sandeep Sharma , Alec F. White , Gregory Beylkin

The action principle is used to derive, by an entirely algebraic approach, gauge transformations of the full vacuum-to-vacuum transition amplitude (generating functional) from the Coulomb gauge to arbitrary covariant gauges and in turn to…

High Energy Physics - Theory · Physics 2008-11-26 Edouard B. Manoukian , Suppiya Siranan

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

Using fractional-calculus mathematics, a novel approach is introduced to rewrite modified Bessel functions in series form using simple elementary functions. Then, a statistical characterization of the total receive-SNR at the destination,…

Information Theory · Computer Science 2015-06-16 Mehdi M. Molu

Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been…

Computational Complexity · Computer Science 2015-06-09 Andris Ambainis , Krišjānis Prūsis , Jevgēnijs Vihrovs

Value distribution and uniqueness problems of difference operator of an entire function have been investigated in this article. This research shows that a finite ordered entire function $ f $ when sharing a set $ \mathcal{S}=\{\alpha(z),…

Complex Variables · Mathematics 2020-07-30 Molla Basir Ahamed

Given a graph $G$, a community structure $\mathcal{C}$, and a budget $k$, the fair influence maximization problem aims to select a seed set $S$ ($|S|\leq k$) that maximizes the influence spread while narrowing the influence gap between…

Data Structures and Algorithms · Computer Science 2023-11-23 Xiaobin Rui , Zhixiao Wang , Jiayu Zhao , Lichao Sun , Wei Chen

This study applied Bayesian optimization likelihood-free inference(BOLFI) to virus dynamics experimental data and efficiently inferred the model parameters with uncertainty measure. The computational benefit is remarkable compared to…

Applications · Statistics 2025-09-11 Yingying Xu

The M{\"o}bius transform is a crucial transformation into the Boolean world; it allows to change the Boolean representation between the True Table and Algebraic Normal Form. In this work, we introduce a new algebraic point of view of this…

Data Structures and Algorithms · Computer Science 2020-04-24 Morgan Barbier , Hayat Cheballah , Jean-Marie Le Bars

Given Boolean functions \( f, g : \mathbb{F}_2^n \to \{-1,+1\} \), we say they are {\em linearly isomorphic} if there exists \( A \in \mathrm{GL}_n(\mathbb{F}_2) \) such that \( f(x)=g(Ax) \) for all \( x \). We study this problem in the…

Computational Complexity · Computer Science 2026-01-14 Swarnalipa Datta , Arijit Ghosh , Chandrima Kayal , Manaswi Paraashar , Manmatha Roy

This work highlights a peculiar phenomenon of interval exchange. Considering a real number beta less than -1, the negative beta-shift is coded if and only if its absolute value is greater than the golden ratio. We study an increasing…

Dynamical Systems · Mathematics 2026-05-15 Florent Nguema Ndong , Anne Bertrand-Mathis

We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…

Information Theory · Computer Science 2009-11-18 Hemant Kowshik , P. R. Kumar

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

Probability · Mathematics 2012-06-21 Itai Benjamini , Oded Schramm , David B. Wilson

We show that a suitable ring with a ``nice'' topology, in which convergent limits of units are units, is an \aleph_0-exchange ring. We generalize the argument to show that a semi-regular ring, R, with a ``nice'' topology, is a full exchange…

Rings and Algebras · Mathematics 2007-05-23 Pace P. Nielsen

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 give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

Data Structures and Algorithms · Computer Science 2023-06-22 Nader H. Bshouty

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

Combinatorics · Mathematics 2007-05-23 F. Vaccarino

We study subordination of free convolutions. We prove that for free random variables $X,Y$ and a Borel function $f$ the conditional expectation $E_\varphi\left[ (z-X-f(X)Yf^*(X))^{-1}| X\right]$, is a resolvent again. This result allows…

Operator Algebras · Mathematics 2024-05-31 Franz Lehner , Kamil Szpojankowski