Báo cáo toán học: "Rationality, irrationality, and Wilf equivalence in generalized factor order" ppsx

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

... alt =""

Ngày tải lên: 05/08/2014, 15:21

... transpositions, then the poly- nomial (1) is equal to a sum of polynomials of the form (2) and again is TNN. (⇐) Suppose that π is not less than or equal to σ in the Bruhat order. By Theorem 1 we ... transpositions, then the evaluation of (3) at A is equal to a sum of polynomials of the form (4) and again (3) is SNN. (⇐) Suppose that π is not less than or equal to σ in the...

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

... hypotheses of the above claim are satised, and hence x(à) x(). On the other hand, bearing in mind that à and are in the interior of the same Weyl chamber C,andwà = à + and w = + are dominant, we ... (Lemma 4.5) and the induction continues.  For the numbering of the vertices of A 0 in what follows, refer to Figure 4. Corollary 5.6. The Bruhat orderings of...

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

... alternations either with blocks of the form π (k, + ) for  + >or of the form π (k, − ) for  − <, and horizontal alternations with blocks of the form π (k + ,) for k + >kor of the form π (k − ,) for ... than the nth Fibonacci number for some n .The definition of sub-2 n−1 is analogous. the electronic journal of combinatorics 13 (2006), #R54 9 Grid c...

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

... claw-free graphs with minimum degree at least three that have equal total domination and matching numbers. Keywords: claw-free, matching number, total domination number 1 Introduction Total domination ... graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G.AsetS of vertices...

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

... generalizing a result of Favaron and Kratsch [4] regarding k = 1. Keywords: domination, irredundance, distance domination number, total domi- nation number, connected domination number, distance irredundance ... − D and D is at most k (and D induces a connected graph in G). The minimum cardinality of a (connected) distance k-dominating set in G is the (connected) dista...

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

... γ(G) and i(G) are respectively the minimum cardinality of a dominating set and of an independent dominating set and β(G) is the maximum cardinality of an independent set. Alliances are defined in ... corona of a graph is obtained by attaching a pendant edge at each vertex of G. the electronic journal of combinatorics 15 (2008), #R123 2 Global alliances and indep...

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

... containing a finite odd cut of G extends to an element of C. 1 Introduction Erd˝os et al. [17] characterised the in nite graphs G containing an Euler tour, that is, a two-way in nite walk traversing ... ny arc in |G| with on e endpoint in X and one in Y contains an edge from F . 4 Euler tours In this section we prove Theorem 1.3, but before we do so let us consider an exa...

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

... of the embedding factor w ′ = 343 which has embedding index 5, and the two 2’s of u are in po sitions 6 and 7. Note that we obtain ordinary factor order by taking P to be an antichain. Also, we will ... explains all the Wilf equivalences in S 5 . In particular, the results of Section 4 and the last paragraph of Section 5 generat e all of the Wilf equivalences in Table 1...

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

... Diffusion of innovations on random networks: Understanding the chasm. In Proceedings of WINE 2 008, pages 178–185, 2008. [20] M. Molloy and B. Reed. A critical point for random graphs with a given ... the study of percolation in a random graph with given vertex degrees. We refer to Section 3 for more details. k-Core in Random Graphs with Given Degree Seque...

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

... production and survival in the field. High N concentrations in seedlings may lead to Original article Dry matter and nitrogen allocation in western redcedar, western hemlock, and ... balance and organic acids in western redcedar, western hemlock, and Douglas fir seedlings grown in low- and high-N soils, Can. J. For. Res. 29...

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

... said to be exterior if τ(uv) contains at least two leaves. One can check tha t the exterior edges of T are in one-to-one correspondence with the exterior pairs of the corresponding Dyck path Λ −1 (T ... nd a down step, respectively. In [3], Denise and Simion introduced and investigated the two statistics ‘pyramid weight’ and ‘number of exterior pairs on the set C n . A...

Ngày tải lên: 08/08/2014, 14:23

... T and the permutation π obtained from T by the first bijection of Corteel and Nadeau, we prove that the inversion number of T equals the number of occurrences of the dashed pattern 32–1 in the ... 0 equals B n . On the other hand, the following relation was proved by Corteel and Nadeau [7]. Theorem 3.2. The number of L-Bell permutation tableaux of length n equ...

Ngày tải lên: 08/08/2014, 14:23

... Tevlin, L., Thibon, J Y., Thiem, N., Venkateswaran, V., Vinroot, C. R., Yan, N., and Mike, Z. Supercharacters, symmetric functions in no ncommut ing variables, and related Hopf algebras. Preprint ... Rosas, M., and Zabrocki, M. Invariants and coinvariants of t he symmetric groups in noncommuting variables. Canad. J. Math. 60, 2 (20 08), 266–296. [4] Chen, W. Y. C., Li, T....

Ngày tải lên: 08/08/2014, 14:23