Related papers: A note on APN permutations in even dimension
We study a class of quantum two-dimensional models with complex potentials of specific form. They can be considered as the generalization of a recently studied model with quadratic interaction not amenable to conventional separation of…
We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits.…
For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…
Decision Diagrams(DDs) are one of the most popular representations for boolean functions. They are widely used in the design and verification of circuits. Different types of DDs have been proven to represent important functions in…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
Whereas the design and properties of bent and plateaued functions have been frequently addressed during the past few decades, there are only a few design methods of so-called 5-valued spectra Boolean functions whose Walsh spectra takes the…
A Boolean function is symmetric if it is invariant under all permutations of its arguments; it is quasi-symmetric if it is symmetric with respect to the arguments on which it actually depends. We present a test that accepts every…
The charge functions for n-dimensional partitions are known for n=2,3,4 in the literature. We give the expression for arbitrary odd dimension in a recent work, and now further conjecture a formula for all even dimensional cases. This…
Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…
In this work, we calculate leading-order anomalous dimension matrices for dimension-6 four-quark operators which appear in the operator product expansion of flavour non-diagonal and diagonal vector and axial-vector two-point correlation…
A permutationally invariant n-bit code for quantum error correction can be realized as a subspace stabilized by the non-Abelian group S_n. The code corresponds to bases for the trivial representation, and all other irreducible…
Monotone Boolean functions are a structurally important class of Boolean functions, but their restricted form imposes strong limitations on achievable nonlinearity. In this paper, we investigate whether evolutionary computation can evolve…
A classical result in additive combinatorics, which is a combination of Balog-Szemer\'edi-Gowers theorem and a variant of Freiman's theorem due to Ruzsa, says that if a subset $A$ of $\mathbb{F}_p^n$ contains at least $c |A|^3$ additive…
In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equivalence classes of 4-bit permutations which we use to find…
Vectorial Boolean functions are crucial building-blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria for vectorial Boolean functions, such as differential uniformity and…
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,…
There are two construction methods of designs from $(n,m)$-bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean bent functions, i.e. $(n,1)$-bent functions, and…
Approximate degradability provides a powerful framework for bounding the quantum and private capacities of noisy quantum channels in regimes where exact degradability fails. While generic low-noise channels exhibit a non-degradability…
Cryptanalysis increases the level of confidence in cryptographic algorithms. We analyze the security of a symmetric cryptographic algorithm - quantum permutation pad (QPP) [8]. We found the instances of ciphertext the same as plaintext even…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…