Related papers: Shift-invariant transformations and almost lifting…

A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…

For a prime p and base b, the digit function delta(r) = floor(br/p) partitions the residues {1, ..., p-1} into b contiguous bins. The collision count C(g) records how many residues share a bin with their image under multiplication by g. We…

Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…

The minimum number of NOT gates in a logic 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…

An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…

The article is devoted to holomorphic and meromorphic functions of quaternion and octonion variables. New classes of quasi-conformal and quasi-meromorphic mappings are defined and investigated. Properties of such functions such as their…

Boolean functions with good cryptographic criteria when restricted to the set of vectors with constant Hamming weight play an important role in the recent FLIP stream cipher. In this paper, we propose a large class of weightwise perfectly…

We realize the relative discrete series of a weighted $L^2$-space on a bounded symmetric doamin as kernels of invariant Cauchy-Riemann operator, and thus as the spaces of nearly holomorphic functions.

In this survey, we consider Banach spaces of analytic functions in one and several complex variables for which: (i) polynomials are dense, (ii) point-evaluations on the domain are bounded linear functionals, and (iii) the shift operator…

For a closed smooth manifold $M$ admitting a symplectic structure, we define a smooth topological invariant $Z(M)$ using almost-K\"ahler metrics, i.e. Riemannian metrics compatible with symplectic structures. We also introduce $Z(M,…

We study real-valued, continuous and translation invariant valuations defined on the space of quasi-concave functions of N variables. In particular, we prove a homogeneous decomposition theorem of McMullen type, and we find a representation…

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Let $F$ be a vectorial Boolean function from $\mathbb{F}_2^n$ to $\mathbb{F}_2^m$, with $m \geq n$. We define $F$ as an embedding if $F$ is injective. In this paper, we examine the component functions of $F$, focusing on constant and…

An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

We show that, in general, averaging at simple resonances a real--analytic, nearly--integrable Hamiltonian, one obtains a one--dimensional system with a cosine--like potential; ``in general'' means for a generic class of holomorphic…

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Convolution is an integral operation that defines how the shape of one function is modified by another function. This powerful concept forms the basis of hierarchical feature learning in deep neural networks. Although performing convolution…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most…