Báo cáo toán học: " On an Invariant-Theoretic Description of the Lambda Algebra" ppsx

... modular invariant theory of the general linear group at the prime p = 2. In [8], Hung and the author gave a mod-p analogue of the Singer invariant-theoretic description of the dual of the lambda algebra ... part by the Vietnam National Research Program Grant 140801. On an Invariant-Theoretic Description of the Lambda Algebra 29 where a n,k ∈ F p and a...

Ngày tải lên: 06/08/2014, 05:20

... multidimensional version of Lagrange’s inversion formula due to Good [4]. On the other hand, Constantineau and J. Labelle provide a combinatorial proof in [3]. First of all, we will give a simple proof ... a rooted tree on k vertices (the component the electronic journal of combinatorics 13 (2006), #N14 5 2 Proof of the main theorem By the recursive structure of rooted...

Ngày tải lên: 07/08/2014, 13:21

...

Ngày tải lên: 05/08/2014, 10:20

... class="bi x1 y0 w4 h 1" alt =""

Ngày tải lên: 05/08/2014, 10:20

... by w. The multiplication of A by  n i=1 1 1−t i and the extraction of the coefficient of t r 1 t r 2 ···t r n in the result corresponds at the set theoretic level to the concatenation of the signed ... Section 3 contains the derivation of the generating series for the number of Stockhausen sequences. In Section 4 we generalize the method given in Section 3 and...

Ngày tải lên: 07/08/2014, 06:20

... (15) On a Strange Recursion of Golomb Ed Barbeau Steve Tanny Department of Mathematics Department of Mathematics University of Toronto University of Toronto Toronto, Canada M5S 1A1 Toronto, Canada ... descendants under b of each of the seeds. In fact, a second partition is more interesting. It contains an infinite number of sets, each of which consists of an unique...

Ngày tải lên: 07/08/2014, 06:20

... during a long-term visit at the Mathemat- ical Institute of Cologne University. I thank the staff of the institute and personally P. Bundschuh for the brilliant working atmosphere I had there. References [1] ... supported by an Alexander von Humboldt research fellowship and partially supported by grant no. 03-01-00359 of the Russian Foundation for Basic Research. the electr...

Ngày tải lên: 07/08/2014, 08:20

... by N +1. Proof of Theorem 1. We let τ 2N (q, z,y) denote the numerator on the right-hand side of (3) and τ 2N+1 (q, z,y) denote the numerator on the right-hand side of (4). If we can show that ... a 3 φ 2 transformation [2, p.242, eq.(III.13)], and the proof of Theorem 1 is easiest using (3) and (4). the electronic journal of combinatorics 11(2) (2004), #R1 9 The r...

Ngày tải lên: 07/08/2014, 08:22

... partial order ≺ on the set of all graphs. Let n 2 (G)bethenumberof ≥ 2-vertices of G. For any two graphs G 1 and G 2 , G 1 ≺ G 2 if and only if at least one of the following conditions holds: • ... respectively the set of successors of v ,the set of predecessors of v and the set of neighbors of v in G.Themaximum degree and minimum degree of a graph G are respect...

Ngày tải lên: 07/08/2014, 13:21

... that is, the number of partitions of b −i, which is not more than p(t). Therefore, for any fixed b and i, the function m a (i, b) is the sum of a bounded number of polynomial functions of n, and as ... to the proof of Theorem 3.3. ✸ 4 Further Directions As we have mentioned, in the special case of q = 2, there are known combinatorial proofs for the balanced property...

Ngày tải lên: 07/08/2014, 13:21