solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看2907次
Counting compositions over finite abelian groups. (arXiv:1710.06797v1 [math.CO])
来源于:arXiv
We find the number of compositions over finite abelian groups under two types
of restrictions: (i) each part belongs to a given subset and (ii) small runs of
consecutive parts must have given properties. Waring's problem over finite
fields can be converted to type~(i) compositions, whereas Carlitz and locally
Mullen compositions can be formulated as type~(ii) compositions. We use the
multisection formula to translate the problem from integers to group elements,
the transfer matrix method to do exact counting, and finally the
Perron-Frobenius theorem to derive asymptotics. We also exhibit bijections
involving certain restricted classes of compositions. 查看全文>>