L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht (1974). Mathematical & Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On the Asymptotic Density of Tautologies in Logic of.. - Marek Zaionc Computer (Correct)
....1) n i 1) 1 which is exactly n 1. Therefore the total number of such formulas is i=1 F i F n i . # 4 Generating functions The main tool we use for dealing with asymptotics of sequences of numbers are generating functions. A nice exposition of the method can be found in [6] and [1]. Also see [2] for the presentation of this method in logics. Many questions concerning the asymptotic behavior of a sequence A can be e#ciently resolved by analyzing the behavior of generating function f A at the complex circle = R. The key tool will be the following result due to Szego [5] ....
Comtet, L. (1974) Advanced combinatorics. The art of finite and infinite expansions. Revised and enlarged edition. Reidel, Dordrecht.
A change-of-coordinates from Geometry to Algebra, applied to Brick .. - King (Correct)
....following diagram commute. L Theta Delta Delta Delta Theta L Gamma Gamma Gamma Gamma Gamma Gamma L Theta Delta Delta Delta Theta L S 1 Theta Delta Delta Delta Theta S D Gamma Gamma Gamma Gamma Gamma Gamma S 1 Theta Delta Delta Delta Theta S D See [Comtet] or superseeker. In my definition of L[N] I omitted two phrases: the constant 0 function (the empty sum) and the constant 1 function (the sum whose only term is the empty word) Some authors include these phrases, and so their Dedekind numbers are two higher than those listed here. The set of ....
L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, Holland, 1974, MR:57 #124.
Reflected Brownian Bridge Local Time Conditioned On Its.. - And Guy Louchard (Correct)
....these formulas into u j y (z; ua(z) Na and applying Lemma 2 gives (9) 11) This leads to the following lemma Lemma 3. If z z 0 such that z z 0 62 R , then the following expansion holds: y (z; u)j u=a(z) m Proof. Note that Fa a di Bruno s formula (see e.g. [5]) gives (z; 1) P m i=1 ik i =m 1 (m 1) z (a(z) z; 1) By induction and using (j 1)k j = m 1 k j we get The dominant ones of these terms are clearly those where m 1 k j is maximal, which occurs if and only if k j = 2. This is ....
L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, Netherlands, 1974.
A Discontinuity in the Distribution of Fixed Point Sums - Bender, Canfield, al. (Correct)
....is the number of derangements of [n] With C = 1, a) is in fact an equality for all [n] It follows from the fact that the permutations of [n] with fixed points are the derangements of [n] K. Since G n = n , b) holds. For (c) first recall D n n e, as proven, for example, in [2] and on page 144 of [10] Then note that G n,k = D n k since we choose k fixed points and derange the rest. Hence k (n e k and so # = 1. The fact that permutations are a Poisson family also follows easily from the next lemma with C = # = 1. Lemma 1 Given a family of labeled ....
....done for all functions. Hence # = 2 e. Example 4 Permutations with Restricted Cycle Lengths. Consider permutations of [n] with all cycle lengths odd. The exponential generating function for G n is (1 x) 1 x) By Darboux s Theorem, G n n #n 2. For Darboux s Theorem see, for example, [2] or [10] Thus Lemma 1 applies with C = 1 and # = 1. Example 5 Labeled Forests of Rooted Trees. Let n be the labeled forests on [n] where each tree is rooted. Call a 1 vertex tree a fixed point. The number of labeled rooted trees is well known to be n . See, for example, 2] Since there ....
[Article contains additional citation context not shown here]
Louis Comtet, Advanced Combinatorics, D. Reidel, 1974.
On the density of truth in Dummett's logic (Extended Abstract) - Kostrzycka, Zaionc (2002) (Correct)
....in F n is nite and will be denoted as : Consequently all subclasses listed above are also nite for all n 2 N. 4 Generating functions The main tool we use for dealing with asymptotics of sequences of numbers are generating functions. A nice exposition of the method can be found in [6] and [1]. Our main task in this paper is to determine limits of various sequences of real numbers. For this purpose combinatorics has developed an extremely powerful tool in the form of generating series and generating functions. Let A = A 0 ; A 1 ; A 2 ; be a sequence of real numbers. The ....
Comtet, L. (1974) Advanced combinatorics. The art of nite and in nite expansions. Revised and enlarged edition. Reidel, Dordrecht.
Covers of Finite Sets with Distinct Block Sizes - Knopfmacher, Warlimont (Correct)
....Any representation of a nite set N as N = N 1 [ N 2 : N r , with N j 6= and N i 6= N j for i 6= j is called a cover of N . The sets N j are called the blocks of the cover. If V (n) denotes the number of covers of N where jN j = n, and V (0) 1 then it is well known (see Comtet [C, p165] or [HW] that V (n) satis es V (k) 2 Thus by binomial inversion, V (n) 2 1 0(2 as n 1 : 1:1) Suppose now that the order of the subsets in a cover of N is to be taken into account. If X(n) denotes the number of such ordered covers with X(0) 1, ....
L Comtet, Advanced Combinatorics, Reidel, 1974.
A Combinatorial Interpretation of the Area of Schröder Paths - Pergola, Pinzani (1999) (Correct)
No context found.
L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht (1974). Mathematical &
Balanced Boolean Functions with (more than) - Maximum Algebraic Immunity (Correct)
No context found.
L. Comtet. Advanced combinatorics, Reidel Publication, 1974. 8
Combinatorial Properties of One-Dimensional Arrangements - Frederic Cazals Imagis-Imag (1997) (Correct)
No context found.
Comtet, L. (1974). Advanced combinatorics. R. Reidel. 9
Extremal Problems (and a Bit of Enumeration) for Hypergraphs with .. - Klazar (2001) (Correct)
No context found.
L. Comtet, Advanced Combinatorics, D. Reidel Publ. Co., Boston, MA, 1974.
Enumerative and Combinatorial Properties of Dyck Partitions - Brenti (Correct)
No context found.
L. Comtet, Advanced Combinatorics, Reidel, Dordrecht/Boston, 1974.
Examples of Moments Problems Related With Some Combinatorial.. - Yassai (2003) (Correct)
No context found.
L. Comtet. Advanced Combinatorics, Reidel, Dordrecht, 1974.
On Growth Rates of Hereditary Permutation Classes - Kaiser, Klazar (2002) (Correct)
No context found.
L. Comtet, Advanced Combinatorics, D. Reidel, Dordrecht 1974.
Irreducible and Connected Permutations - Klazar (Correct)
No context found.
L. Comtet, Advanced Combinatorics, D. Reidel Publ. Co., Boston, MA, 1974.
A Discontinuity in the Distribution of Fixed Point Sums - Bender, Canfield, al. (Correct)
No context found.
Louis Comtet, Advanced Combinatorics, D. Reidel, 1974.
Article 04.2.1 Journal of Integer Sequences, Vol. 7 (2004), - An Asymptotic Expansion (Correct)
No context found.
L. Comtet, Advanced Combinatorics, D. Reidel, Boston, MA, 1974.
Generating Functionology in Computational Biology - Mireille Egnier Fariza (Correct)
No context found.
L. Comtet. Advanced Combinatorics. Reidel, Dordrecht, 1974.
A Discontinuity in the Distribution of Fixed Point Sums - Edward Bender Department (Correct)
No context found.
Louis Comtet, Advanced Combinatorics, D. Reidel, 1974.
The Enumeration of Simple Permutations - Albert, Atkinson, Klazar (2003) (1 citation) (Correct)
No context found.
Louis Comtet, Advanced combinatorics. D. Reidel, 1974.
Reflected Brownian Bridge Local Time Conditioned On Its.. - And Guy Louchard (Correct)
No context found.
L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, Netherlands, 1974.
The Wright ω Funcction - Corless, Jeffrey (Correct)
No context found.
Comtet, L. Advanced Combinatorics. Reidel, 1974.
Two combinatorial statistics on Dyck paths - Denise, Simion (1992) (2 citations) (Correct)
No context found.
L. Comtet, \Advanced Combinatorics," D. Reidel, Dordrecht, 1974.
Non-Associative Local Lie Groups - Olver (1996) (Correct)
No context found.
Comtet, L., Advanced Combinatorics, D. Reidel, Dordrecht, The Netherlands, 1974.
The function vMm(s; a, z) and some well-known sequences - Petojevic (2002) (Correct)
No context found.
L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
The Enumeration of Simple Permutations - Albert, Atkinson, Klazar (2003) (1 citation) (Correct)
No context found.
Louis Comtet, Advanced combinatorics. D. Reidel, 1974.
First 50 documents Next 50
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