SearcharxivSearch

arXiv subjects

Mokhwetha Mabula

Publications and source records attributed to Mokhwetha Mabula.

3 recordsLinked to original sources

Rough convergence on Riesz spaces

This paper extends the theory of rough convergence from normed linear spaces to the more abstract setting of Riesz spaces. We introduce and systematically develop the concept of rough $\mathbb{c}$-convergence ($rc$-convergence) for nets. A net $(x_\alpha)_{\alpha\in A}$ in a Riesz space $E$ is said to be rough $\mathbb{c}$-convergent to $x\in E$ if there exists a net $(y_\alpha)_{\alpha\in A}$ in $E$ with $y_\alpha \xrightarrow[]{\mathbb{c}} \theta$ for a given background convergence $\mathbb{c}$, such that $|x_\alpha-x| \leq y_\alpha + \mathbb{r}$ holds for all $\alpha\in A$, where $\mathbb{r}$ is a fixed positive vector in $E$ representing the roughness degree. The study first establishes that this new construction satisfies the axioms of a formal convergence structure. Key properties of $\mathbb{rc}$-convergence are then investigated, including its relationship with linearity and the continuity of lattice operations. Since the limit of an $\mathbb{rc}$-convergent net is not necessarily unique, the paper dedicates significant analysis to the set of rough $\mathbb{c}$-limit points. Furthermore, a crucial connection is established between the order boundedness of a net and the non-emptiness of its set of $\mathbb{rc}$-limit points. This work provides a foundational framework for further exploration of convergence in Riesz spaces.

math.FA

Characteristics of Jaco Graphs, $J_\infty(a), a \in \Bbb N$

We introduce the concept of a family of finite directed graphs (order a) which are directed graphs derived from an infinite directed graph (order a), called the a-root digraph. The a-root digraph has four fundamental properties which are; $V(J_\infty(a)) = \{v_i|i \in \Bbb N\}$ and, if $v_j$ is the head of an edge (arc) then the tail is always a vertex $v_i, i n.$ Hence, trivially we have $d(v_i) \leq ai$ for $i \in \Bbb N.$ We present an interesting Lucassian-Zeckendorf result and other general results of interest. It is meant to be an introductory paper to encourage exploratory research.

math.CO

Characteristics of Finite Jaco Graphs, $J_n(1), n \in \Bbb N$

We introduce the concept of a family of finite directed graphs (order 1) which are directed graphs derived from an infinite directed graph (order 1), called the 1-root digraph. The 1-root digraph has four fundamental properties which are; $V(J_\infty(1)) = \{v_i|i \in \Bbb N\}$ and, if $v_j$ is the head of an edge (arc) then the tail is always a vertex $v_i, i n.$ Hence, trivially we have $d(v_i) \leq i$ for $i \in \Bbb N$. We present an interesting Fibonaccian-Zeckendorf result and present the Fisher Algorithm to table particular values of interest. It is meant to be an introductory paper to encourage exploratory research.

math.CO