Related papers: On the Fibonacci $(p,r)$-cubes

We identify the finitely many arithmetic lattices $\Gamma$ in the orientation preserving isometry group of hyperbolic $3$-space $\mathbb{H}^3$ generated by an element of order $4$ and and element of order $p\geq 2$. Thus $\Gamma$ has a…

The main objective of this paper is to introduced a new sequence space $l_{p}(\hat{F}(r,s)),$ $ 1\leq p \leq \infty$ by using the band matrix $\hat{F}(r,s).$ We also establish a few inclusion relations concerning this space and determine…

Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the vertex set to those binary strings which do not contain consecutive 1s. This class of graphs has been studied extensively and generalized in many…

An important problem in quaternionic hyperbolic geometry is to classify ordered $m$-tuples of pairwise distinct points in the closure of quaternionic hyperbolic n-space, $\overline{{\bf H}_\bh^n}$, up to congruence in the holomorphic…

Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…

In this paper we study the diameter of Inhomogeneous random graphs $G(n,\kappa,p)$ that are induced by irreducible kernels $\kappa$. The kernels we consider act on separable metric spaces and are almost everywhere continuous. We generalize…

In this article we introduce the notion of cubical $(\omega,p)$-categories, for $p \in \mathbb N \cup \{\omega\}$. We show that the equivalence between globular and groupoid $\omega$-categories proven by Al-Agl, Brown and Steiner induces an…

The $d$-Fibonacci digraphs $F(d,k)$, introduced here, have the number of vertices following generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs. Here we study some of their…

Given R\subset N, an (R,k)$-sphere is a k-regular map on the sphere whose faces have gonalities i\in R. The most interesting/useful are (geometric) fullerenes, i.e., (\{5,6\},3)$-spheres. Call \kappa_i=1 + \frac{i}{k} - \frac{i}{2} the…

The Fibonacci cube $\Gamma_n$ is obtained from the $n$-cube $Q_n$ by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube $\Lambda_n$ is obtained. The…

The paper studies the structure of restricted Leibniz algebras. More specifically speaking, we first give the equivalent definition of restricted Leibniz algebras, which is by far more tractable than that of a restricted Leibniz algebras in…

Let $\Gamma$ denote a distance-regular graph. The maximum size of codewords with minimum distance at least $d$ is denoted by $A(\Gamma,d)$. Let $\square_n$ denote the folded $n$-cube $H(n,2)$. We give an upper bound on $A(\square_n,d)$…

Let $l$ and $p$ be two distinct prime numbers. We study $l$-isogeny graphs of ordinary elliptic curves defined over a finite field of characteristic $p$, together with a level structure. Firstly, we show that as the level varies over all…

We introduce the manifold of {\it restricted} $n\times n$ positive semidefinite matrices of fixed rank $p$, denoted $S(n,p)^{*}$. The manifold itself is an open and dense submanifold of $S(n,p)$, the manifold of $n\times n$ positive…

We study a new class of polyominoes, called $p$-Fibonacci polyominoes, defined using $p$-Fibonacci words. We enumerate these polyominoes by applying generating functions to capture geometric parameters such as area, semi-perimeter, and the…

Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…

The optimal cube factor of a graph, a special kind of component factor, is first introduced. Furthermore, the optimal cube factors of Fibonacci and matchable Lucas cubes are studied; and some results on the Padovan sequence and binomial…

For classes O of structures on finite linear orders (permutations, ordered graphs etc.) endowed with containment order cont (containment of permutations, subgraph relation etc.), we investigate restrictions on the function f(n) counting…

The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $\Gamma(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex…

For Gamma a finite, connected metric graph, we consider the space of configurations of n points in Gamma with a restraint parameter r dictating the minimum distance allowed between each pair of points. These restricted configuration spaces…