From bfa9738d96aac7e4701964e300d243732ca1aab7 Mon Sep 17 00:00:00 2001
From: Johannes Markert <10619309+jmark@users.noreply.github.com>
Date: Fri, 26 Apr 2024 15:08:01 +0200
Subject: [PATCH] Update paper.md

Co-authored-by: Sandro Elsweijer <49643115+sandro-elsweijer@users.noreply.github.com>
---
 paper.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/paper.md b/paper.md
index 959e0b5..b0afb17 100644
--- a/paper.md
+++ b/paper.md
@@ -126,7 +126,7 @@ By enumerating the children in the refinement pattern we obtain a space-filling
 curve (SFC) logic. Via these SFCs, all elements in a refinement tree are assigned an
 index and are stored in linear order of these indices. Information such as
 coordinates or element neighbors do not need to be stored explicitly but can
-be recovered from the index and the appropriate information of the coarse
+be deducted from the index and the appropriate information of the coarse
 elements. The forest mesh can be distributed, that is, at any time, each
 parallel process only stores a unique portion of the forest mesh, the
 boundaries of which are calculated from the SFC indices; see