Permutations of zero-sumsets in a finite vector space
From MaRDI portal
Publication:2126285
Recommendations
- Subset sums and block designs in a finite vector space
- The affinity of a permutation of a finite vector space
- Permutations over cyclic groups
- Permutations, hyperplanes and polynomials over finite fields
- On the possibility of group-theoretic description of an equivalence relation connected to the problem of covering subsets in finite fields with cosets of linear subspaces
Cites work
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- Additive combinatorics
- Additivity of affine designs
- On the additivity of block designs
- On the subset sum problem over finite fields
- Subset sums and block designs in a finite vector space
- The CRC handbook of combinatorial designs
- The subset sum problem for finite abelian groups
Cited in
(8)- On the possibility of group-theoretic description of an equivalence relation connected to the problem of covering subsets in finite fields with cosets of linear subspaces
- Subset sums and block designs in a finite vector space
- A new family of additive designs
- A quasidouble of the affine plane of order 4 and the solution of a problem on additive designs
- Finite direct sums controlled by finitely many permutations.
- The affinity of a permutation of a finite vector space
- Binary Hamming codes and Boolean designs
- On the subset sum problem for finite fields
This page was built for publication: Permutations of zero-sumsets in a finite vector space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2126285)