Báo cáo toán học: " Vizing-like conjecture for the upper domination of Cartesian products of graphs – the proof" pot

... view on the first 10 years of CR. More specifically of the different challenges faced by the CR decision making community and the suggested solution to answer them. We state that most of these decision ... upon acceptance. Fully formatted PDF and full text (HTML) versions will be made available soon. Decision making for cognitive radio equipment: analysis...

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

... q-Bernoulli, q-Euler numbers, and polynomials. 2. q-Bernoulli, q-Euler numbers and polynomials related to the Bosonic and the Fermionic p-adic integral on ℤ p In this section, we provide some basic formulas ... functions of the q-Bernoulli, q-Eule r numbers, and polynomials. We shall provide some basic formulas for the q-Bernoulli and q- Euler polynomials...

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

... class="bi x1 y0 w4 h 1" alt =""

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

... class="bi x0 y1 w1 h 3" alt =""

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

... =0|z=n 2 p)≤P(X=0|z≤n 2 p)≤3P(X=0)→0 by the theorem, where the last inequality above follows due to the observation that P(A|B) ≤ P(A)/P(B) and the fact that the central limit theorem [or the approxi- mate and ... if the exact form of (7) is used for , then = o(1) i à 2 / i t = o(n 1/5 ), so that even the extended Janson inequality will not lead to an improvement in the re...

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

... Lobstein: The minimum density of an identifying code in the king lattice, Discrete Mathematics, submitted. [4] I. Charon, O. Hudry, A. Lobstein: Identifying codes with small radius in some in nite regular ... Lobstein, G. Z´emor: New bounds for codes identifying vertices in graphs, Electronic Journal of Combinatorics, vol. 6(1), R19, 1999. [7] G. Cohen, I. Honkala, A....

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

... several counting problems on the square lattice L n . 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 ... y>0andz t y =1. the electronic journal of combinatorics 10 (2003), #R4 15 Improved bounds for the number of forests and acyclic...

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

... of the higher q, t-Catalan sequences. In the rest of the paper, we present some conjectured combinatorial interpretations for the higher q, t-Catalan sequences. We prove some combinatorial formulas, ... proved for these trivariate sequences. 1 Introduction In [7], Garsia and Haiman introduced a q, t-analogue of the Catalan numbers, which they called the q, t-C...

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

... in the next section, to prove that a MNT graph of order n ≥ 10 has at least 3n−2 2 edges. The first one concerns the lower bound for the number of edges of MNH graphs. It is the combination of ... is not complete, then some internal vertex of Q has a neighbour in G − V (Q). the electronic journal of combinatorics 12 (2005), #R32 2 Lower Bound for the Size...

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

... with n = 7 and s = 27 and get 8k 5 + 15k 6 + 22k 7 + 29  i 8 k i ≤ 58. (8) Multiplication with 3/22 and rounding off yields Lemma 3. the electronic journal of combinatorics 14 (20 07) , #R 27 4 5 ... we show k 3 (7) ≥ 156 and k 3 (8) ≥ 402 improving on the best previously known bounds k 3 (7) ≥ 153 and k 3 (8) ≥ 3 98. The proofs are founded on a recent technique...

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

... bound for the Tur´an number t 3 (n, 4), J. Combin. Theory Ser. A 87 (1999), no. 2, 381–389. the electronic journal of combinatorics 15 (2008), #R137 22 More Constructions for Tur´an’s (3, 4)-Conjecture Andrew ... case is when m = 3 and r = 4. Tur´an had a conjecture for this case, which we call Tur´an (3, 4)-conjecture. Conjecture 1.1 Let H be a 3-uniform hypergraph in wh...

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

... 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 G(n, ρ) for a relatively ... claim holds for d − 1. We prove the claim for d. Let S = (G 1 , G 2 , . . . , G d ) be the sequence of the labels of the nodes u i , i ∈ [d], along the path...

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

... symmetric functions of [21]; cf. formula (3.7) in that paper. Moreover, under the specialization a i = −i + 1 for all i ∈ Z the double Schur functions become the shifted Schur functions of [22] in the variables ... of θ due to the hook formula. Under the specialization a i = i + 1, for any partition à we have a à = (à 1 , à 2 1, . . . ). The following formula f...

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

... be the permutation corresponding to the transposed of B. We start with A 0,0 . Let A x,z be the matrix we have after k − 1 steps. Let the first row of A x,z be row number r and the first column of ... first column of A x,z be column number s of the original A 0,0 . Let the number of erased columns j such that j < p r be t k and the number the electronic...

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

... 1 A k R k,k+1  1 k  A k , the electronic journal of combinatorics 16 (2009), #R128 3 Symmetric functions for the generating matrix of the Yangian of gl n (C) Natasha Rozhkovskaya Department of Mathematics Kansas ... to the terms of the sum, we conclude that each of them has the form (−1) m−k− 1 e k (u)p − m−k (u − k), and the Newton’s formula for eleme...

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