gh-39049: Fixing typo with $g_i^{-1}$ implementation in Yokonuma-Hecke algebras.
    
<!-- ^ Please provide a concise and informative title. -->
<!-- ^ Don't put issue numbers in the title, do this in the PR
description below. -->
<!-- ^ For example, instead of "Fixes #12345" use "Introduce new method
to calculate 1 + 2". -->
<!-- v Describe your changes below in detail. -->
<!-- v Why is this change required? What problem does it solve? -->
<!-- v If this PR resolves an open issue, please link to it here. For
example, "Fixes #12345". -->

```
sage: Y = algebras.YokonumaHecke(3, 3)
sage: g = prod(Y.g())
sage: ~g * g == Y.one()
False
```
There was a sign error in the implementation (which didn't match the
documentation).

### 📝 Checklist

<!-- Put an `x` in all the boxes that apply. -->

- [x] The title is concise and informative.
- [x] The description explains in detail what this PR is about.
- [x] I have linked a relevant issue or discussion.
- [x] I have created tests covering the changes.
- [x] I have updated the documentation and checked the documentation
preview.

### ⌛ Dependencies

<!-- List all open PRs that this PR logically depends on. For example,
-->
<!-- - #12345: short description why this is a dependency -->
<!-- - #34567: ... -->
    
URL: #39049
Reported by: Travis Scrimshaw
Reviewer(s): Frédéric Chapoton, user202729

Author: Release Manager

src/sage/algebras/yokonuma_hecke_algebra.py

@@ -447,13 +447,17 @@ def inverse_g(self, i):
 
             sage: Y = algebras.YokonumaHecke(2, 4)
             sage: [2*Y.inverse_g(i) for i in range(1, 4)]
-            [(q^-1+q) + 2*g[1] + (q^-1+q)*t1*t2,
-             (q^-1+q) + 2*g[2] + (q^-1+q)*t2*t3,
-             (q^-1+q) + 2*g[3] + (q^-1+q)*t3*t4]
+            [(q^-1-q) + 2*g[1] + (q^-1-q)*t1*t2,
+             (q^-1-q) + 2*g[2] + (q^-1-q)*t2*t3,
+             (q^-1-q) + 2*g[3] + (q^-1-q)*t3*t4]
+            sage: all(Y.inverse_g(i) * Y.g(i) == Y.one() for i in range(1, 4))
+            True
+            sage: all(Y.g(i) * Y.inverse_g(i) == Y.one() for i in range(1, 4))
+            True
         """
         if i < 1 or i >= self._n:
             raise ValueError("invalid index")
-        return self.g(i) + (~self._q + self._q) * self.e(i)
+        return self.g(i) + (~self._q - self._q) * self.e(i)
 
     class Element(CombinatorialFreeModule.Element):
         def __invert__(self):
@@ -468,10 +472,15 @@ def __invert__(self):
                 sage: t.inverse()   # indirect doctest
                 t1^2*t2^2*t3^2
                 sage: [3*~(t*g) for g in Y.g()]
-                [(q^-1+q)*t2*t3^2 + (q^-1+q)*t1*t3^2
-                   + (q^-1+q)*t1^2*t2^2*t3^2 + 3*t1^2*t2^2*t3^2*g[1],
-                 (q^-1+q)*t1^2*t3 + (q^-1+q)*t1^2*t2
-                   + (q^-1+q)*t1^2*t2^2*t3^2 + 3*t1^2*t2^2*t3^2*g[2]]
+                [(q^-1-q)*t2*t3^2 + (q^-1-q)*t1*t3^2
+                   + (q^-1-q)*t1^2*t2^2*t3^2 + 3*t1^2*t2^2*t3^2*g[1],
+                 (q^-1-q)*t1^2*t3 + (q^-1-q)*t1^2*t2
+                   + (q^-1-q)*t1^2*t2^2*t3^2 + 3*t1^2*t2^2*t3^2*g[2]]
+                sage: g = prod(Y.g())
+                sage: ~g * g == Y.one()
+                True
+                sage: g * ~g == Y.one()
+                True
 
             TESTS: