Generating Sets for the Kernels of Frobenius Polarization Operators
Abstract
We study generating sets for the kernels of the Frobenius polarization operators associated with elements of finite groups. By applying the discrete Fourier transform on each coset, we describe these kernels in terms of additive semigroups defined by zero-sum relations among roots of unity. We show that the monomials corresponding to the minimal nonzero elements of these semigroups form generating sets of minimum cardinality. We further describe the minimal nonzero elements in the general case in terms of those in the cyclic case and obtain a formula for the minimum number of generators. For the operator associated with a generator of a cyclic group, we also show, as a consequence of known results on integer zero-sum relations and circulant determinant representations, that its kernel and the subalgebra generated by these circulant determinants have the same field of fractions.
Related
- Weak type (1,1) boundedness of noncommutative singular integral operators with rough kernels
- Finite Fields: Root Sets, Frobenius, and Algebraic Structure
- Weak type (1,1) bound criterion for maximal truncated singular integral operators with rough kernels
- Small Kazhdan constants for small generating sets of linear groups
- Kazhdan constants for two-element generating sets of SLn(ℤ)
BibTeX
@misc{yamaguchi2026generating,
title = {{Generating Sets for the Kernels of Frobenius Polarization Operators}},
author = {Naoya Yamaguchi},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.12492},
eprint = {2610.12492},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.12492},
}
RIS
TY - UNPB
TI - Generating Sets for the Kernels of Frobenius Polarization Operators
AU - Naoya Yamaguchi
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.12492
UR - https://arxiv.org/abs/2610.12492
AB - We study generating sets for the kernels of the Frobenius polarization operators associated with elements of finite groups. By applying the discrete Fourier transform on each coset, we describe these kernels in terms of additive semigroups defined by zero-sum relations among roots of unity. We show that the monomials corresponding to the minimal nonzero elements of these semigroups form generating sets of minimum cardinality. We further describe the minimal nonzero elements in the general case in terms of those in the cyclic case and obtain a formula for the minimum number of generators. For the operator associated with a generator of a cyclic group, we also show, as a consequence of known results on integer zero-sum relations and circulant determinant representations, that its kernel and the subalgebra generated by these circulant determinants have the same field of fractions.
ER -