Related papers: Constructing $2m$-variable Boolean functions with …
Let M be a compact Riemannian manifold and let $\mu$,d be the associated measure and distance on M. Robert McCann obtained, generalizing results for the Euclidean case by Yann Brenier, the polar factorization of Borel maps S : M -> M…
We construct a complex entire function with arbitrary number of variables which has the following property: The infinite set consisting of all the values of all its partial derivatives of any orders at all algebraic points, including zero…
Layers of two-dimensional materials arranged at a twist angle with respect to each other lead to enlarged unit cells with potentially strongly altered band structures, offering a new arena for novel and engineered many-body ground states.…
We study the behaviour of the algebraic degree of vectorial Boolean functions when their inputs are restricted to an affine subspace of their domain. Functions which maintain their degree on all subspaces of as high a codimension as…
The purpose of this paper is to present the extended definitions and characterizations of the classical notions of APN and maximum nonlinear Boolean functions to deal with the case of mappings from a finite group K to another one N with the…
This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…
We present a construction of cellular BF theory (in both abelian and non-abelian variants) on cobordisms equipped with cellular decompositions. Partition functions of this theory are invariant under subdivisions, satisfy a version of the…
In this technical report, certain interesting classification of arithmetical functions is proposed. The notion of additively decomposable and multiplicatively decomposable arithmetical functions is proposed. The concepts of arithmetical…
The problem of distributed function computation is studied, where functions to be computed is not necessarily symbol-wise. A new method to derive a converse bound for distributed computing is proposed; from the structure of functions to be…
Using computations in the bidual of $\mathbb{B}(L^2M)$ we develop a new technique at the von Neumann algebra level to upgrade relative proper proximality to full proper proximality. This is used to structurally classify subalgebras of…
An open problem in polarization theory is to determine the binary operations that always lead to polarization (in the general multilevel sense) when they are used in Ar{\i}kan style constructions. This paper, which is presented in two…
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
In the paper "Bellman function for extremal problems in $\mathrm{BMO}$", the authors built the Bellman function for integral functionals on the $\mathrm{BMO}$ space. The present paper provides a development of the subject. We abandon the…
Poisson superpair is a pair of Poisson superalgebra structures on a super commutative associative algebra, whose any linear combination is also a Poisson superalgebra structure. In this paper, we first construct certain linear and quadratic…
In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…
This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…
Boolean functions with strong cryptographic properties, such as high nonlinearity and algebraic degree, are important for the security of stream and block ciphers. These functions can be designed using algebraic constructions or…
Suppose $X$ is a uniformly distributed $n$-dimensional binary vector and $Y$ is obtained by passing $X$ through a binary symmetric channel with crossover probability $\alpha$. A recent conjecture by Courtade and Kumar postulates that…
We propose an approach for decomposing Boolean satisfiability problems while extending recent results of \cite{sul2} on solving Boolean systems of equations. Developments in \cite{sul2} were aimed at the expansion of functions $f$ in…
Value function decomposition methods for cooperative multi-agent reinforcement learning compose joint values from individual per-agent utilities, and train them using a joint objective. To ensure that the action selection process between…