The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
For k≥2 and k≥i≥1, let Bk,i(n) denote the number of partitions of n such that part 1 appears at most i−1 times, two consecutive integers l and l+1 appear at most k−1 times, and if l and l+1 appear exactly k−1 times then the sum of the parts l and l+1 is congruent to i−1 modulo 2. Let Ak,i(n) denote the number of partitions with...
In 1961, Gordon found a combinatorial generalization of the Rogers–Ramanujan identities, which has been called the Rogers–Ramanujan–Gordon theorem. In 1974, Andrews derived an identity which can be considered as the generating function counterpart of the Rogers–Ramanujan–Gordon theorem, and it has been called the Andrews–Gordon identity. The Andrews–Gordon identity is an analytic generalization of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.