Related papers: New non-linearity parameters of Boolean functions

It is demonstrated that nonlinear dynamical systems with analytic nonlinearities can be brought down to the abstract Schr\"odinger equation in Hilbert space with boson Hamiltonian. The Fourier coefficients of the expansion of solutions to…

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…

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 a lower bound of $\Omega(n^{1/2 - c})$, for all $c>0$, on the query complexity of (two-sided error) non-adaptive algorithms for testing whether an $n$-variable Boolean function is monotone versus constant-far from monotone. This…

This paper proposes a low order geometrically exact flexible beam formulation based on the utilisation of generic beam shape functions to approximate distributed kinematic properties of the deformed structure. The proposed nonlinear beam…

The modern definition of optical coherence highlights a frequency dependent function based on a matrix of spectra and cross-spectra. Due to general properties of matrices, such a function is invariant in changes of basis. In this article,…

In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function $f$ is…

We consider Berry's random planar wave model (1977), and prove spatial functional limit theorems - in the high-energy limit - for discretized and truncated versions of the random field obtained by restricting its nodal length to rectangular…

The quantum measurement problem as was formulated by von Neumann in 1933 can be solved by going beyond the operational quantum formalism. In our "prequantum model" quantum systems are symbolic representations of classical random fields. The…

Recent findings show that the classical Riemann's non-differentiable function has a physical and geometric nature as the irregular trajectory of a polygonal vortex filament driven by the binormal flow. In this article, we give an upper…

We make a connection between a famous analytical object introduced in the 1860s by Riemann, as well as some variants of it, and a nonlinear geometric PDE, the binormal curvature flow. As a consequence this analytical object has a…

Let $\mathcal{M}$ be a compact $d$-dimensional submanifold of $\mathbb{R}^N$ with reach $\tau$ and volume $V_{\mathcal M}$. Fix $\epsilon \in (0,1)$. In this paper we prove that a nonlinear function $f: \mathbb{R}^N \rightarrow…

One of the major issues of cryptography is the cryptanalysis of cipher algorithms. Cryptanalysis is the study of methods for obtaining the meaning of encrypted information, without access to the secret information that is normally required.…

We present an $\tilde{O}(n^{2/3}/\epsilon^2)$-query algorithm that tests whether an unknown Boolean function $f\colon\{0,1\}^n\rightarrow \{0,1\}$ is unate (i.e., every variable is either non-decreasing or non-increasing) or $\epsilon$-far…

A new concept, called quasi-linear transfer functions (QLTF), which can be used to characterize the output frequency behaviour of nonlinear systems, is introduced based on the well-known Volterra series representation. By using the new…

Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…

The binary Hamming codes with parameters $[2^m-1, 2^m-1-m, 3]$ are perfect. Their extended codes have parameters $[2^m, 2^m-1-m, 4]$ and are distance-optimal. The first objective of this paper is to construct a class of binary linear codes…

Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks as the curse of dimensionality (CoD) cannot be evaded when trying to approximate even a single ReLU neuron…

The goal in function property testing is to determine whether a black-box Boolean function has a certain property or is epsilon-far from having that property. The performance of the algorithm is judged by how many calls need to be made to…

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…