English
Related papers

Related papers: Universal Fibonacci sequences and UFS-groupoids

200 papers

The theory of subfactors of groups, together with the associated notions of subindices and index stability for groupsandtheirsubsets, hasrecentlybeenintroducedandsystematicallydeveloped. Theseconceptsexhibitdeepconnections with additive…

Group Theory · Mathematics 2026-04-13 Mohammad Hadi Hooshmand

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Group Theory · Mathematics 2025-10-22 Peter J. Cameron , Hiranya Kishore Dey

We conjecture a Fibonacci-like property on the number of numerical semigroups of a given genus. Moreover we conjecture that the associated quotient sequence approaches the golden ratio. The conjecture is motivated by the results on the…

Number Theory · Mathematics 2017-06-19 Maria Bras-Amorós

Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…

Combinatorics · Mathematics 2015-04-01 Lorenzo Luperi Baglini

Let $FG$ be the group algebra of a finite $2$-group $G$ over a finite field $F$ of characteristic two and $\circledast$ an involution which arises from $G$. The $\circledast$-unitary subgroup of $FG$, denoted by $V_{\circledast}(FG)$, is…

Rings and Algebras · Mathematics 2020-07-21 Zsolt Balogh , Vasyl Laver

The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…

Number Theory · Mathematics 2014-07-31 Soohyun Park

Let (F_n^{(k)})_{n\geq -(k-2)} be the k-generalized Fibonacci sequence, defined as the linear recurrence sequence whose first k terms are \(0, 0, \ldots, 0, 1\), and whose subsequent terms are determined by the sum of the preceding k terms.…

Number Theory · Mathematics 2025-01-08 Roberto Alvarenga , Ana Paula Chaves , Maria Eduarda Ramos , Matheus Silva , Marcos Sosa

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…

Combinatorics · Mathematics 2025-04-10 Jasem Hamoud , Duaa Abdullah

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

Group Theory · Mathematics 2021-03-24 Igor Protasov

Universal Cycles, or U-cycles, as originally defined by de Bruijn, are an efficient method to exhibit a large class of combinatorial objects in a compressed fashion, and with no repeats. de Bruijn's theorem states that U-cycles for $n$…

Combinatorics · Mathematics 2013-03-15 Michelle Champlin , Anant Godbole , Beverly Tomlinson

Let $S_b(n)$ denote the sum of the squares of the digits of the positive integer $n$ in base $b\geq2$. It is well-known that the sequence of iterates of $S_b(n)$ terminates in a fixed point or enters a cycle. Let $N=2n-1$, $n\geq2$. It is…

General Mathematics · Mathematics 2023-10-10 Walter A. Kehowski

Error: Peer-review process exposed an error in Theorem 1 that, unfourtunately, is not repairable. Idempotent semigroups are always finite. See Green and Rees [1952], Siekmann and Szab\'o [1981] for details Anti-unification is a fundamental…

Logic in Computer Science · Computer Science 2025-03-04 David M. Cerna

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…

Number Theory · Mathematics 2021-07-01 Martin Bunder , Joseph Tonien

This paper explores profound generalizations of the Fibonacci sequence, delving into random Fibonacci sequences, $k$-Fibonacci words, and their combinatorial properties. We established that the $n$-th root of the absolute value of terms in…

Combinatorics · Mathematics 2025-04-15 Jasem Hamoud , Duaa Abdullah

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…

Group Theory · Mathematics 2016-06-02 W. A. Bogley , Gerald Williams

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

Logic · Mathematics 2016-09-06 Saharon Shelah , Simon Thomas

Let $F$ be a field with at least three elements and $G$ a locally finite group. This paper aims to show that if either $F$ is algebraically closed or the characteristic of $F$ is positive, then an element in the group algebra $FG$ is a…

Rings and Algebras · Mathematics 2022-11-18 M. H. Bien , P. V. Danchev , M. Ramezan-Nassab , T. N. Son

Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of positive characteristic $p$. Let $\cd$ be an involution of the algebra $FG$ which is a linear extension of an anti-automorphism of the group $G$ to $FG$. If…

Group Theory · Mathematics 2022-06-07 Zsolt Adam Balogh

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

Dynamical Systems · Mathematics 2020-04-13 Vitaly Bergelson , Tomasz Downarowicz , Michał Misiurewicz

A $K$-Fibonacci sequence is a binary recurrence sequence where $F_0=0$, $F_1=1$, and $F_n=K\cdot F_{n-1}+F_{n-2}$. These sequences are known to be periodic modulo every positive integer greater than $1$. If the length of one shortest period…

Number Theory · Mathematics 2024-07-30 Brennan Benfield , Oliver Lippard