Related papers: Describe the Fibonacci map by principal nests
Recently there is huge interest in graph theory and intensive study on computing integer powers of matrices. In this paper, we investigate relationships between one type of graph and well-known Fibonacci sequence. In this content, we…
Graph Neural Networks (GNNs) have achieved great success on a node classification task. Despite the broad interest in developing and evaluating GNNs, they have been assessed with limited benchmark datasets. As a result, the existing…
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
We present the pattern underlying some of the properties of natural numbers, using the framework of complex networks. The network used is a divisibility network in which each node has a fixed identity as one of the natural numbers and the…
We define a broad class of piecewise smooth plane homeomorphisms which have properties similar to the properties of Lozi maps, including the existence of a hyperbolic attractor. We call those maps Lozi-like. For those maps one can apply our…
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the…
In this paper we prove some new fixed point theorems for multivalued mappings on orbitally complete uniform spaces.
We study the homotopy theory of diagrams of chain complexes over a field indexed by a finite poset, and show that it can be completely described in terms of appropriate diagrams of graded vector spaces.
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…
In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…
Geometric properties of the fixed point set $Fix(f)$ of a self-mapping $f$ on a metric or a generalized metric space is an attractive issue. The set $Fix(f)$ can contain a geometric figure (a circle, an ellipse, etc.) or it can be a…
A general framework for the connection between characteristic formulae and behavioral semantics is described in [2]. This approach does not suitably cover semantics defined by nested fixed points, such as the n-nested simulation semantics…
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
We give a characterization of completely regular topological spaces. Applying some recent results for supinf problems in completely regular topological spaces we establish a variational principle for saddle points. Well-posedness of saddle…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We strengthen the standard bifurcation theorems for saddle-node, transcritical, pitchfork, and period-doubling bifurcations of maps. Our new formulation involves adding one or two extra terms to the standard truncated normal forms with…
Density of stable maps is the common thread of this paper. We review Whitney's contribution to singularities of differentiable mappings and Thom-Mather theories on $C^{\infty}$ and $C^{0}$-stability. Infinitesimal and algebraic methods are…
The paper encloses computation of simple centralizer of simple braids and their connection with Fibonacci numbers. Planarity of some commuting graphs is also discussed in the last section.
Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…
We study learning of indexed families from positive data where a learner can freely choose a hypothesis space (with uniformly decidable membership) comprising at least the languages to be learned. This abstracts a very universal learning…