O. Ramare. On Snirel'man's constant. Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV, 22(4):645-706, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Generating Functions for Generating Trees - Banderier.. (1999) (11 citations) (Correct)
....1 Consequently, the number of nodes at level n is simply f n = 1 3 ) 2. This can be checked on the rst few levels of the tree drawn in Figure 2. Now, one can object that the Goldbach conjecture is not proved; however, it is known that every even number is the sum of at most six primes [22], and a similar example can be constructed using this result. 2 2 3 3 7 2 3 2 2 5 2 3 2 3 2 2 3 2 2 3 2 5 Figure 2: A generating tree with prime labels and rational generating function. Proposition 2 can be adapted to apply to systems that almost satisfy the criterion of Proposition 2, ....
O. Ramare. On Snirel'man's constant. Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV, 22(4):645-706, 1995.
Generating Functions for Generating Trees - Banderier.. (1999) (11 citations) (Correct)
....: Consequently, the number of nodes at level n is simply f n = 1 3 n ) 2. This can be checked on the first few levels of the tree drawn in Figure 2. Now, one can object that the Goldbach conjecture is not proved; however, it is known that every even number is the sum of at most six primes [22], and a similar example can be constructed using this result. 2 6 2 2 3 3 7 2 3 2 2 5 2 3 2 3 2 2 3 2 2 3 2 5 Figure 2: A generating tree with prime labels and rational generating function. Proposition 2 can be adapted to apply to systems that almost satisfy the criterion of Proposition 2, ....
O. Ramar'e. On Snirel'man's constant. Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV, 22(4):645--706, 1995.
Generating Functions for Generating Trees - Banderier.. (1999) (11 citations) (Correct)
....1 1 3z : Consequently, the number of nodes at level n is simply (1 3 n ) 2. This can be checked on the rst few levels of the tree drawn in Figure 2. Now, one can object that the Goldbach conjecture is not proved; however, it is known that every even number is the sum of at most six primes [19], and a similar example can be constructed using this result. 2 6 2 2 3 3 7 2 3 2 2 5 2 3 2 3 2 2 3 2 2 3 2 5 Figure 2: A generating tree with prime labels and rational generating function. Proposition 2 can be adapted to apply to systems that almost satisfy the criterion of Proposition 2, ....
O. Ramare. On Snirel'man's constant. Annali della Scuola Normale Superiore di Pisa. Classe di Scienze. Serie IV, 22(4):645-706, 1995.
Pattern Formation in a Simple Chemical System With general.. - Leach, Wei Self-citation (Wei) (Correct)
....of Theorem 1 and Theorem 3 LOE = OE Remark 7 In the case of n = 1; m = 2, problem (69) has been studied in [4] by using hypergeometric function method, and in [26] by functional analysis approach. Here both approaches do not work here. Instead, we use a continuity approach, which is inspired by [32]. Let us recall Lemma 8 (Theorem 1.4 of [26] Let n = 1; m = 2. Then we have OE 2 c 0 d L 2 (R) OE; X 1 ) 70) where X 1 : spanfw; w (y)g. We define a quadratic form nw Gamma m m : 71) 70) ....
J.C. Wei and L. Zhang. On a nonlocal eigenvalue problem. Annali della Scuola Normale Superiore di Pisa, Classe di Scienze, XXX:41-62, 2001. 27
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC