Related papers: Linearly Self-Equivalent APN Permutations in Small…
We study criteria for deciding when the normal subgroup generated by a single polynomial automorphism of $\mathbb{A}^n$ is as large as possible, namely equal to the normal closure of the special linear group in the special automorphism…
Whether two distinct APN functions can have a Hamming distance of $1$ remains an open problem. In 2020, L. Budaghyan et al. introduced a new CCZ-invariant $\Pi_F$ which can be used to provide lower bounds on the Hamming distance between a…
Convolutional neural networks lack shift equivariance due to the presence of downsampling layers. In image classification, adaptive polyphase downsampling (APS-D) was recently proposed to make CNNs perfectly shift invariant. However, in…
In this article, we focus on the concept of locally-APN-ness (``APN" is the abbreviation of the well-known notion of Almost Perfect Nonlinear) introduced by Blondeau, Canteaut, and Charpin, which makes the corpus of S-boxes somehow larger…
Almost perfect nonlinear (APN) functions play an important role in the design of block ciphers as they offer the strongest resistance against differential cryptanalysis. Despite more than 25 years of research, only a limited number of APN…
The intersection ${\bf C}\bigcap {\bf C}^{\perp}$ (${\bf C}\bigcap {\bf C}^{\perp_h}$) of a linear code ${\bf C}$ and its Euclidean dual ${\bf C}^{\perp}$ (Hermitian dual ${\bf C}^{\perp_h}$) is called the Euclidean (Hermitian) hull of this…
Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…
It is known that crooked functions can be used to construct many interesting combinatorial objects, and a quadratic function is crooked if and only if it is almost perfect nonlinear (APN). In this paper, we introduce two infinite classes of…
Permutation polynomials over finite fields constitute an active research area and have applications in many areas of science and engineering. In this paper, four classes of monomial complete permutation polynomials and one class of…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
Incorporating permutation equivariance into neural networks has proven to be useful in ensuring that models respect symmetries that exist in data. Symmetric tensors, which naturally appear in statistics, machine learning, and graph theory,…
We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…
Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…
Under mild conditions we show that the affinity dimension of a planar self-affine set is equal to the supremum of the Lyapunov dimensions of self-affine measures supported on self-affine proper subsets of the original set. These self-affine…
We introduce a concept of minimality for Fano polygons. We show that, up to mutation, there are only finitely many Fano polygons with given singularity content, and give an algorithm to determine the mutation-equivalence classes of such…
Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function $f:\mathbb{F}_{2^n}\rightarrow\mathbb{F}_{2^n}$ is…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
By refining Matsumoto's construction of Einstein ACH metrics, we construct a one parameter family of ACH metrics which solve the Einstein equation to infinite order and have a given three dimensional CR structure at infinity. When the…
Budaghyan and Carlet constructed a family of almost perfect nonlinear (APN) hexanomials over a field with r^2 elements, and with terms of degrees r+1, s+1, rs+1, rs+r, rs+s, and r+s, where r = 2^m and s = 2^n with GCD(m,n)=1. The…
Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane…