Related papers: On the linear structures of Balanced functions and…
A new almost perfect nonlinear function (APN) on the finite field GF(2^10) which is not equivalent to any of the previously known APN mappings is constructed. This is the first example of an APN mapping which is not equivalent to a power…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
Boolean functions can be represented in many ways including logical forms, truth tables, and polynomials. Additionally, Boolean functions have different canonical representations such as minimal disjunctive normal forms. Other canonical…
We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel,…
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…
The necessary and sufficient conditions for a class of functions $f:\mathbb{Z}_2^n \rightarrow \mathbb{Z}_q$, where $q \geq 2$ is an even positive integer, have been recently identified for $q=4$ and $q=8$. In this article we give an…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
The almost periodic functions form a natural example of a non-separable normed space. As such, it has been a challenge for constructive mathematicians to find a natural treatment of them. Here we present a simple proof of Bohr's fundamental…
We deal with linear programming problems involving absolute values in their formulations, so that they are no more expressible as standard linear programs. The presence of absolute values causes the problems to be nonconvex and nonsmooth,…
We present calculations of structure functions using a renormalization scheme consistent expansion which is leading order in both ln(1/x) and \alpha_s(Q^2). There is no factorization scheme dependence, and the ``physical anomalous…
We study the superselection sectors of two quantum lattice systems stacked onto each other in the operator algebraic framework. We show in particular that all irreducible sectors of a stacked system are unitarily equivalent to a product of…
We initiate the study of four-point functions of large BPS operators at any value of the coupling. We do it by casting it as a sum over exchange of superconformal primaries and computing the structure constants using integrability. Along…
Based on Bona's condition for the balanced property of the number of cycles of permutations, we give a general criterion for the balanced property in terms of the generating function of a statistic. We show that the q-derangement numbers…
It is shown that harmonic functions from a simply connected domain in R^3 to R^3 cannot always be expressed as a sum of a monogenic (hyperholomorphic) function and an antimonogenic function, in contrast to the situation for complex numbers…
Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(\gf(2^{2m}), +)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective…
Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…
We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…
Polymorphic circuits are a special kind of circuits which possess multiple build-in functions, and these functions are activated by environment parameters, like temperature, light and VDD. The behavior of a polymorphic circuit can be…
Each simplicial complex and integer vector yields a vector configuration whose combinatorial properties are important for the analysis of contingency tables. We study the normality of these vector configurations including a description of…
Compositional generalization, the ability to recognize familiar parts in novel contexts, is a defining property of intelligent systems. Although modern models are trained on massive datasets, they still cover only a tiny fraction of the…