On the l.c.m. of random terms of binary recurrence sequences

DOI10.1016/J.JNT.2019.12.004zbMATH Open1471.11038arXiv1909.04342OpenAlexW2972865391WikidataQ126324863 ScholiaQ126324863MaRDI QIDQ2182158FDOQ2182158

Authors: Carlo Sanna 

Publication date: 21 May 2020

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

Abstract: For every positive integer $n$ and every $deltain[0,1]$, let $B(n,delta)$ denote the probabilistic model in which a random set $Asubseteq1,dots,n$ is constructed by choosing independently every element of $1,dots,n$ with probability $delta$. Moreover, let $(u_k{)}_{kgeq0}$ be an integer sequence satisfying $u_k=a_1{u}_{k-1}+a_2{u}_{k-2}$, for every integer $kgeq2$, where $u_0=0$, $u_{1}eq0$, and $a_1,a_2$ are fixed nonzero integers; and let $alpha$ and $$, with $$, be the two roots of the polynomial $X^2-a_{1}X-a_2$. Also, assume that $$ is not a root of unity. We prove that, as $deltan/logno+infty$, for every $A$ in $B(n,delta)$ we have ${\displaystyle }$log operatorname{lcm} (u_a : a in A) sim frac{deltaoperatorname{Li}_2(1 - delta)}{1 - delta} cdot frac{3log!�ig|alpha / !sqrt{(a_1^2, a_2)}�ig|}{pi^2} cdot n^2 ${\displaystyle }$ with probability $1-o(1)$, where $operatornamelcm$ denotes the lowest common multiple, $operatorname{Li}_2$ is the dilogarithm, and the factor involving $delta$ is meant to be equal to $1$ when $delta=1$. This extends previous results of Akiyama, Tropak, Matiyasevich, Guy, Kiss and M'aty'as, who studied the deterministic case $delta=1$, and is motivated by an asymptotic formula for $operatornamelcm(A)$ due to Cilleruelo, Ru'{e}, v{S}arka, and Zumalac'{a}rregui.

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

Recommendations

• On the least common multiple of binary linear recurrence sequences
• On the least common multiple of random \(q\)-integers
• On the l.c.m. of shifted Lucas numbers
• On the least common multiple of Lucas subsequences
• On the l.c.m. of shifted Fibonacci numbers

zbMATH Keywords

random sequenceLehmer sequencebinary recurrence sequencelowest common multiple

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)
• The Dilogarithm Function
• On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers
• The least common multiple of random sets of positive integers
• An asymptotic formula for \(\pi\)
• A New Formula for &#960
• Title not available (Why is that?)
• Lehmer numbers and an asymptotic formula for \(\pi\)
• Quotient and product sets of thin subsets of the positive integers
• A new type of inclusion exclusion principle for sequences and asymptotic formulas for \(\zeta(k)\)
• Ratio sets of random sets
• Limit theorems for the least common multiple of a random set of integers
• A note on product sets of random sets
• On the least common multiple of Lucas subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Title not available (Why is that?)
• On the least common multiple of shifted powers
• On the l.c.m. of shifted Fibonacci numbers
• Generating Functions Associated with Random Binary Sequences Consisting of Runs of Lengths 1 and 2
• Membership in random ratio sets
• On the l.c.m. of shifted Lucas numbers
• The regularization of variational inequalities and a general approximation scheme for regularized solutions in Banach spaces
• Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
• On the lifetime of a random binary sequence
• On the least common multiple of random \(q\)-integers
• A note on product sets of random sets

This page was built for publication: On the l.c.m. of random terms of binary recurrence sequences

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