Báo cáo toán học: "A Beurling-Lax theorem for the Lie group U(m,n) which contains most classical interpolation theory " pot

... (2004) doi:10.1186/1687-1812-2011-106 Cite this article as: Zhu et al.: Weak convergence theorem for the three-step iterations of non-Lipschitzian nonself mappings in Banach spaces. Fixed Point Theory and Applications 2011 2011:106. Submit ... Shahzad, N: Convergence theorems for a common fixed point of finite family of nonself nonexpansive mappings. Fixed...

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

... alt =""

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

... v(G) denote the number of vertices, and (G) denote the number of edges. In this paper, we construct a graph G having no two cycles with the same length which leads to the following result. Theorem. ... Chunhui Lai, On the size of graphs with all cycle having distinct length, Discrete Math. 122(1993) 363-364. [6] Chunhui Lai, The edges in a graph...

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

... extended to T(m,n) for all m. It is worth remarking that the reciprocity theorem satisfied by the Laurent polynomials M( (m,n)) is a bit more complicated than the reciprocity theorem satisfied by ... is worth mentioning here that Cohn has proved a different reciprocity theorem for domino tilings [1]; it is unclear to me whether his Theorem 1 is related to the result treated...

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

... is the number of times the integer i occurs in the sequence T . Note that the sum of all b(i), 1 ≤ i ≤ n,isequaltol, the length of T . 3 A simple proof for the existence of exponentially balanced ... two, or are two successive powers of two. A proof for the existence of exponentially balanced Gray codes is derived. The proof is much sim- p...

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

... A 1 + A 2 + ···+ A k , the electronic journal of combinatorics 13 (2006), #N9 2 An addition theorem on the cyclic group Z p α q β Hui-Qin Cao Department of Applied Mathematics Nanjing Audit ... Proof of Theorem 1 For any subset A of an abelian group G let H(A) denote the maximal subgroup of G such that A + H(A)=A. What we state below is a classical theorem of Kneser [3]...

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

... agree above row r and to the left of column c (and the definitions of r and c) we see that the only possibility for /à is (r, c), completing the proof of this case and the theorem. Acknowledgements. ... 308, 9 (2008), 1524–1530. the electronic journal of combinatorics 15 (2008), #N23 4 A sharp bound for the reconstruction of partitions Vincent Vatter Departme...

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

... interpretation of the closed formula (10) for the number of con- vex permutominoes. We remark that the expression of f n resembles the expression (1) for the number c n of convex polyominoes of semi-perimeter ... : the uppermost cell of the rightmost column of the polyomino has the maximal ordinate among all the cells of the polyomino; U2 :...

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

... that those formulae yield interesting power series expansions for the logarithm function. This generalizes an infinite series of Lehmer for the natural logarithm of 4. 1 The abelian case: the Mahler ... fundamental group of the knot complement. For a square matrix M with entries in CG the trace tr CG (M) denotes the coefficient of the unit element in the sum of the...

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

... b i in P [k] j,i . the electronic journal of combinatorics 16 (2009), #R70 18 A normalization formula for the Jack polynomials in superspace and an identity on partitions Luc Lapointe ∗ Instituto ... where σ j and ∂ j are respectively the interchang e and divided difference operators on the variables a j and a j+1 (see for instance [6]). The main st...

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

... Beissinger, who was the first to explore [1] combinatorial proofs using colored permutations, for their assistance. References [1] Janet Beissinger. Colorful proofs of generating function identities. ... follows for (π, f ) ∈ S n,A : If R (π,f) = ∅, let φ((π, f)) = (π, f). Otherwise, let (i, j) ∈ R (π,f) be minimal under the lexicographic ordering of R (π,f) . Let ˜π = (i, j)...

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

... A recurrence relation for the “inv” analogue of q-Eulerian polynomials Chak-On Chow Department of Mathematics and Information Technology, Hong Kong Institute of Education, 10 Lo ... relation algebraically. In the final section, we give a combinatorial proof of this recurrence relation. 2 The recurrence relation We derive in the present section the rec...

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

... t). The basic idea of the proof of Theorem 3.1 is to show F à (q, t) and G à (q, t) satisfy the same recursion in the hook case. Proof. We first note the Garsia-Haiman recursion for the Hilbert series ... to the product of the weights of each of its entries, here the weight of entry s in T is taken to be the weight of the corner square containing s in...

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

... is a signed adjacency matrix associated to an ideal triangulation of a bordered surface with marked points (S, M), and G is a quiver. If B(G) = B, we say G is the oriented adjacency graph associated ... class of an adjacency matrix associated to a triangulation of a bordered surface with marked points is finite (Corollary 12.2 in [2]). It is also pro...

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

... a short proof for the result of Noonan [3] that the number of permutations of length n containing exactly one occurence of pattern 321 is 3 n  2n n−3  . (To be precise, Noonan considered permutations ... A short proof for the number of permutations containing pattern 321 exactly once Alexander Burstein Department of Mathematics Howard...

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