Báo cáo toán học: "Arcs with large conical subsets" ppsx

... could be several conical subsets that are large. Fortunately, we have the following Lemma 3 Let S be an arc with a conical subset T with excess e. Then the excess e ′ of any other conical subset ... (q + 5)/2 can contain at most one conical subset with excess a t most 2. Proof : Assume S has a conical subset T with excess e  2. Then by Lemma 3, a ny other conical subset...

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

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

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

... immersion with equal Wirtinger angle θ, then (cf. [7. 8]) PX,PY =cos 2 θX, Y ,X,Y∈ TM, with cos θ a locally Lipschitz function on M ,smoothontheopensetwhereit does not vanish. On an open set without ... generalized Wolfson’s theorem [18] to higher dimensions (i.e. n ≥ 2withequalK¨ahler angles). The author [15] generalized the theorem to submanifolds with parallel mean vector fields b...

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

... profile associated with ν, and that associated with λ). Among the subset of these elements which are larger than x, the first element output (corresponding to a peak) will be larger than x + a. Suppose ... creates the first 13 be B with top element b, the contents of the working stack just prior to this move be S with top element s, the remaining contents of the input stack be I with t...

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

...  d ) d , for some  d → 0. 3 Strings with maximally many distinct substrings We close with a solution to a simpler problem, choosing an n-long string A with a maxi- mum number of substrings ... have exponentially many subsequences; the base of the exponent is larger for the cyclic string than for the random one, but for large d both bases tend towards 2; and the factor by which a ran...

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

... neighbors with index larger than i form a complete graph. the electronic journal of combinatorics 11 (2004), #R26 9 Proof of Theorem 6.1. It suffices to prove that every chordal graph G with ω(G)=t ... a recursive construction with base cases G 1 = K 1 and G 2 = P 4 .Lett ≥ 3 and G t−1 be a chordal graph with ω(G t−1 )=t − 1andχ s (G t−1 )=  t 2  .LetP be a path with vertices denote...

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

... s B <l 1 with C as in (I) we can verify that, for sufficiently large n, C ⊆  2r 1 − ξ 1 − kξ 2 − 2k 2 + k − 5 2 ,r 1  ⊆ (l 1 ,r 1 ], |C \ A| > |B| and max K<s C . By analogy with part ... half of its elements with A. (Otherwise we would find a pair  ky 2  − d,  ky 2  + d in A, giving  ky 2  − d  +  ky 2  + d  = ky.) 2 Preparations Let n ∈ N be large and let k ∈ N...

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

... non-zero with sign (−1) n+c+b for x ∈ (1, 32/27] ≈ (1, 1.185]. For general graphs, the constant 32/27 cannot be replaced by anything larger because Jackson [3] produced a family of graphs with real ... showed that graphs with a hamiltonian path have no chromatic roots in (1, 1.29559 . . .). Both Jackson’s graphs with chromatic roots close to 32/27 and Thomassen’s graphs with chromat...

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

... vertices. How large “blow-up” of H must G contain? When H is an r-clique, this question was answered in [3]: G contains a complete r-partite graph with r − 1 parts of size  c r ln n  and one part larger ... the graph obtained by replacing each vertex u ∈ V (H) with a set V u of size x u and each edge uv ∈ E(H) with a complete bipartite graph with vertex classes V u and V v . Theor...

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