Related papers: On $q$-nearly bent Boolean functions
We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost…
Given the growing quantity of proposals and works of basic hypergeometric functions in the scope of $q$-calculus, it is important to introduce a systematic classification of $q$-calculus. Our aim in this article is to investigate certain…
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…
In this note we revisit Almgren's theory of Q-valued functions, that are functions taking values in the space of unordered Q-tuples of points in R^n. In particular: 1) we give shorter versions of Almgren's proofs of the existence of…
The standard model of Boolean function property testing is not well suited for testing $\textit{sparse}$ functions which have few satisfying assignments, since every such function is close (in the usual Hamming distance metric) to the…
We present necessary and sufficient conditions for a Boolean function to be a negabent function for both even and odd number of variables, which demonstrate the relationship between negabent functions and bent functions. By using these…
The existence of a smooth, nonnegative, compactly supported function with monotone (on the half-line) Fourier transform satisfying two-sided decay bounds is demonstrated.
The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound
The popular BFGS quasi-Newton minimization algorithm under reasonable conditions converges globally on smooth convex functions. This result was proved by Powell in 1976: we consider its implications for functions that are not smooth. In…
We show that on every product probability space, Boolean functions with small total influences are essentially the ones that are almost measurable with respect to certain natural sub-sigma algebras. This theorem in particular describes the…
We investigate some connectedness properties of the set of points K(f) where the iterates of an entire function f are bounded. In particular, we describe a class of transcendental entire functions for which an analogue of the…
We present an example of smooth quasi-convex functions in the positive octant of $\mathbb{R}^{3}$ which cannot be obtained as the images of convex smooth functions under a monotone smooth mappings of $\mathbb{R}$.
In the BFA 2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of…
The influence of the $k$'th coordinate on a Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$ is the probability that flipping $x_k$ changes the value $f(x)$. The total influence $I(f)$ is the sum of influences of the coordinates. The…
We introduce and study two new relations between function spaces over measure spaces of infinite measure, motivated by the question of establishing compactness. The first relation captures the uniform decay of function (quasi-)norms ``at…
It $d-$pends. Wigner's symmetry theorem implies that transformations that preserve transition probabilities of pure quantum states are linear maps on the level of density operators. We investigate the stability of this implication. On the…
We have studied the kinetics of $q$-deformed bosons and fermions, within a semiclassical approach. This investigation is realized by introducing a generalized exclusion-inclusion principle, intrinsically connected with the quantum…
We characterize the symmetric distributions that can be (approximately) generated by shallow Boolean circuits. More precisely, let $f\colon \{0,1\}^m \to \{0,1\}^n$ be a Boolean function where each output bit depends on at most $d$ input…
We study the Fourier transform of polynomials in an orthogonal family, taken with respect to the orthogonality measure. Mastering the asymptotic properties of these transforms, that we call Fourier--Bessel functions, in the argument, the…
We prove an invariance principle for functions on a slice of the Boolean cube, which is the set of all vectors {0,1}^n with Hamming weight k. Our invariance principle shows that a low-degree, low-influence function has similar distributions…