Báo cáo toán học: "Some invariants for semi-Fredholm systems of essentially commuting operators " doc

... h 3" alt =""

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

... 305-701, South Korea Full list of author information is available at the end of the article Abstract The q-analogues of many well known formulas are derived by using sev eral results of q-Bernoulli, q-Euler ... basic formulas for p-adic q-Bernoulli , p-adic q-Euler numbers and polynomials which will be used to prove the main results of this article. Let UD(ℤ p , ℂ p ) denote the s...

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

... h 2" alt =""

Ngày tải lên: 05/08/2014, 09:46

...  1 (G, ω) is not weakly amenable. For non-abelian groups, Borwick [2] gives a very interesting classification of weak amenability of Beurling algebras in term of functions defined on G. Theorem ... 1.4 by producing an example of a group G which satisfies the condition (1.1), but it is not weakly amenable. Example 2.1. Let H be a Heisenberg group of matrices of the form ... satisfi...

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

... adaptation of the last proof also gives a proof of the following the electronic journal of combinatorics 10 (2003), #R4 10 The example shows that any entry of Λ  k is formed by a subset of the terms ... There the authors gave the following bounds for the asymp- totics of f(n), the number of forests of L n ,andα(n), the number of acyclic orienta- tions of L n :3.209912 ≤...

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

... orbital digraphs of G to the set of sub-orbits of G (for fixed ω ∈ Ω). Definition 1.3 Let G be a transitive permutation group of degree mk that admits a complete block system B of m blocks of size k.Ifg ... consisting of p + 1 independent edges (the edges of this graph consists of all edges of the form (v, w), where ∪{v,w} is a projective point; thus ∪{v, w} is ablockofD 2...

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

... for n ≥ 7. Combined results of Clark, Entringer and Shapiro [3], [4] and Lin, Jiang, Zhang and Yang [7] show that f(n)=3n/2 for n ≥ 19 and for n =6, 10, 11, 12, 13, 17. The values of f(n) for ... minimum number of edges of a maximal nontraceable graph of order n. Dudek, Katona and Wojda (2003) showed that g(n) ≥ 3n−2 2 −2forn ≥ 20 and g(n) ≤ 3n−2 2  for n ≥ 54 as wel...

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

... density of 5-sparse Steiner triple systems of orders n ≡ 1 mod 6 as compared to the set of numbers n ∈ N with n ≡ 1mod6is 1. Proof. Define P as the set of all primes ≡ 17 mod 54 and R as the set of ... ThetriplefromB 0 is of type 1. Then the form of the triple consists of elements from the set {t, ∞ 1 , ∞ 2 }. This leads to only two possibilities: The form of the Q configura...

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

... ε d−1 by the choice of δ. This proves the claim. (3) The proof is similar to the proof of Claim 4.8 (2). (4) The proof is similar to the proof of Claim 4.8 (1).  the electronic journal of combinatorics ... key ingredient of our proof. Given the informal discussion above, the proof of Theorem 1.1 looks very roughly as follows. At the first part of the proof we consider the graph...

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

... the vertices in A of the form (i 1 , . . . , i ℓ−1 , j, i ℓ+1 , . . . , i d ). By the construction of G, the value of X(v) ℓ is the same for each such vertex v, since vertices of A are nonadjacent. ... over the class M of matchings. Theorem 8. For d ≥ 2, there exists G ∈ M d such that χ(G) ≥  d 6 log d  . Proof. As the proof is similar to the pro of of Theorem 7, we will g i...

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