Related papers: On the linear structures of Balanced functions and…
Mutually unbiased bases that can be cyclically generated by a single unitary operator are of special interest, since they can be readily implemented in practice. We show that, for a system of qubits, finding such a generator can be cast as…
We give a brief account of a construction called tokens here, which is significant in algebra, analysis, combinatorics, and physics. Tokens allow to express a semigroup on one set via a semigroup convolution on another set. Therefore tokens…
We study random embeddings produced by untrained neural set functions, and show that they are powerful representations which well capture the input features for downstream tasks such as classification, and are often linearly separable. We…
We establish a set of relations between several quite diverse types of weighted inequalities involving various integral operators and fairly general quasinorm-like functionals which we call sub-monotone. The main result enables one to solve…
ReLU neural networks define piecewise linear functions of their inputs. However, initializing and training a neural network is very different from fitting a linear spline. In this paper, we expand empirically upon previous theoretical work…
We characterise the eigenfunctions of an equilateral triangle billiard in terms of its nodal domains. The number of nodal domains has a quadratic form in terms of the quantum numbers, with a non-trivial number-theoretic factor. The patterns…
It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…
This paper presents the following research findings on Boolean networks (BNs) and their dual subspaces.First, we establish a bijection between the dual subspaces of a BN and the partitions of its state set. Furthermore, we demonstrate that…
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…
A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is $q$-multilinear if for each its output gate $o$ and for each prime implicant $s$ of the…
We investigate how classifiers for Boolean networks (BNs) can be constructed and modified under constraints. A typical constraint is to observe only states in attractors or even more specifically steady states of BNs. Steady states of BNs…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…
We introduce simple group-theoretic techniques for classifying conformally-invariant tensor-structures. With them, we classify tensor structures of general n-point functions of non-conserved operators, and $n\geq 4$-point functions of…
It is well known that there are two regimes in a standard one-dimensional Boolean percolation model: either the entire space is covered a.s., or the covered volume fraction is strictly less than one. The aim of this work is to demonstrate…
In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.
A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the…
We construct harmonic functions in the quarter plane for discrete Laplace operators. In particular, the functions are conditioned to vanish on the boundary and the Laplacians admit coefficients associated with transition probabilities of…
A Lie algebra is said to be quadratic if it admits a symmetric invariant and non-degenerated bilinear form. Semisimple algebras with the Killing form are examples of these algebras, while orthogonal subspaces provide abelian quadatric…
We introduce a method based on Bezout's theorem on intersection points of two projective plane curves, for determining the nonlinearity of some classes of quadratic functions on $\mathbb{F}_{2^{2m}}$. Among those are the functions of…