相关论文: The Chung-Graham Expansion
We re-prove some results about integers whose Zeckendorf and Chung-Graham representations satisfy certain conditions. We use properties of the shift operator and use the software package {\tt Walnut}.
We extend the well-known Dumont--Thomas numeration systems to $\mathbb{Z}$ using an approach inspired by the two's complement numeration system. Integers in $\mathbb{Z}$ are canonically represented by a finite word (starting with…
Preliminary group classification became prominent as an approach to symmetry analysis of differential equations due to the paper by Ibragimov, Torrisi and Valenti [J. Math. Phys. 32, 2988-2995] in which partial preliminary group…
In \cite{GCF} it is proved that any quadratic irrational number has a representation as a continuous, infinite and periodic fraction. In 1848, Charles Hermite through a letter Jacobi \cite{Per} wondered if this fact could be generalized to…
We carry out the complete group classification of the class of (1+1)-dimensional linear Schr\"odinger equations with complex-valued potentials. After introducing the notion of uniformly semi-normalized classes of differential equations, we…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of…
We present a particularly nice Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc). Furthermore, we show that in fact one needs only take the integer closest to…
Let $F_n(k)$ be the generalized Fibonacci number defined by (with $F_i(k)$ abbreviated to $F_i$): $F_n = F_{n-1} + F_{n-2} + \dots + F_{n-k}$, for $n \geq k$, and the initial values $(F_0,F_1,...,F_{k-1})$. Let $B_n(k,j)$ be $F_n(k)$ with…
We define a general notion of set of indices which, using concepts from pre-ordered sets theory, permits to unify the presentation of several Colombeau-type algebras of nonlinear generalized functions. In every set of indices it is possible…
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
Each of Ramanujan's series for $\frac{1}{\pi}$ is of the form $$ \sum_{n=0}^{\infty} z^n \frac{ (a_{1})_{n} (a_{2})_{n} (a_{3})_{n} }{ (b_{1})_{n} (b_{2})_{n} (b_{3})_{n} } (c_{1} n + c_2) $$ for rational parameters such that the difference…
Baiocchi et al. generalized a few years ago a classical theorem of Ingham and Beurling by means of divided differences. The optimality of their assumption has been proven by the third author of this note. The purpose of this note to extend…
The paper explores combinatorial properties of Fibonacci words and their generalizations within the framework of combinatorics on words. These infinite sequences, measures the diversity of subwords in Fibonacci words, showing non-decreasing…
We study matrix inequalities involving partial traces for positive semidefinite block matrices. First of all, we present a new method to prove a celebrated result of Choi [Linear Algebra Appl. 516 (2017)]. Our method also allows us to prove…
Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…
This paper introduces a binary encoding that supports arbitrarily large, small and precise decimals. It completely preserves information and order. It does not rely on any arbitrary use-case-based choice of calibration and is readily…
It is shown how some of the recent results of de Souza et al. [1] can be generalized to describe Hamiltonians whose eigenvalues are given as k-generalized Fibonacci numbers. Here k is an arbitrary integer and the cases considered by de…
Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…
In this paper, we consider infinite sums derived from the reciprocals of the generalized Fibonacci numbers. We obtain some new and interesting identities for the generalized Fibonacci numbers.