Cube-complements of generalized Fibonacci cubes

The generalized Fibonacci cube $Q_h\left(f\right)$ is the graph obtained from the $h$-cube $Q_h$ by removing all vertices that contain a given binary string $f$ as a substring. If $G$ is an induced subgraph of $Q_h$, then the cube-complement of $G$ is the graph induced by the vertices of $Q_h$ which are not in $G$. In particular, the cube-complement of a generalized Fibonacci cube $Q_h\left(f\right)$ is the subgraph of $Q_h$ induced by the set of all vertices that contain $f$ as a substring. The questions whether a cube-complement of a generalized Fibonacci cube is (i) connected, (ii) an isometric subgraph of a hypercube or (iii) a median graph are studied. Questions (ii) and (iii) are completely solved, i.e. the sets of binary strings that allow a graph of this class to be an isometric subgraph of a hypercube or a median graph are given. The cube-complement of a daisy cube is also studied.     

广义Fibonacci数的一些恒等式

利用非数学归纳法,以及广义Fibonacci数的性质,得到了广义Fibonacci数的一些求和公式.     

An invariance of geometric mean with respect to generalized quasi-arithmetic means

In this paper, we study the invariance of the geometric mean with respect to some generalized quasi-arithmetic means, namely, we present some results concerning the functional equation

     

The invariance of the arithmetic mean with respect to generalized quasi-arithmetic means

The aim of this paper is to find those pairs of generalized quasi-arithmetic means on an open real interval I for which the arithmetic mean is invariant, i.e., to characterize those continuous strictly monotone functions φ,ψ:I→R and Borel probability measures μ,ν on the interval [0,1] such that

     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Fibonacci数列倒数的无穷和

利用初等方法以及取整函数的性质研究了Fibonacci数列三次倒数的求和问题,获得了该和式倒数取整后的确切值,也就是给出了一个包含Fibonacci数列有趣的恒等式.     

Collective fixed points, generalized games and systems of generalized quasi-variational inclusion problems in topological spaces

In this paper, by using a fixed point theorem for expansive set-valued mappings with noncompact and nonconvex domains and ranges in topological spaces due to the author, we first prove a collective fixed point theorem and an existence theorem of equilibrium points for a generalized game. As applications, some new existence theorems of solutions for systems of generalized quasi-variational inclusion problems are established in noncompact topological spaces. Our results are different from known results in the literature.     

Fibonacci, Van der Corput and Riesz-Nágy

What do the three names in the title have in common? The purpose of this paper is to relate them in a new and, hopefully, interesting way. Starting with the Fibonacci numeration system — also known as Zeckendorff's system — we will pose ourselves the problem of extending it in a natural way to represent all real numbers in (0,1). We will see that this natural extension leads to what is known as the ?-system restricted to the unit interval. The resulting complete system of numeration replicates the uniqueness of the binary system which, in our opinion, is responsible for the possibility of defining the Van der Corput sequence in (0,1), a very special sequence which besides being uniformly distributed has one of the lowest discrepancy, a measure of the goodness of the uniformity.Lastly, combining the Fibonacci system and the binary in a very special way we will obtain a singular function, more specifically, the inverse of one of the family of Riesz-Nágy.     

Recursive fault-tolerance of Fibonacci cube in hypercubes

Fibonacci cube is a subgraph of hypercube induced on vertices without two consecutive 1's. If we remove from Fibonacci cube the vertices with 1 both in the first and the last position, we obtain Lucas cube. We consider the problem of determining the minimum number of vertices in n-dimensional hypercube whose removal leaves no subgraph isomorphic to m-dimensional Fibonacci cube. The exact values for small m are given and several recursive bounds are established using the symmetry property of Lucas cubes and the technique of labeling. The relation to the problem of subcube fault-tolerance in hypercube is also shown.     

正Fibonacci数的标准分解式中因子5的指数

根据Fibonacci数列的定义,利用初等数论的知识和数学归纳法,讨论了正Fibonacci数Fn的标准分解式中因子5的指数与下标n的关系,得到下列结论:正Fibonacci数Fn的标准分解式中因子5的指数,与下标n的标准分解式中因子5的指数一致.     

Maximal element theorems in product FC-spaces and generalized games

Let I be a finite or infinite index set, X be a topological space and (Yi,{φNi})_i∈I be a family of finitely continuous topological spaces (in short, FC-space). For each i∈I, let be a set-valued mapping. Some existence theorems of maximal elements for the family {Ai}_i∈I are established under noncompact setting of FC-spaces. As applications, some equilibrium existence theorems for generalized games with fuzzy constraint correspondences are proved in noncompact FC-spaces. These theorems improve, unify and generalize many important results in recent literature.     

Heisenberg characters, unitriangular groups, and Fibonacci numbers

Let Un(Fq) denote the group of unipotent n×n upper triangular matrices over a finite field with q elements. We show that the Heisenberg characters of Un+1(Fq) are indexed by lattice paths from the origin to the line x+y=n using the steps (1,0), (1,1), (0,1), (0,2), which are labeled in a certain way by nonzero elements of Fq. In particular, we prove for n?1 that the number of Heisenberg characters of Un+1(Fq) is a polynomial in q−1 with nonnegative integer coefficients and degree n, whose leading coefficient is the nth Fibonacci number. Similarly, we find that the number of Heisenberg supercharacters of Un(Fq) is a polynomial in q−1 whose coefficients are Delannoy numbers and whose values give a q-analogue for the Pell numbers. By counting the fixed points of the action of a certain group of linear characters, we prove that the numbers of supercharacters, irreducible supercharacters, Heisenberg supercharacters, and Heisenberg characters of the subgroup of Un(Fq) consisting of matrices whose superdiagonal entries sum to zero are likewise all polynomials in q−1 with nonnegative integer coefficients.     

The bounds of the solutions to generalized modular equations

In this paper the authors study a monotonicity of several functions involving ma(r) and μa(r). By using these results, the authors obtain some new bounds of the solutions of Ramanujan's generalized modular equations.     

Generating functions, Fibonacci numbers and rational knots

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings in terms of their generating functions. We show in particular how Fibonacci numbers occur in the enumeration of fibered achiral and unknotting number one rational knots. Then we show how to enumerate rational knots of given crossing number depending on genus and/or signature. This allows to determine the asymptotical average value of these invariants among rational knots. We give also an application to the enumeration of lens spaces.     

Application of Fibonacci sine and cosine function to a nonlinear differential-difference equation

A new approach is constructed to obtain exact travelling wave solutions for a differential-difference equation by means of the property of the symmetrical Fibonacci sine and cosine function. As its illustration, some explicit and exact travelling wave solutions of Hybrid lattice, discretized mKdV lattice and modified Volterra lattice are obtained by computing the solutions of a lattice introduced by Wadati.     

Extending the generalized tanh method to the generalized Hamiltonian equations: New soliton-like solutions

To certain nonlinear evolution equations, the tanh method has been generalized for constructing not only solitary-wave but also soliton-like solutions. In this paper, no loss of conciseness, we further extend the generalized tanh method with computerized symbolic computation to a pair of generalized Hamiltonian equations. A new family of soliton-like analytical solutions is obtained, of which the solitary waves and previously-claimed soliton-like solutions are shown to be the special cases.