Related papers: Multiplicative dependence in linear recurrence seq…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

Let T be a bounded linear operator acting on a complex Banach space X and (\lambda_n) a sequence of complex numbers. Our main result is that if |\lambda_n|/|\lambda_{n+1}| \to 1 and the sequence (\lambda_n T^n) is frequently universal then…

In this paper, we first prove that given pairwise distinct algebraic numbers $\alpha_1, \ldots, \alpha_n$, the numbers $\alpha_1+t, \ldots, \alpha_n+t$ are multiplicatively independent for all sufficiently large integers $t$. Then, for a…

Given a sequence of n numbers, the Maximum Consecutive Subsums Problem (MCSP) asks for the maximum consecutive sum of lengths l for each l = 1,...,n. No algorithm is known for this problem which is significantly better than the naive…

Let $C_n=n2^n+1$ denote the $n$th Cullen number. There has been recent interest in finding all Cullen numbers having a given Diophantine property. We prove that, for a fixed integer $k$ and bounded integers $a_1,\ldots,a_k$, the greatest…

Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…

We define the topological multiplicity of an invertible topological system $(X,T)$ as the minimal number $k$ of real continuous functions $f_1,\cdots, f_k$ such that the functions $f_i\circ T^n$, $n\in\mathbb Z$, $1\leq i\leq k,$ span a…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

We explore how the asymptotic structure of a random permutation of $[n]$ with $m$ inversions evolves, as $m$ increases, establishing thresholds for the appearance and disappearance of any classical, consecutive or vincular pattern. The…

Let $(m, n, k)$ be a tuple of integers with the property that if $i \leq k$, then $m + i$ and $n + i$ have the same radical. Using a result on the abc Conjecture, we bound $k$ from above, improving a result of Balasubramanian, Shorey, and…

Let $P,Q\in\Bbb Z$, $U_0=0,\ U_1=1$ and $U_{n+1}=PU_n-QU_{n+1}$. In this paper we obtain a general congruence for $U_{kmn^r}/U_k\pmod {n^{r+1}}$, where $k,m,n,r$ are positive integers. As applications we extend Lucas' law of repetition and…

We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.

We study the model-checking problem for recursion schemes: does the tree generated by a given higher-order recursion scheme satisfy a given logical sentence. The problem is known to be decidable for sentences of the MSO logic. We prove…

Given a set $A=\{(i_1,j_1),\ldots,(i_m,j_m)\}$ we say that $(a_1,\ldots,a_v)$ exhibits pairwise coprimality if $\gcd(a_i,a_j) = 1$ for all $(i,j)\in A$. For a given positive $x$ we give an asymptotic formula for the number of…

Here, we show that if $u_n=n2^n\pm 1$, then the largest prime factor of $u_n\pm m!$ for $n\ge 0,~m\ge 2$ tends to infinity with $\max\{m,n\}$. In particular, the largest $n$ participating in the equation $u_n\pm m!=2^a3^b5^c7^d$ with $n\ge…

For a class of stationary Markov-dependent sequences $(A_n,B_n)\in\mathbb{R}^2,$ we consider the random linear recursion $S_n=A_n+B_nS_{n-1},$ $n\in\mathbb{Z},$ and show that the distribution tail of its stationary solution has a power law…

Pila and Tsimerman proved in 2017 that for every $k$ there exists at most finitely many $k$-tuples $(x_1,\ldots, x_k)$ of distinct non-zero singular moduli with the property "$x_1, \ldots,x_k$ are multiplicatively dependent, but any proper…

Let $U_n$ denote the group of upper $n \times n$ unitriangular matrices over a fixed finite field $\mathbb{F}$ of order $q$. That is, $U_n$ consists of upper triangular $n \times n$ matrices having every diagonal entry equal to $1$. It is…

Much work has been done attempting to understand the dynamic behaviour of the so-called "3x+1" function. It is known that finite sequences of iterations with a given length and a given number of odd terms have some combinatorial properties…