Counting solutions without zeros or repetitions of a linear congruence and rarefaction in b-multiplicative sequences

From MaRDI portal
Publication:5963338




Abstract: Consider a strongly b-multiplicative sequence and a prime p. Studying its p-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of p. The integer values of the "norm" 3-variate polynomial mathcalNp,i1,i2(Y0,Y1,Y2)!:=!prodj=1p1left(Y0+zetapi1jY1+zetapi2jY2ight), where zetap is a primitive p-th root of unity, and i1,i2in1,2,dots,p1, determine this asymptotic behaviour. It will be shown that a combinatorial method can be applied to mathcalNp,i1,i2(Y0,Y1,Y2). The method enables deducing functional relations between the coefficients as well as various properties of the coefficients of mathcalNp,i1,i2(Y0,Y1,Y2), in particular for i1=1,i2=2,3. This method provides relations between binomial coefficients. It gives new proofs of the two identities prodj=1p1left(1zetapjight)=p and prodj=1p1left(1+zetapjzetap2jight)=Lp (the p-th Lucas number). The sign and the residue modulo p of the symmetric polynomials of 1+zetapzetap2 can also be obtained. An algorithm for computation of coefficients of mathcalNp,i1,i2(Y0,Y1,Y2) is developed.





Describes a project that uses

Uses Software





This page was built for publication: Counting solutions without zeros or repetitions of a linear congruence and rarefaction in \(b\)-multiplicative sequences

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