Báo cáo toán học: "HARMONIC FUNCTIONS ON MULTIPLICATIVE GRAPHS AND INTERPOLATION POLYNOMIALS" docx

... harmonic function on Y afforded by Proposition 1.3 vanishes on all Young diagrams with more than l rows. Thus, one can consider such a function as a harmonic function on the subgraph Y(l)ofY consisting ... harmonic functions on certain graded graphs: the Young lattice and its generalizations. Such functions first emerged in harmonic analysis on the infinite symmetric group. Our...

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

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

... ad- dress configuration time ( ¯ T conf ), by simply consider- ing the two possible configuration situations: (i) there is on average multi-hop connectivity between the un- configured vehicle and the ... evaluated the config- uration time ¯ T conf under different traffic conditions and for different deployment configuration parame- ters. The traffic conditions are defined by the vehicu- lar density...

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

... Decomposition Lemma, E 1 and E 2 partition {1, ,n−1}. Set S 1 =(s i :i∈E 1 ),S 2 =(s i :i∈E 2 )−s ∗ n . By part 3 of the Decomposition Lemma, S 1 and S 2 are major sequences of length l − 1andn−l, ... Recursively obtain the trees T 1 = f(S 1 )andT 2 =f(S 2 )on{ 0, ,l−1} and {0, ,n−l} respectively, with e(T 1 )=a(S 1 )ande(T 2 )=a(S 2 ), and thus by Part 4 of the Decomposition Lemma e...

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

... =inf f=constant  e∈E f 2 (e)  x f 2 (x)d x log f 2 (x)  y f 2 (y)π(y) (8) where f ranges over all non-constant functions f : V → R and π is the stationary distribution of the nearest neighbor random walk on Γ. In a recent paper [9], Diaconis and Saloffe-Coste show that ∆ TV (t)≤e 1−c if ... P. Diaconis, R. L. Graham and J. A. Morrison, Asymptotic analysis of a random walk on a...

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

... L ∈ Σ P k .Above, the notation · , · refers to some canonical pairing function. With these definitions, NP = Σ P 1 ,coNP=Π P 1 ,andtheclassesΣ P k and Π P k form a neat hierarchy containing P and lying inside ... the definition of AM. Based on constructions like those of [12, 10, 11], one has AM ⊂ Σ P 2 ∩ Π P 2 ,com- pleting the claim in the introduction. One naturally wonders at the re...

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

... 4.1. Thus we have two actions of S n , one on factorizations and one on parking functions, and the map we are looking at is obviously covariant with respect to these actions, therefore in order ... factorization to get a new factorization. One checks that this extends to an action of S n on the set of factorizations. This corresponds to the local action of S n on V NC n+1 in [S],...

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

... the connection between initial positions and parking functions, and to Sara Billey for many useful comments, including (but not limited to) the possible relation between safe permutations and ... p, q is an initial position and that the corresponding safe permuta- tion is (421365). Moreover, p, q is feasible if and only if n ≥ 9(=12− 3), and the length of a longest increasing sub...

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

... m  5. 1 Introduction We deal with finite, simple graphs without loops and multiple edges. We use standard graph theory notation. Let G be a graph with the vertex set V (G) and the edge set E(G). ... 727–732. the electronic journal of combinatorics 16 (2009), #N30 3 A note on packing graphs without cycles of length up to five Agnieszka G¨orlich ∗ , Andrzej ˙ Zak University of Science...

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

... other cycles, as long as the permutation in question is even. The next result shows that we can guarantee this if m is even. In the proofs of Propositions 3.8 and 3.9, the permutations appearing ... acting upon the ‘positions’; that is to say (23) applied to an m-cycle c in Sym{1, 2, . . ., m} means ‘interchange the second and third element of c’ and not ‘interchange the numbers 2 and...

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