Related papers: Some new results about Fibonacci p-cubes
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
We present two complementary proofs that, if the lengths of $n$ sticks are sampled at random, then the probability that no $p+1$ sticks can form a $(p+1)$-sided polygon can be expressed as the product of the reciprocals of a series of terms…
Given that $a,b\in\mathbb N$, $c_0,c_1\in\mathbb Z$, $(c_0,c_1)\neq (0,0)$, and a generalized Fibonacci sequence $(s_n)_{n\geq 0}$ where $s_0 = c_0$, $s_1 = c_1$, and $s_{n+1}=as_{n}+bs_{n-1}$ for all positive integers $n$. In this paper,…
We consider $m$-th order linear recurrences that can be thought of as generalizations of the Lucas sequence. We exploit some interplay with matrices that again can be considered generalizations of the Fibonacci matrix. We introduce the…
Let $\Gamma$ be a quiver on n vertices $v_1, v_2, ..., v_n$ with $g_{ij}$ edges between $v_i$ and $v_j$, and let $\alpha \in \N^n$. Hua gave a formula for $A_{\Gamma}(\alpha, q)$, the number of isomorphism classes of absolutely…
The $n$-cube graph is the graph on the vertex set of $n$-tuples of $0$s and $1$s, with two vertices joined by an edge if and only if the $n$-tuples differ in exactly one component. We compute the Smith group of this graph, or, equivalently,…
This paper introduces a new variant of hypercubes, which we call Z-cubes. The n-dimensional Z-cube $H_n$ is obtained from two copies of the (n-1)-dimensional Z-cube $H_{n-1}$ by adding a special perfect matching between the vertices of…
Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…
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.…
Employing a quadratic transformation formula of Rahman and the method of `creative microscoping' (introduced by the author and Zudilin in 2019), we provide some new $q$-supercongruences for truncated basic hypergeometric series. In…
Placing a set of branes at a Calabi-Yau singularity leads to an N=1 quiver gauge theory. We analyze F-term deformations of such gauge theories. A generic deformation can be obtained by making the Calabi-Yau non-commutative. We discuss…
This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…
In this paper, a new criterion is given to determine the $p-$rationality of some complex cubic number fields in terms of $ p-$divisibility of certain terms of a third-order recurrence sequence, several illustrated examples are…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…
We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…
The purpose of this article is to study determinants of matrices which are known as generalized Pascal triangles (see [1]). We present a factorization by expressing such a matrix as a product of a unipotent lower triangular matrix, a…
We study the generalized random Fibonacci sequences defined by their first nonnegative terms and for $n\ge 1$, $F_{n+2} = \lambda F_{n+1} \pm F_{n}$ (linear case) and $\widetilde F_{n+2} = |\lambda \widetilde F_{n+1} \pm \widetilde F_{n}|$…