Related papers: Linear codes and incidence structures of bent func…
In this work, we study functions that can be obtained by restricting a vectorial Boolean function $F \colon \mathbb{F}_2^n \rightarrow \mathbb{F}_2^n$ to an affine hyperplane of dimension $n-1$ and then projecting the output to an…
We extend the hyperplane arrangement framework for neural network expressivity from the braid to discriminantal arrangements. Compatible piecewise linear functions are characterized by circuit relations and admit a matroidal description via…
We continue our study of matrix models of dually weighted graphs. Among the attractive features of these models is the possibility to interpolate between ensembles of regular and random two-dimensional lattices, relevant for the study of…
The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…
A $q$-ary $t$-$(n,w,\lambda)$ design is a collection $\mathcal{A}$ of vectors of weight $w$ in $\mathbb{F}_{q}^{n}$ with the property that every vector of weight $t$ in $\mathbb{F}_{q}^{n}$ is contained in exactly $\lambda$ members of…
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…
We introduce the notion of a two-scale branching function associated with an arbitrary metric space, which encodes the lower and upper box dimensions as well as the Assouad spectrum. If the metric space is quasi-doubling, this function is…
Bent functions can be classified into regular bent functions, weakly regular but not regular bent functions, and non-weakly regular bent functions. Regular and weakly regular bent functions always appear in pairs since their duals are also…
We introduce a novel architecture and computational framework for formal, automated analysis of systems with a broad set of nonlinearities in the feedback loop, such as neural networks, vision controllers, switched systems, and even simple…
Bent functions are Boolean functions in an even number of variables that are indicators of Hadamard difference sets in elementary abelian 2-groups. A bent function in m variables is said to be normal if it is constant on an affine space of…
We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can…
In this work, we employ the concept of {\em composite representation} of Boolean functions, which represents an arbitrary Boolean function as a composition of one Boolean function and one vectorial function, for the purpose of specifying…
We introduce two convergent series expansions (direct and recursive) in terms of Bessel functions and representations of sums $r_N(m)$ of squares for $N$-dimensional Madelung constants, $M_N(s)$, where $s$ is the exponent of the Madelung…
Let $m$ be an even positive integer. A Boolean bent function $f$ on $\GF{m-1} \times \GF {}$ is called a \emph{cyclic bent function} if for any $a\neq b\in \GF {m-1}$ and $\epsilon \in \GF{}$, $f(ax_1,x_2)+f(bx_1,x_2+\epsilon)$ is always…
Generalized bent (gbent) functions from an $n$-variable Boolean space to $\mathbb{Z}_{2^k}$ are central in cryptography and sequence design. Instead of the usual binary decomposition, we introduce a $2^\ell$-adic representation, for $k=\ell…
We continue our study of symmetries of a class of little string theories of A-type, which are engineered by $N$ parallel M5-branes probing a flat transverse space. Extending the analysis of the companion paper, we discuss the part of the…
This paper introduces a new class of efficient inter connection networks called as M-graphs for large multi-processor systems.The concept of M-matrix and M-graph is an extension of Mn-matrices and Mn-graphs.We analyze these M-graphs…
We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if…