In this paper, we generalize Fibonacci quaternion, octonion, sedenion, trigintaduonion, etc. and define Horadam 2^{k}-ions and investigate their properties. Each Horadam (such as Fibonacci, Lucas, Pell) quaternions, octonions and sedenions are Horadam 2^{k}-ions. We also present connection to some earlier works.

The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a \lq magic' state $\left|\psi\right\rangle$ in $d$-dimensional Hilbert space that encodes a minimal informationally complete quantum measurement (or MIC), possibly carrying a finite \lq contextual' geometry. In the present work, we choose $G$ as the fundamental group $\pi_1(V)$ of an exotic $4$-manifold $V$, more precisely a \lq small exotic' (space-time) $R^4$ (that is homeomorphic and isometric, but not diffeomorphic to the Euclidean $\mathbb{R}^4$). Our selected example, due to to S. Akbulut and R.~E. Gompf, has two remarkable properties: (a) it shows the occurence of standard contextual geometries such as the Fano plane (at index $7$), Mermin's pentagram (at index $10$), the two-qubit commutation picture $GQ(2,2)$ (at index $15$) as well as the combinatorial Grassmannian Gr$(2,8)$ (at index $28$) , (b) it allows the interpretation of MICs measurements as arising from such exotic (space-time) $R^4$'s. Our new picture relating a topological quantum computing and exotic space-time is also intended to become an approach of \lq quantum gravity'.

The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focuses on creating and analysing structures. There are numerous studies linking algebraic structures and graphs, which began with the introduction of Cayley graphs of groups. Several algebraic graphs have been defined on rings, which have huge-growing literature. In this article, we systematically review the literature on some variants of Cayley graphs that are defined on rings, to understand the research in this area.

In large-scale parallel computing and communication systems, an interconnect network structure is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. In a graph, the vertices and edges are likely to fail, so we must think about the fault tolerance of a graph. Connectivity is an important parameter in the study of faulty tolerance for a graph. In this paper, we study a special class of connectivity: $m$-component connectivity, this is a natural generalization of the classical connectivity of graphs defined in terms of the minimum vertex-cut. Let $F$ is a vertex set of $G$ $(i.e, F\subseteq V(G))$, if the following conditions are satisfied, we say $F$ is a $m$-component cut: $(1)$ $G-F$ is disconnected; $(2)$ the number of components in $G-F$ is greater than or equal to $m$. In another word, the $m$-component connectivity $c\kappa_{m}(G)$ is defined as $min\{|F|~|~F\subseteq V(G)$ and $F$ is a $m$-component cut$\}$. Determining $m$-component connectivity is still unsolved in most interconnection networks even for small $m'$s. Leaf-sort graph is a special Cayley graph, it has many special properties that are different from other Cayley graphs. So we need to pay attention to some of it's special properties when we study it. In this paper, we can get the values: $c\kappa_{3}(CF_{n})=3n-6$ $(n$ is odd$)$ and $c\kappa_{3}(CF_{n})=3n-7$ $(n$ is even$)$ for $n\geq3$; $c\kappa_{4}(CF_{n})=\frac{9n-21}{2}$ $(n$ is odd$)$ and $c\kappa_{4}(CF_{n})=\frac{9n-24}{2}$ $(n$ is even$)$ for $n\geq4$; $c\kappa_{5}(CF_{n})=6n-16$ $(n$ is odd$)$ and $c\kappa_{5}(CF_{n})=6n-18$ $(n$ is even$)$ for $n\geq5$.

When presenting special relativity, it is customary to single out the so-called paradoxes. One of these paradoxes is the formal occurrence of speeds exceeding the speed of light. An essential part of such paradoxes arises from the incompleteness of the relativistic calculus of velocities. In special relativity, the additive group is used for velocities. However, the use of only group operations imposes artificial restrictions on possible computations. Naive expansion to vector space is usually done by using non-relativistic operations. We propose to consider arithmetic operations in the special theory of relativity in the framework of the Cayley–Klein model for projective spaces. We show that such paradoxes do not arise in the framework of the proposed relativistic extension of algebraic operations.

To follow the growth and development of each tree (N = 1200) Pinus sylvestris L., var. Negorelskaya starting from the seed and continuing at the juvenile (or even generative) stage is the goal of an ambitious project to create a plant passport if possible. Five datasets of replenished empirical (tab-ular and file) and systematic data reflect the early results of a unique ongoing experiment conducted with families moved along a climatic gradient from the collection area (1731 degree days, 722 mm) to the experimental area (2326 degree days; 786 mm). Datasets of morphometric, VIS-spectrometric, and germination seed data, combined with the first results of biometric data (including the Dickson quality index) of seedlings produced from these seeds, will allow scientists in the future to conduct correlation and other statistical analysis, or train a neural network to determine the presence of connections between a seed and a plant. These data contribute to the early non-destructive diag-nosis and grading of seeds according to VIS-spectrometric properties. This dataset structure can complement the FLR-Library. In the future, by tracing seedlings in their early growth (for example, over three growing seasons at the site being restored), it will be possible to determine the degree of intensification of FRM production depending on the initial properties of the seed.