1971
DOI: 10.1215/s0012-7094-71-03842-7
|View full text |Cite
|
Sign up to set email alerts
|

An asymptotic formula in partition theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

1974
1974
1976
1976

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…In 1971, PAssr [2] found an asymptotic formula for log P (~), where P (~) denotes the number of partitions of $ into totally positive summands ~t, ~ in G and ~j modulo G' for some j, j= 1,2,...,l.…”
Section: Ha Passimentioning
confidence: 99%
See 1 more Smart Citation
“…In 1971, PAssr [2] found an asymptotic formula for log P (~), where P (~) denotes the number of partitions of $ into totally positive summands ~t, ~ in G and ~j modulo G' for some j, j= 1,2,...,l.…”
Section: Ha Passimentioning
confidence: 99%
“…The problem can be reduced to the special case where the lattices are integer lattices and where in fact G' is a multiple of the fundamental lattice (see sections 2,3 of [2]). This reduction makes it much easier to apply a Tauberian Theorem proved by MEI-~A~DVS, mentioned in the following section.…”
Section: Ha Passimentioning
confidence: 99%
“…In [13] there is a fairly comprehensive list of papers concerned with the asymptotic evaluation of the number of partitions of multipartites. The only investigation, of which the authors are aware, concerning multipartites subject to congruence conditions is that of Passi [8]. This paper generalizes the partition problem to lattices but obtains an asymptotic evaluation not of the number of partitions but only of its logarithm.…”
mentioning
confidence: 99%