Related papers: On the monoid generated by a Lucas sequence
An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…
In this paper, new families of generalized Fibonacci and Lucas numbers are introduced. In addition, we present the recurrence relations and the generating functions of the new families for $k=2$.
We introduce a new four-parameters sequence that simultaneously generalizes some well-known integer sequences, including Fibonacci, Padovan, Jacobsthatl, Pell, and Lucas numbers. Combinatorial interpretations are discussed and many…
We study the monoid generated by n-by-n distance matrices under tropical (or min-plus) multiplication. Using the tropical geometry of the orthogonal group, we prove that this monoid is a finite polyhedral fan of dimension n(n-1)/2, and we…
In this study, we introduce a new classes of quaternion numbers. We show that this new classes quaternion numbers include all of quaternion numbers such as Fibonacci, Lucas, Pell, Jacobsthal, Pell-Lucas, Jacobsthal-Lucas quaternions have…
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.
We provide a characterization of the positive monoids (i.e., additive submonoids of the nonnegative real numbers) that satisfy the finite factorization property. As a result, we establish that positive monoids with well-ordered generating…
We define an extension of parity from the integers to the rational numbers. Three parity classes are found -- even, odd and `none'. Using the 2-adic valuation, we partition the rationals into subgroups with a rich algebraic structure. The…
The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…
The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…
We study the average number of representations of an integer $n$ as $n = \phi(n_{1}) + \dots + \phi(n_{j})$, for polynomials $\phi \in \mathbb{Z}[n]$ with $\partial\phi = k\ge 1$, $\operatorname{lead}(\phi) = 1$, $j \ge k$, where $n_{i}$ is…
A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…
For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…
The set $\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ of all finite subsets of $\mathbb{N}_0$ containing the zero element is a monoid with set addition as operation. If a set $A\in\mathcal{P}_{{\rm fin},0}(\mathbb{N}_0)$ can be written in the…
Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…
Numerical monoids (cofinite, additive submonoids of the non-negative integers) arise frequently in additive combinatorics, and have recently been studied in the context of factorization theory. Arithmetical numerical monoids, which are…
Disproving a conjecture of Bleicher and Erd\H{o}s, we show that there exists a lacunary sequence of positive integers such that finite sums of reciprocals of its terms attain all rational numbers from a non-empty open interval. We also…
Let $F_n$ and $L_n$ be the Fibonacci and Lucas numbers, respectively. Four corresponding zeta functions in $s$ are defined by \[\zeta_F(s) \,:=\, \sum_{n=1}^{\infty} \frac{1}{F_n^s}\,,\quad \zeta_F^*(s) \,:=\,\sum_{n=1}^{\infty}…
A second order polynomial sequence is of Fibonacci-type $\mathcal{F}_{n}$ (Lucas-type $\mathcal{L}_{n}$) if its Binet formula has a structure similar to that for Fibonacci (Lucas) numbers. Under certain conditions these polynomials are…
In this paper we develop a method to transfer density results for primitive automatic sequences to logarithmic-density results for general automatic sequences. As an application we show that the logarithmic densities of any automatic…