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

DOI10.5802/JTNB.917zbMATH Open1397.11060arXiv1403.0542OpenAlexW2964060136MaRDI QIDQ5963338FDOQ5963338

Alexandre Aksenov

Publication date: 19 February 2016

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

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 $mathcal{N}_{p,i_1,i_2}(Y_0,Y_1,Y_2)!:=!pro{d}_{j=1}^{p-1}left(Y_0+zet{a}_p^{i_{1}j}{Y}_1+zet{a}_p^{i_{2}j}{Y}_{2}ight),$ where $zet{a}_p$ is a primitive $p$-th root of unity, and $i_1,i_{2}in1,2,dots,p-1,$ determine this asymptotic behaviour. It will be shown that a combinatorial method can be applied to $mathcal{N}_{p,i_1,i_2}(Y_0,Y_1,Y_2).$ The method enables deducing functional relations between the coefficients as well as various properties of the coefficients of $mathcal{N}_{p,i_1,i_2}(Y_0,Y_1,Y_2)$, in particular for $i_1=1,i_2=2,3.$ This method provides relations between binomial coefficients. It gives new proofs of the two identities $pro{d}_{j=1}^{p-1}left(1-zet{a}_p^{j}ight)=p$ and $pro{d}_{j=1}^{p-1}left(1+zet{a}_p^j-zet{a}_p^{2j}ight)=L_p$ (the $p$-th Lucas number). The sign and the residue modulo $p$ of the symmetric polynomials of $1+zet{a}_p-zet{a}_p^2$ can also be obtained. An algorithm for computation of coefficients of $mathcal{N}_{p,i_1,i_2}(Y_0,Y_1,Y_2)$ is developed.

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

Recommendations

• scientific article
• DISTRIBUTION OF BINOMIAL COEFFICIENTS AND DIGITAL FUNCTIONS
• On divisibility properties of certain multinomial coefficients
• Publication:3033833
• The fractal structure of rarefied sums of the Thue-Morse sequence

zbMATH Keywords

binomial coefficientsThue-Morse sequenceset partitionscyclotomic extensionsLucas numbersrarefactions\(b\)-multiplicative sequences

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Congruences; primitive roots; residue systems (11A07) Special sequences and polynomials (11B83) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• On the foundations of combinatorial theory I. Theory of M�bius Functions
• The difference between consecutive primes. II
• Title not available (Why is that?)
• The Fibonacci Numbers: Exposed More Discretely
• Sur les nombres qui ont des propriétés additives et multiplicatives données
• Rarified sums of the Thue-Morse sequence
• Title not available (Why is that?)
• The fractal structure of rarefied sums of the Thue-Morse sequence
• Generalized Thue-Morse sequences of squares
• Dirichlet series associated with strongly \(q\)-multiplicative functions
• Completely q-multiplicative functions: the Mellin transform approach
• On an arithmetic function considered by Pillai
• Combinatorics. The Rota way
• Title not available (Why is that?)
• Coquet-type formulas for the rarefied weighted Thue-Morse sequence

Uses Software

• OEIS

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)