Plethystic exponential
In mathematics, the plethystic exponential is a certain operator defined on (formal) power series which, like the usual exponential function, translates addition into multiplication. This exponential operator appears naturally in the theory of symmetric functions, as a concise relation between the generating series for elementary, complete and power sums homogeneous symmetric polynomials in many variables. Its name comes from the operation called plethysm, defined in the context of so-called lambda rings.
In combinatorics, the plethystic exponential is a generating function for many well studied sequences of integers, polynomials or power series, such as the number of integer partitions. It is also an important technique in the enumerative combinatorics of unlabelled graphs, and many other combinatorial objects.[1][2]
In geometry and topology, the plethystic exponential of a certain geometric/topologic invariant of a space, determines the corresponding invariant of its symmetric products.[3]
Definition, main properties and basic examples
Let be a ring of formal power series in the variable , with coefficients in a commutative ring . Denote by
![{\displaystyle R[[x]]}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/5aacb21250f99f332a57763ecb7f92e3637ade19)
![{\displaystyle R^{0}[[x]]\subset R[[x]]}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/6d422050ca0756f711e41d5ff8af2b7635e0a6aa)
be the ideal of power series without constant term. Then, given its plethystic exponential, denoted is given by
![{\displaystyle f(x)\in R^{0}[[x]]}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/12c3bdc8d8c75ad3e7ec8370c8d11d39d430d6da)
![{\displaystyle PE[f]}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/6a511e135362702c9fdf9d9d23ae76154f18a7fc)
=\exp \left(\sum _{k=1}^{\infty }{\frac {f(x^{k})}{k}}\right)}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/d03991b1aacbeba9c1ff57ed1ecb8eeed419752c)
where is the usual exponential function. It is readily verified that (writing simply when the variable is understood):
![{\displaystyle {\begin{aligned}[ll]PE[0]&=1\\PE[f+g]&=PE[f]PE[g]\\PE[-f]&=PE[f]^{-1}\end{aligned}}}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/b40dad0a97b050dc5c511d49e2dde764e5e9c356)
Some basic examples are:
![{\displaystyle {\begin{aligned}[ll]PE[x^{n}]&={\frac {1}{1-x^{n}}},n\in \mathbb {N} \\PE\left[{\frac {x}{1-x}}\right]&=1+\sum _{n\geq 1}p(n)x^{n}\end{aligned}}}](https://wikimedia.org/enwiki/api/rest_v1/media/math/render/svg/987245f6de256fa7295e78a83f62e02aca0952e6)
In this last example, is number of partitions of .
The plethystic programme in Mathematical-Physics
In a series of articles, a group of mathematical physicists, including Bo Feng, Amihay Hanany and Yang-Hui He, proposed a programme for systematically counting single and multi-trace gauge invariant operators of supersymmetric gauge theories.[4] In the case of quiver gauge theories of D-branes probing Calabi-Yau singularities, this count is codified in the plethystic exponential of the Hilbert series of the singularity.
References
- ^ Pólya, G.; Read, R. C. (1987). Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds. New York, NY: Springer New York. doi:10.1007/978-1-4612-4664-0. ISBN 978-1-4612-9105-3.
- ^ Harary, Frank (1955-02-01). "The number of linear, directed, rooted, and connected graphs". Transactions of the American Mathematical Society. 78 (2): 445–445. doi:10.1090/S0002-9947-1955-0068198-2. ISSN 0002-9947.
- ^ Macdonald, I. G. (1962). "The Poincare Polynomial of a Symmetric Product". Mathematical Proceedings of the Cambridge Philosophical Society. 58 (4): 563–568. doi:10.1017/S0305004100040573. ISSN 0305-0041.
- ^ Feng, Bo; Hanany, Amihay; He, Yang-Hui (2007-03-20). "Counting gauge invariants: the plethystic program". Journal of High Energy Physics. 2007 (03): 090–090. doi:10.1088/1126-6708/2007/03/090. ISSN 1029-8479.