A combinatorial identity for the p-binomial coefficient based on abelian groups

From MaRDI portal
Publication:2229334

DOI10.2140/MOSCOW.2021.10.13zbMATH Open1459.05008arXiv1912.10725OpenAlexW2995244687MaRDI QIDQ2229334FDOQ2229334


Authors: C. P. Anil Kumar Edit this on Wikidata


Publication date: 23 February 2021

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: For non-negative integers kleqn, we prove a combinatorial identity for the p-binomial coefficient based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for rinmathbbNcup0,sinmathbbN and p a prime, we present a purely combinatorial formula for the number of subgroups of mathbbZs of finite index pr with quotient isomorphic to the finite abelian p-group of type underlinelambda, which is a partition of r into at most s parts. This purely combinatorial formula is similar to that for the enumeration of subgroups of a certain type in a finite abelian p-group obtained by Lynne Marie Butler. As consequences, this combinatorial formula gives rise to many enumeration formulae that involve polynomials in p with non-negative integer coefficients.


Full work available at URL: https://arxiv.org/abs/1912.10725




Recommendations




Cites Work


Cited In (1)





This page was built for publication: A combinatorial identity for the \(p\)-binomial coefficient based on abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229334)