|
Discrete Functions
On the number of functions that break subspaces of dimension 3 and higher
N. A. Kolomeets Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Abstract:
We consider the sets Pkn consisting of invertible functions F:Fn2→Fn2 such that any U⊆Fn2 and its image F(U) are not simultaneously k-dimensional affine subspaces of Fn2, where 3≤k≤n−1. We present lower bounds for the cardinalities of all such Pkn and Pkn∩…∩Pn−1n that improve the result of W. E. Clark et al., 2007 providing that these sets are not empty. We prove that almost all permutations of Fn2 belong to P4n∩…∩Pn−1n. Asymptotic lower and upper bounds of |P3n| and |P3n∩…∩Pn−1n| up to o(2n!) are obtained as well. The number of functions from P4n∩…∩Pn−1n that map exactly one 3-dimensional affine subspace of Fn2 to an affine subspace is estimated.
Keywords:
affine subspaces, invariant subspaces, permutations, asymptotic bounds.
Citation:
N. A. Kolomeets, “On the number of functions that break subspaces of dimension 3 and higher”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 34–37
Linking options:
https://www.mathnet.ru/eng/pdma638 https://www.mathnet.ru/eng/pdma/y2024/i17/p34
|
Statistics & downloads: |
Abstract page: | 64 | Full-text PDF : | 21 | References: | 20 |
|