You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: tutorial-symmetric-functions.rst
+8-8Lines changed: 8 additions & 8 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -63,7 +63,7 @@ Abstract symmetric functions
63
63
----------------------------
64
64
65
65
We first describe how to manipulate "variable free" symmetric functions (with coefficients in the ring of rational coefficient fractions in :math:`q` and :math:`t`).
66
-
Such functions are linear combinations of one of the six classical bases of symmetric functions; all indexed by interger partitions :math:`\mu=\mu_1\mu_2\cdots\mu_k`.
66
+
Such functions are linear combinations of one of the six classical bases of symmetric functions; all indexed by integer partitions :math:`\mu=\mu_1\mu_2\cdots\mu_k`.
67
67
68
68
- The **power sum** symmetric functions :math:`p_\mu=p_{\mu_1}p_{\mu_2}\cdots p_{\mu_2}`
69
69
@@ -109,7 +109,7 @@ The keyword `verbose` allows you to make the injection quiet.
109
109
sage: (q+t)*s[2,1,1]
110
110
(q+t)*s[2, 1, 1]
111
111
112
-
Now that we have acces to all the bases we need, we can start to manipulate them.
112
+
Now that we have access to all the bases we need, we can start to manipulate them.
113
113
Symmetric functions are indexed by partitions :math:`\mu`, with integers considered
114
114
as partitions having size one (don't forget the brackets!)::
115
115
@@ -286,7 +286,7 @@ in the variables, maybe written as a formal symmetric function in any chosen bas
286
286
287
287
The ``pol`` input of the function ``from_polynomial(pol)`` is assumed to
288
288
lie in a polynomial ring over the same base field as that used for the symmetric
289
-
functions, which thus has to be delared beforehand.
289
+
functions, which thus has to be declared beforehand.
290
290
291
291
::
292
292
@@ -307,7 +307,7 @@ Finally, we can declare our polynomial and convert it into a symmetric function
307
307
2*m[1, 1, 1] + m[2, 1]
308
308
309
309
310
-
In the preceeding example, the base ring of polynomials is the same as the base
310
+
In the preceding example, the base ring of polynomials is the same as the base
311
311
ring of symmetric polynomials considered, as checked by the following.
312
312
313
313
::
@@ -385,7 +385,7 @@ For example, here we compute :math:`p_{22}+m_{11}s_{21}` in the elementary basis
385
385
386
386
.. TOPIC:: Exercise
387
387
388
-
It is well konwn that :math:`h_n(X) = \sum\limits_{\mu\vdash n} \dfrac{p_{\mu}(x)}{z_{\mu}}`. Verify this result for :math:`n \in\{1,2,3,4\}`
388
+
It is well known that :math:`h_n(X) = \sum\limits_{\mu\vdash n} \dfrac{p_{\mu}(x)}{z_{\mu}}`. Verify this result for :math:`n \in\{1,2,3,4\}`
389
389
390
390
Note that there exists a function ``zee()`` which takes a partition :math:`\mu` and gives back the value of :math:`z_{\mu}`. To use this function, you should import it from* ``sage.combinat.sf.sfa``.
0 commit comments