Related papers: The infinite Fibonacci groups and relative aspheri…

We prove that there exists an integer-valued function f on positive integers such that if a finite group G has at most k real-valued irreducible characters, then |G/Sol(G)| is at most f(k), where Sol(G) denotes the largest solvable normal…

In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Fix $\varepsilon > 0$. We say that a finite group $G$ is $\varepsilon$-quasirandom if every nontrivial irreducible complex representation of $G$ has degree at least $|G|^\varepsilon$. In this paper, we give a structure theorem for large…

We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…

Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…

The list of properties of Fibonacci numbers F(n) (with multifaceted relevance in physics) is complemented by an empirical observation that in combination with the "next" family of the "delayed Fibonacci" numbers G(n) called, for…

Let $f(n,r)$ denote the maximum number of colourings of $A \subseteq \lbrace 1,\ldots,n\rbrace$ with $r$ colours such that each colour class is sum-free. Here, a sum is a subset $\lbrace x,y,z\rbrace$ such that $x+y=z$. We show that $f(n,2)…

A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…

A finite presentation < X | R > of a finite group is called `just finite' if removing any relation from R results in a presentation for an infinite group. It has been an open question (Kourovka Notebook, Problem 21.10) whether every finite…

In 2018, Luca and Patel conjectured that the largest perfect power representable as the sum of two Fibonacci numbers is $3864^2 = F_{36} + F_{12}$. In other words, they conjectured that the equation…

We prove that for every field k and every positive integer n, there exists an absolutely simple n-dimensional abelian variety over k. We also prove an asymptotic result for finite fields: For every finite field k and positive integer n, we…

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

In this paper, we introduce a variation of the factor complexity, called the $N$-factor complexity, which allows us to characterize the complexity of sequences on an infinite alphabet. We evaluate precisely the $N$-factor complexity for the…

Let $o(G)$ be the average order of a finite group $G$. We show that if $o(G)<c$, where $c\in \lbrace \frac{13}{6}, \frac{11}{4}\rbrace$, then $G$ is an elementary abelian 2-group or a solvable group, respectively. Also, we prove that the…

A finite group $G$ is called $k$-factorizable if for every ordered factorization $|G|=a_1\cdots a_k$ into integers each greater than $1$ there exist subsets $A_1,\dots,A_k\subseteq G$ such that $|A_i|=a_i$ for each $i$ and $G=A_1\cdots…

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_0 = 0, F_1 = 1$ and $F_{n+2} = F_{n+1}+F_n$ for $n \geq 0$. In this paper, we solve all powers of two which are sums of four Fibonacci numbers with a few exceptions that we…

We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof…

It is proved that the asymptotic average eccentricity and the asymptotic average degree of Fibonacci cubes and Lucas cubes are $(5+\sqrt 5)/10$ and $(5-\sqrt 5)/5$, respectively. A new labeling of the leaves of Fibonacci trees is introduced…

In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…