diff --git a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
index 7a73ba7c33e..66f3db12aa1 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
+++ b/Combinatorial_map/doc/Combinatorial_map/Combinatorial_map.txt
@@ -662,7 +662,7 @@ tuple must contain at most d+1 types (one for
each possible cell dimension of the combinatorial map). Each type of
the tuple must be either a model of the `CellAttribute` concept or
`void`. The first type corresponds to 0-attributes, the second to
-1-attributes and so on. If the \f$ i^{\mbox{th}}\f$ type in the tuple
+1-attributes and so on. If the i th type in the tuple
is `void`, (i-1)-attributes are disabled: we say that
(i-1)-attributes are void. Otherwise,
(i-1)-attributes are enabled and have the given type: we say
diff --git a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
index 3052d524120..7cfecf3db98 100644
--- a/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
+++ b/Combinatorial_map/doc/Combinatorial_map/Concepts/CombinatorialMap.h
@@ -77,7 +77,7 @@ It contains at most dimension+1 types
(one for each possible cell of the combinatorial map). Each type of
the tuple must be either a model of the `CellAttribute` concept or
`void`. The first type corresponds to 0-attributes, the second to
-1-attributes and so on. If the \f$ i^{\mbox{th}}\f$ type in the tuple
+1-attributes and so on. If the i th type in the tuple
is `void`, (i-1)-attributes are disabled. Otherwise,
(i-1)-attributes are enabled and have the given type. If the
size of the tuple is k, with k\f$