Skip to main content
Ira Gessel's user avatar
Ira Gessel's user avatar
Ira Gessel's user avatar
Ira Gessel
  • Member for 14 years, 1 month
  • Last seen this week
  • Brandeis University, Waltham, MA, United States
comment
Alternative definition of the Lagrange Inversion formula
This kind of expansion is called a Lie series. I didn't check the author's derivation, but formulas of this type are well known. Unfortunately I don't know of a really good introductory reference.
revised
Loading…
comment
Asymptotic growth rate of coefficients of generating function
You might also look at F. Harary, R. W. Robinson, and A. J. Schwenk, Twenty-step algorithm for determining the asymptotic number of trees of various species, J. Austral. Math. Soc. 20 (Series A) (1975), 483-503. link
comment
Why does $d^n \exp(-x-x^{-1})/(dx)^n$ only have $n$ positive real zeroes?
Also by Taylor's theorem, the polynomials $\phi_n(y)$ have the generating function $$\sum_{n=0}^\infty \phi_n(y) \frac{z^n}{n!} = \exp\left(-z\left(1-\frac{y^2}{1+yz}\right)\right). $$
comment
what is the link between plethysm in regular representation of the symmetric group and plethysm in Schur functions.
Here is an explanation of $s_2\circ s_2$ in ‘simple terms‘. Here we have permutation representations: $s_2$ is the characteristic of $S_2$ acting on the single set $\{1,2\}$ by permutating 1 and 2. This is the trivial representation, since $S_2$ is acting on a single element. The plethysm $s_2\circ s_2$ is the characteristic of $S_4$ acting on partitions of $\{1,2,3,4\}$ into two blocks of size 2; i.e. acting on the three partitions $\{\{1,2\},\{3,4\}\},$ $\{\{1,3\},\{2,4\}\},$ and $\{\{1,4\},\{2,3\}\},$ by permuting 1, 2, 3, and 4.
comment
Extraction of Coefficients in the Exponential Function of a Series
Note that $g=e^f$ implies $g' = gf'$. This gives a recurrence for the coefficients of $g$ that's easy to use.
comment
A remarkable sum over partitions
Alternatively, equate coefficients of $x^n$ in $$\frac{1}{1-x} = \exp\biggl(\sum_{a=1}^\infty \frac{x^a}{a}\biggr).$$
awarded
Loading…
revised
Loading…
Loading…
awarded
comment
A new generalisation of Fermat's little theorem?
This result has also been attributed to Ramachandra (mathoverflow.net/questions/87048/…).
comment
A new generalisation of Fermat's little theorem?
According to Dickson's History of the Theory of Numbers, Volume 1, p. 84 (archive.org/details/historyoftheoryo01dick) this generalization of Fermat's theorem is due to Gauss, at least when $a$ is a prime. On p. 82 Dickson gives a reference for the general case to Thue in 1910, though it may be older.
comment
Counting distinct undirected, partially labelled graphs
There's a proof of Pólya's theorem by Gian-Carlo Rota and David Smith using Möbius inversion along the lines that gowers suggests, but the usual proof of Burnside's lemma is much easier. See Rota, Gian-Carlo; Smith, David A. Enumeration under group action. Annali della Scuola Normale Superiore di Pisa - Classe di Scienze, Sér. 4, 4 no. 4 (1977), p. 637-646 numdam.org/item?id=ASNSP_1977_4_4_4_637_0
comment
convergence radius of Pochhammer symbol series
This is not a power series, so it doesn't have a radius of convergence.
revised
convergence radius of Pochhammer symbol series
Improved formatting and punctuation.
Loading…
Loading…
comment
A combinatorial identity generalizing identity (3.111) from Gould's book
If we change the upper limit of the sum to $n$ then the sum is the $n$th difference of a polynomial of degree $n-1$ and is therefore 0. The only nonzero term in the extended sum not in the restricted sum is $-1$, corresponding to $m=n$.
comment
Identity for Power Series and Binomial Coefficients
(2) can be derived from (1) by subtracting 1, dividing by $r$ and taking the limit as $r\to 0$.
1
28 29
30
31 32
42