Related papers: New non-linearity parameters of Boolean functions
Boolean functions with good cryptographic properties like high nonlinearity and algebraic degree play an important in the security of stream and block ciphers. Such functions may be designed, for instance, by algebraic constructions or…
$k$th-order sum-free functions are a natural generalization of APN functions using the concept of (non)vanishing flats. In this paper, we introduce a new combinatorial technique to study the nonvanishing flats of Boolean functions. This…
Nonlinear statistics (i.e. statistics of permanents) on the eigenvalues of invariant random matrix models are considered for the three Dyson's symmetry classes $\beta=1,2,4$. General formulas in terms of hyperdeterminants are found for…
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…
We study nonequilibrium evolution in a self-interacting quantum field theory invariant under space translation only by using a canonical approach based on the recently developed Liouville-von Neumann formalism. The method is first used to…
We consider the problem of linearizing a pseudo-Boolean function $f : \{0,1\}^n \to \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables. This…
Let a Boolean function be available as a black-box (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$-far from having that property. The efficiency of the algorithm is judged by the…
We define new families of noncommutative symmetric functions and quasi-symmetric functions depending on two matrices of parameters, and more generally on parameters associated with paths in a binary tree. Appropriate specializations of both…
Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…
The problem "Given a Boolean function $f$ of $n$ variables by its truth table vector. Find (if exists) a vector $\alpha \in \{0,1\}^n$ of maximal (or minimal) weight, such that $f(\alpha)= 1$." is considered here. It is closely related to…
We study filtering of multiscale dynamical systems with model error arising from unresolved smaller scale processes. The analysis assumes continuous-time noisy observations of all components of the slow variables alone. For a linear model…
In this work, we study the normal approximation and almost sure central limit theorems for some functionals of an independent sequence of Rademacher random variables. In particular, we provide a new chain rule that improves the one derived…
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result with applications across several areas in mathematics and computer science. For a Boolean function $f$ that takes values in {-1,1} let $r(f)$ denote its Fourier rank. For…
Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The classic definition, proposed by Bavelas (1950), Beauchamp…
Linear fractional stable motion, denoted by $\{X_{H,\al}(t)\}_{t\in \R}$, is one of the most classical stable processes; it depends on two parameters $H\in (0,1)$ and $\al\in (0,2)$. The parameter $H$ characterizes the self-similarity…
In maximum-likelihood analyses of the Local Group (LG) acceleration, the object describing nonlinear effects is the coherence function (CF), i.e. the cross-correlation coefficient of the Fourier modes of the velocity and gravity fields. We…
There are two construction methods of designs from $(n,m)$-bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean bent functions, i.e. $(n,1)$-bent functions, and…
We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…
Optical flow is a powerful tool for the study and analysis of motion in a sequence of images. In this article we study a Horn-Schunck type spatio-temporal regularization functional for image sequences that have a non-Euclidean, time varying…
In a previous paper, the second author defined integer-valued functions delta_n on the first cohomology of a 3-manifold, generalizing McMullen's Alexander norm. It was shown that these functions give lower bounds on the Thurston norm. In…