Related papers: Rotation number of primitive vector sequences
A discrete map based on the sum of an integer's distinct primes factors and the sum of its other factors is defined and its iteration is studied.
Despite a general lack of a useful 3 dimensional prime end theory, if h is a homeomorphism of the product of the real line R and the closure of a bounded open contractible planar set U, then h typically admits a notion of rotation number…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
Rotation vectors, as defined for homeomorphisms of the torus that are isotopic to the identity, are generalized to such homeomorphisms of any complete Riemannian manifold with non-positive sectional curvature. These generalized rotation…
The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…
Rota's basis conjecture states that in any square array of vectors whose rows are bases of a fixed vector space the vectors can be rearranged within their rows in such a way that afterwards not only the rows are bases, but also the columns.…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
We define the notion of circular words, then consider on such words a constraint derived from the Fibonacci condition. We give several results on the structure of these circular words, then mention possible applications to various…
We present an elementary proof of the generalization of the $k$-bonacci Binet formula, a closed form calculation of the $k$-bonacci numbers using the roots of the characteristic polynomial of the $k$-bonacci recursion.
We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…
Double Fibonacci sequences are introduced and they are related to operations with Fibonacci modules. Generalizations and examples are also discussed.
This note simplifies the proof of a recent result on the oscillation of the prime product in Martens Theorem, and provides a quantitative expression for the error term. In addition, the corresponding oscillation results for the finite sums…
We compute the number of orbits of pairs in a finitely generated torsion module (more generally, a module of bounded order) over a discrete valuation ring. The answer is found to be a polynomial in the cardinality of the residue field whose…
The notion of axial algebra is closely related to $3$-transposition groups, the Monster group and vertex operator algebras. In this work we continue our previous works and compete the proof that all algebras generated by a set of primitive…
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over $p$-adic numbers gives a recurrence relation computing modular inverse modulo $p^m$, that is logarithmic in $m$. We solve the recurrence to…
In a previous paper a new approach has been introduced for computing, recursively and numerically, one-loop tensor integrals. Here we describe a few modifications of the original method that allow a more efficient numerical implementation…
In this study, we investigate Horadam sequence as generalization of linear recurrence equations of order two. By the aid of this sequence we obtain a new generalization for sequences of dual quaternions and dual octonions. Moreover, we…
We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the…
In this paper, we first give new generalizations for third-order Horadam $\{H_{n}^{(3)}\}_{n\in \mathbb{N}}$ and generalized Tribonacci $\{h_{n}^{(3)}\}_{n\in \mathbb{N}}$ sequences for classic Horadam and generalized Fibonacci numbers.…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…