From 6e9c1b0a22064d52231e65064d91d748a025e4d5 Mon Sep 17 00:00:00 2001
From: Ariel <otilibil@eurecom.fr>
Date: Mon, 18 Dec 2023 21:26:06 +0100
Subject: [PATCH] Another typo in math mode

---
 doc/signatures.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/signatures.md b/doc/signatures.md
index 4ad716f..cc5fd32 100644
--- a/doc/signatures.md
+++ b/doc/signatures.md
@@ -23,7 +23,7 @@ comparison for successful lookup, and a table of size $n$ with chaining
 and $k$ keys has the minimum $\max(0, k-n)$ collisions and $\mathcal{O}(1 + k/n)$
 comparisons for lookup. While for skip lists the performance
 characteristics are about as good as that of randomly-built binary
-search trees - namely ($\mathcal{O}(\log n)$). So the choice of which to select
+search trees - namely $\mathcal{O}(\log n)$. So the choice of which to select
 depends very much on memory available, insert/read characteristics,
 etc. So delegating the choice to a single point in your code is a very
 good idea. Unfortunately, in Erlang that's so easy to do at the moment.