Related papers: Shift-invariant transformations and almost lifting…
In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…
(Chern--Simons) vector models exhibit an infinite-dimensional symmetry, the slightly-broken higher-spin symmetry with the unbroken higher-spin symmetry being the first approximation. In this note, we compute the $n$-point correlation…
An infinite family of quasi-maximally superintegrable Hamiltonians with a common set of (2N-3) integrals of the motion is introduced. The integrability properties of all these Hamiltonians are shown to be a consequence of a hidden…
We consider the multiplicative complexity of Boolean functions with multiple bits of output, studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity. For so-called $\Sigma\Pi\Sigma$…
We study a variational problem on a smooth manifold with a decomposition of the tangent bundle into $k>2$ subbundles (distributions), namely, we consider the integrated sum of their mixed scalar curvatures as a functional of adapted…
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in [Knuth] in connection to sorting algorithms. A natural generalization of this set leads us…
Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred…
On 16 March 2005, the Cluster spacecraft crossed a shock almost at the transition between the quasi-perpendicular and quasi-parallel regimes ($\theta_{Bn}=46^{\circ}$) preceded by an upstream low-frequency ($\sim$ 0.02 Hz in the spacecraft…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
We prove that Boolean functions on $S_n$, whose Fourier transform is highly concentrated on irreducible representations indexed by partitions of $n$ whose largest part has size at least $n-t$, are close to being unions of cosets of…
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…
We give and prove an optimal exact quantum query algorithm with complexity $k+1$ for computing the promise problem (i.e., symmetric and partial Boolean function) $DJ_n^k$ defined as: $DJ_n^k(x)=1$ for $|x|=n/2$, $DJ_n^k(x)=0$ for $|x|$ in…
Overlap functions were introduced as class of bivariate aggregation functions on [0, 1] to be applied in image processing. This paper has as main objective to present appropriates definitions of overlap functions considering the scope of…
The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its…
In this paper we construct a cyclically invariant Boolean function whose sensitivity is $\Theta(n^{1/3})$. This result answers two previously published questions. Tur\'an (1984) asked if any Boolean function, invariant under some transitive…
As shown in our paper [JCTA 177 (2021), Paper No. 105305], the chromatic quasi-symmetric function of Shareshian-Wachs can be lifted to ${\bf WQSym}$, the algebra of quasi-symmetric functions in noncommuting variables. We investigate here…
We consider a 3-dimensional Riemannian manifold V with a metric g and an affinor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we…
Topological quantum codes, such as toric and surface codes, are excellent candidates for hardware implementation due to their robustness against errors and their local interactions between qubits. However, decoding these codes efficiently…
The minimum number of NOT gates in a Boolean circuit computing a Boolean function is called the inversion complexity of the function. In 1957, A. A. Markov determined the inversion complexity of every Boolean function and proved that…
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…