๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Ranks and Cranks of Partitions Moduli 2, 3, and 4

โœ Scribed by George A Andrews; Richard Lewis

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
124 KB
Volume
85
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We discuss inequalities between the rank counts N(r, m, n) and between the crank counts M(r, m, n), for m=2, 3, and 4, and state three conjectures. 2000 Academic Press N(m, n)=N(&m, n) and N(r, m, n)=N(&r, m, n).

๐Ÿ“œ SIMILAR VOLUMES

Rank and biclique partitions of the comp
Rank and biclique partitions of the complement of paths
โœ Boyer, Elizabeth D. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 230 KB ๐Ÿ‘ 1 views

The problem was posed of determining the biclique partition number of the complement of a Hamiltonian path (Monson, Rees, and Pullman, Bull. Inst. Combinatorics and Appl. 14 (1995), 17-86). We define the complement of a path P , denoted P , as the complement of P in K m,n where P is a subgraph of K

The Rank and Minimal Border Strip Decomp
The Rank and Minimal Border Strip Decompositions of a Skew Partition
โœ Richard P. Stanley ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 257 KB

The rank of an ordinary partition of a nonnegative integer n is the length of the main diagonal of its Ferrers or Young diagram. Nazarov and Tarasov gave a generalization of this definition for skew partitions and proved some basic properties. We show the close connection between the rank of a skew

Bessel Systems for Jordan Algebras of Ra
Bessel Systems for Jordan Algebras of Rank 2 and 3
โœ N.H. Mahmoud ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 KB

Special functions of matrix argument arise in a diverse range of applications in harmonic analysis, number theory, multivariate statistics, quantum physics, and molecular chemistry. This paper presents series expansions for the Bessel functions associated with Jordan algebras of rank 2 or 3. Detaile

Chromatic Number and the 2-Rank of a Gra
Chromatic Number and the 2-Rank of a Graph
โœ C.D. Godsil; Gordon F. Royle ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001