Báo cáo toán học: "General results on the enumeration of strings in Dyck paths" ppt

Báo cáo toán học: "General results on the enumeration of strings in Dyck paths" ppt

Báo cáo toán học: "General results on the enumeration of strings in Dyck paths" ppt

... a non- empty Dyck prefix a nd k (resp. t) is the number of all consecutive falls in the end of τ (resp. p). Proof. Using the bijection of Fig. 6, under the inequality restrictions of relations ... evaluate the associated generating functions. Finally, in Section 6, we unify the main results of Sections 3, 4 and 5. We note that some of the results of t his...
Ngày tải lên : 08/08/2014, 14:23
  • 22
  • 304
  • 0
Báo cáo toán học: "Some Results on the Properties D3 (f ) and D4 (f )" ppsx

Báo cáo toán học: "Some Results on the Properties D3 (f ) and D4 (f )" ppsx

... see Theorem 3.4 in [1]). In this paper we investigate the Apiola’s results for the non-nuclear case. Namely we prove the following result. Main theorem. Let E be a Frechet spac e. Then (i) E has ... y)= x, p 2 (x, y)=y are the canonical projections. By the Proposition 3.2 the second Some Re sults on the Properties D 3 (f) and D 4 (f) 147 8. D.Vogt , On two clases of...
Ngày tải lên : 06/08/2014, 05:20
  • 9
  • 276
  • 0
Báo cáo toán học: "Some Results on the Relation Between Pluripolarity of Graphs and Holomorphicity" ppt

Báo cáo toán học: "Some Results on the Relation Between Pluripolarity of Graphs and Holomorphicity" ppt

... upper semi-continuous and the restriction of ϕ to the intersection of D with every complex line is subharmonic. The cone of plurisub- harmonic functions on D is denoted by PSH(D). A set E of C n is ... holomorphic on D (see [11]). In this paper we give some results of type of Shcherbina on the relation between pluriporlarity of graphs and holomorphicity of co...
Ngày tải lên : 06/08/2014, 05:20
  • 10
  • 411
  • 0
Báo cáo toán học: "A note on the number of (k, )-sum-free sets" potx

Báo cáo toán học: "A note on the number of (k, )-sum-free sets" potx

... Denote by SF n k, the number of (k, )-sum-free subsets of [1,n]. Since the set of 1 the electronic journal of combinatorics 7 (2000), #R30 7 Proof. We need to show that the left-hand side of (4) is ... Calkin, J. M. Thomson, Counting generalized sum-free sets,J. Number Theory 68 (1998), 151–160. [6] P.J.Cameron,P.Erd˝os, On the number of sets of integers with vario...
Ngày tải lên : 07/08/2014, 06:20
  • 8
  • 395
  • 0
Báo cáo toán học: "A note on the ranks of set-inclusion matrices" pps

Báo cáo toán học: "A note on the ranks of set-inclusion matrices" pps

... relation is derived for the rank (over most fields) of the set-inclusion matrices on a finite ground set. Given a finite set X of say v elements, let W = W t,k (v) be the (0,1)-matrix of inclusions for ... A note on the ranks of set-inclusion matrices D. de Caen Department of Mathematics and Statistics Queen’s University Kingston, Ontario, Canada K7L 3N6 decaen@mast.queensu...
Ngày tải lên : 07/08/2014, 06:22
  • 2
  • 305
  • 0
Báo cáo toán học: " A Note on the Glauber Dynamics for Sampling Independent Sets" ppt

Báo cáo toán học: " A Note on the Glauber Dynamics for Sampling Independent Sets" ppt

... things when w ∈ σ. Similarly when w is blocked, the move does not work in either chain. In the remaining case of w ∈ σ, w ∈ B σ (v), the move succeeds in exactly one of the chains resulting in ... = 2 ∆−2 .) Before stating our main theorem we formally define the Markov chain for the Glauber dynamics. For the purposes of the proof, the chain is defined on the...
Ngày tải lên : 07/08/2014, 06:22
  • 8
  • 343
  • 0
Báo cáo toán học: "A note on the number of edges guaranteeing a C4 in Eulerian bipartite digraph" pot

Báo cáo toán học: "A note on the number of edges guaranteeing a C4 in Eulerian bipartite digraph" pot

... specifying conditions on the cardinality of the edge-set of the digraph that guarantee the existence of a directed simple cycle of length at most four. As usual in Tur´an type problems in directed ... ,2ρn.Denotethisblock M 2 .DenotebyM 3 the block consisting of the rows i = |A + |+1, ,m and the columns j =1, ,ρn.DenotebyM 4 the block consisting of the rows...
Ngày tải lên : 07/08/2014, 06:23
  • 6
  • 282
  • 0
Báo cáo toán học: "Improved bounds on the length of maximal abelian square-free word" pot

Báo cáo toán học: "Improved bounds on the length of maximal abelian square-free word" pot

... in the left. Since both would have to be in the same w i ,bothmustbeinw 2 , but then the first, being in w 2 andontheleft half of s k−1 , would be in h k−1 , and there would then be an additional ... lie on the right side of s m , since it is in h m+1 . Thus for i ≥ m,therearetwoi’s to the right of the leftmost 6, at least one of which is not in s m , so there...
Ngày tải lên : 07/08/2014, 08:20
  • 12
  • 317
  • 0
Báo cáo toán học: "A Note on the Number of Hamiltonian Paths in Strong Tournaments" ppsx

Báo cáo toán học: "A Note on the Number of Hamiltonian Paths in Strong Tournaments" ppsx

... repeat the above argument with the portion of R  beginning at u m−1 and the vertex u m . Theorem 1. Let h p (n) be the minimum number of distinct hamiltonian paths in a strong tournament of order ... R. Proof. Note that we allow the special case where m = 0; in this case the path Q is a path on 0 vertices, and R = P satisfies the lemma trivially. The remainder of...
Ngày tải lên : 07/08/2014, 13:21
  • 4
  • 335
  • 1
Từ khóa: