A simple combinatorial method for proving Jacobi's identity and its generalizations (Q1083450): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumerative Proof of An Identity of Jacobi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Enumerative Proofs of an Identity of Jacobi / rank
 
Normal rank
Property / cites work
 
Property / cites work: A direct combinatorial proof of the Jacobi identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Proof of the Triple Product Identity / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01077322 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011843775 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:00, 30 July 2024

scientific article
Language Label Description Also known as
English
A simple combinatorial method for proving Jacobi's identity and its generalizations
scientific article

    Statements

    A simple combinatorial method for proving Jacobi's identity and its generalizations (English)
    0 references
    0 references
    1986
    0 references
    In his work on theta functions, Jacobi found the famous triple product identity \[ (*)\quad \prod^{\infty}_{n=1}(1-q^{2n})(1+tq^{2n- 1})(1+t^{-1} q^{2n-1})=\sum^{\infty}_{n=-\infty}t^ n q^{n^ 2}, \] where q and t are complex numbers with \(| q| <1\) and \(t\neq 0\). Several proofs of (*) are known some of which are purely combinatorial, e.g. those by \textit{E. M. Wright} [J. London Math. Soc. 40, 55-57 (1965; Zbl 0125.025)], \textit{C. Sudler} [Proc. Edinb. Math. Soc., II. Ser. 15, 67-71 (1966; Zbl 0143.024)], \textit{J. Zolnowsky} [Discrete Math. 9, 293-298 (1974; Zbl 0292.10014)], and \textit{R. P. Lewis} [Am. Math. Mon. 91, 420-423 (1984; Zbl 0551.05016)]. In this paper another and very short proof of (*) is presented. The key result reads as follows. Let p(N) be the number of partitions of the nonnegative integer N, let \(Q_ r\) denote the set of pairs (\(\alpha\),\(\beta)\) of decreasing sequences \(\alpha =(\alpha_ 1,...,\alpha_ s)\), \(\beta =(\beta_ 1,...,\beta_ t)\) of odd positive integers such that \(s-t=r\), and let q(N,r) be the number of integers k with \(k=2N+r^ 2=\sum \alpha_ i+\sum \beta_ j\) for any arbitrary pair \((\alpha,\beta)\in Q_ r\). Then we have \(p(N)=q(N,r)\) for any N and r. This theorem is proved by means of a parametrization method the explanation of which will be omitted here. Surprisingly, this method enables an immediate generalization of (*) to an identity for formal power series over a noncommutative ring.
    0 references
    Jacobi identity
    0 references
    partitions of integers
    0 references
    parametrizations of couplings
    0 references
    formal power series
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references