Related papers: Constructing $2m$-variable Boolean functions with …
We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…
The Fueter theorem provides a two step procedure to build an axially monogenic function, i.e. a null-solutions of the Cauchy-Riemann operator in $ \mathbb{R}^4$, denoted by $ \mathcal{D}$. In the first step a holomorphic function is…
Let $E$ be an elliptic curve---defined over a number field $K$---without complex multiplication and with good ordinary reduction at all the primes above a rational prime $p \geq 5$. We construct a pairing on the dual $p^\infty$-Selmer group…
We present an efficient method for calculating strength functions using the finite amplitude method (FAM) for deformed superfluid heavy nuclei within the framework of the nuclear density functional theory. We demonstrate that FAM reproduces…
We investigate a class of algebras on $\mathbb{R}^3$ arising and generalized from the algebraic structure of magnetic gradient fields induced by systems of synchronous magnets with identical dipole moments (i.e.,…
We develop a systematic approach to obtain an effective Lagrangian for 2D non-Abelian topological BF theory. A general expression is presented in a diagrammatic representation containing solely scalar fields. Expressions for the SU(2) and…
Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…
The construction of superintegrable systems based on Lie algebras and their universal enveloping algebras has been widely studied over the past decades. However, most constructions rely on explicit differential operator realisations and…
The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then…
We construct a symmetric invertible binary pairing function $F(m,n)$ on the set of positive integers with a property of $F(m,n)=F(n,m)$. Then we provide a complete proof of its symmetry and bijectivity, from which the construction of…
An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…
The polarization decomposition of arbitrary binary-input memoryless channels (BMCs) is studied in this work. By introducing the polarization factor (PF), defined in terms of the conditional entropy of the channel output under various input…
Within the framework of relative and absolute quantum field theories (QFTs), we present a general formalism for understanding polarizations of the intermediate defect group and constructing non-invertible duality defects in theories in $2k$…
The polar decomposition for a matrix $A$ is $A=UB$, where $B$ is a positive Hermitian matrix and $U$ is unitary (or, if $A$ is not square, an isometry). This paper shows that the ability to apply a Hamiltonian $\pmatrix{ 0 & A^\dagger \cr A…
In this paper, we present new structures and results on the set $\M_\D$ of mean functions on a given symmetric domain $\D$ of $\mathbb{R}^2$. First, we construct on $\M_\D$ a structure of abelian group in which the neutral element is simply…
A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…
The aim of this study is to find the optimum of a linear fractional function over the efficient set of a multi-objective linear fractional integer program without generating all efficient solutions. By its nature, it is a global…
We consider the problem of computing the partition function $\sum_x e^{f(x)}$, where $f: \{-1, 1\}^n \longrightarrow {\Bbb R}$ is a quadratic or cubic polynomial on the Boolean cube $\{-1, 1\}^n$. In the case of a quadratic polynomial $f$,…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Let $1<p\leq \infty$ and let $n\geq 2.$ It was proved independently by C. Calder\'on, R. Coifman and G. Weiss that the dyadic maximal function \begin{equation*}…