Related papers: Shift-invariant transformations and almost lifting…

We study fine potential theory and in particular partitions of unity in quasiopen sets in the case $p=1$. Using these, we develop an analog of the discrete convolution technique in quasiopen (instead of open) sets. We apply this technique…

The zeta and Moebius transforms over the subset lattice of $n$ elements and the so-called subset convolution are examples of unary and binary operations on set functions. While their direct computation requires $O(3^n)$ arithmetic…

A Boolean function $f({\vec x})$ is sensitive to bit $x_i$ if there is at least one input vector $\vec x$ and one bit $x_i$ in $\vec x$, such that changing $x_i$ changes $f$. A function has sensitivity $s$ if among all input vectors, the…

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…

Bent Boolean functions are important objects in cryptography and coding theory, and there are several general approaches for constructing such functions. Metaheuristics proved to be a strong choice as they can provide many bent functions,…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Boolean functions are mathematical objects used in diverse applications. Different applications also have different requirements, making the research on Boolean functions very active. In the last 30 years, evolutionary algorithms have been…

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

We consider involutory virtual biracks with good involutions, also known as symmetric involutory virtual biracks. Any good involution on an involutory virtual birack defines an enhancement of the counting invariant. We provide examples…

We prove a variant of the Arithmetic Fundamental Lemma conjecture of Wei Zhang for n=2. More precisely, we consider the deformation lengths of certain quasi-homomorphisms of quasi-canonical lifts in the sense of Gross. We prove the…

Let $(M,I)$ be an almost complex 6-manifold. The obstruction to integrability of almost complex structure (so-called Nijenhuis tensor) maps a 3-dimensional bundle to a 3-dimensional one. We say that Nijenhuis tensor is non-degenerate if it…

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

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals $2^{n-1}\pm 2^{\frac{n}{2}-1}$, were introduced by Rothaus in 1976 when he…

We pursue a systematic study of the following problem. Let f:{0,1}^n -> {0,1} be a (usually monotone) Boolean function whose behaviour is well understood when the input bits are identically independently distributed. What can be said about…

We investigate four-dimensional near-conformal dynamics by means of the large-charge limit. We first introduce and justify the formalism in which near-conformal invariance is insured by adding a dilaton and then determine the large-charge…

We introduce two kinds of quasi-inner functions. Since every rationally invariant subspace for a shift operator $S_K$ on a vector-valued Hardy space $H^{2}(\Omega,K)$ is generated by a quasi-inner function, we also provide relationships of…

We study approximation of Boolean functions by low-degree polynomials over the ring $\mathbb{Z}/2^k\mathbb{Z}$. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{0,1\}$, define its $k$-lift to be $F_k:\{0,1\}^n \rightarrow…

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

One of the most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…

In this paper we introduce an equivalence relation on the classes of almost periodic functions of a real or complex variable which is used to refine Bochner's result that characterizes these spaces of functions. In fact, with respect to the…