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

Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…

We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…

This is the second part of a work devoted to the study of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence. From the lifting theorem obtained in the first part, we first derive a…

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\{…

Suppose a Boolean function $f$ is symmetric under a group action $G$ acting on the $n$ bits of the input. For which $G$ does this mean $f$ does not have an exponential quantum speedup? Is there a characterization of how rich $G$ must be…

We prove the "Most informative boolean function" conjecture of Courtade and Kumar for high noise $\epsilon \ge 1/2 - \delta$, for some absolute constant $\delta > 0$. Namely, if $X$ is uniformly distributed in $\{0,1\}^n$ and $Y$ is…

Due to the exponential increase of the numerical effort with the number of degrees of freedom, moving basis functions have a long history in quantum dynamics. In addition, spawning of new basis functions is routinely applied. Here we…

We consider the commutativity problem for the Berezin transform on weighted Fock spaces. Given a real number $m>0$, for every $\alpha >0$ we denote by $B_{\alpha}$ the Berezin transform associated to the measure $\mu_{m}^{\alpha}$ with…

Let M and N be two closed (not necessarily orientable) surfaces, and f a continuous map from M to N. By definition, the minimal multiplicity MMR[f] of the map f denotes the minimal integer k having the following property: f can be deformed…

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

This paper proposes a new generalized linear model with the fractional binomial distribution. Zero-inflated Poisson/negative binomial distributions are used for count data with many zeros. To analyze the association of such a count variable…

We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…

This paper analyzes three forms of representation of Boolean functions, such as Classical, Algebraic and Reed-Muller. The concept of intersection and subsets of representation forms have been introduced, moreover suitable criteria for…

We investigate how to model exchangeability with choice functions. Exchangeability is a structural assessment on a sequence of uncertain variables. We show how such assessments are a special indifference assessment, and how that leads to a…

Our recent formulation of the analytic and variational Slater-Roothaan (SR) method, which uses Gaussian basis sets to variationally express the molecular orbitals, electron density and the one body effective potential of density functional…

The minimum number of NOT gates in a Boolean circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that…

We prove that if the system of integer translates of a square integrable function is $\ell^2$-linear independent then its periodization function is strictly positive almost everywhere. Indeed we show that the above inference is true for any…

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…

Let $f(z) = \sum_{k=0}^\infty a_k z^k$ be an analytic function in a disk $D_R$ of radius $R>0$, and assume that $f$ is $p$-valent in $D_R$, i.e. it takes each value $c\in{\mathbb C}$ at most $p$ times in $D_R$. We consider its Borel…