Research Article
Ergodicity of Maps on the Two-Dimensional Torus
George Smart Nduka*
,
Henry Etaroghene Egbogho
Issue:
Volume 10, Issue 1, March 2025
Pages:
1-6
Received:
31 December 2024
Accepted:
21 January 2025
Published:
10 February 2025
Abstract: This paper considers the ergodicity of maps on the two-dimensional torus, focusing on transformations where invariant real-valued functions are constant. The study considers both additive and multiplicative transformations, providing a detailed analysis of the conditions required for a map to be classified as ergodic. The investigation is grounded in the theory of dynamical systems and leverages mathematical tools such as orthonormal double sequences in Hilbert spaces and Fourier series to establish necessary and sufficient conditions for ergodicity. By connecting these conditions to the Lebesgue measure, the research outlines the fundamental properties of ergodic transformations on the torus. A key aspect of this study is its treatment of invariant functions and their role in defining ergodic behavior. Invariant functions, which remain unchanged under the dynamics of a given transformation, are examined in depth to understand how their constancy relates to the overall system. The analysis also highlights the interplay between additive and multiplicative transformations and their impact on the ergodic properties of the system. The results of this work not only provide a robust framework for understanding the dynamics of transformations on the two-dimensional torus but also have implications for higher-dimensional systems. This contribution is particularly relevant for studying complex systems in ergodic theory, where the behavior of transformations under the Lebesgue measure often serves as a foundation for further exploration. By addressing these fundamental aspects, the paper lays the groundwork for extending these concepts to more intricate and multidimensional settings in mathematical and applied research.
Abstract: This paper considers the ergodicity of maps on the two-dimensional torus, focusing on transformations where invariant real-valued functions are constant. The study considers both additive and multiplicative transformations, providing a detailed analysis of the conditions required for a map to be classified as ergodic. The investigation is grounded ...
Show More
Research Article
The L(j, k)-Labeling Number and Circular L(j,k)-Labeling Number of Distance Graph Dn(1,5)
He Shuping,
Wu Qiong*
Issue:
Volume 10, Issue 1, March 2025
Pages:
7-11
Received:
29 December 2024
Accepted:
14 January 2025
Published:
10 February 2025
Abstract: For j ≤ k, the L(j, k)- labeling problem arose form the code assignment problem of the wireless network. That is, let n,j,k be non-negative real numbers with j ≤ k, an n-L(j, k)-labeling of a graph G is mapping f: V(G)→[0, n] such that |f(u)-f(v)| ≥ j if d(u, v)=1, and |f(u)-f(v)|≥k if t d(u, v)=2. The span of f is the difference between the maximum and minimum labeling numbers assigned by f. The L(j, k)-labeling number of graph G, denoted by λ(j,k) (G), is the minimum span of all L(j, k)-labeling of G. The infinite distance graph, denoted by D (d1,d2,…,dk), has the set Z of integers as a vertex set and in which two vertices i,j∈Z are adjacent if and only if |i-j|∈D. The finite distance graph, denoted by Dn (d1,d2,…,dk), is the subgraph of D(d1,d2,…,dk) induced by vertices {0,1,…,n-1}. This paper determines the L(j, k)-labeling number and the circular L(j, k)-labeling number of distance graph Dn (1,5) for 2j ≤ k.
Abstract: For j ≤ k, the L(j, k)- labeling problem arose form the code assignment problem of the wireless network. That is, let n,j,k be non-negative real numbers with j ≤ k, an n-L(j, k)-labeling of a graph G is mapping f: V(G)→[0, n] such that |f(u)-f(v)| ≥ j if d(u, v)=1, and |f(u)-f(v)|≥k if t d(u, v)=2. The span of f is the difference between the maximu...
Show More
