Imaginary powers of Laplace operators

We show that if is a second-order uniformly elliptic operator in divergence form on , then . We also prove that the upper bounds remain true for any operator with the finite speed propagation property.

     

Complex Powers of the Neumann Laplacian in Lipschitz Domains

Let L^q_r(Ω) be the usual scale of Sobolev spaces and let Δ_N be the Neumann Laplacian in an arbitrary Lipschitz domain Ω. We present an interpolation based approach to the following question: for what range of indices does map isomorphically onto L^q_r(Ω)/ℝ?     

N指标d维广义Brownian Sheet的像集及图集的Hausdorff测度

本文得到了Ｎ指标ｄ维广义Ｂｒｏｗｎｉａｎ Ｓｈｅｅｔ的像集及图集的Ｈａｕｓｄｏｒｆｆ测度的上、下界．     

（mg＋k,mf—k）—图中正交于r个不相交子图的边不变的（g,f）—因子

设m,k和r为正整数,且使l≤k＜m.设G是一个具有顶点集合V(G)和边集合E(G)的图,并设g和f是定义在V(G)上的使对每个x∈V(G)有r≤g(x)≤f(x)的整数值函数.设H1,H2,…,Hr是G的r个顶点不相交的子图且|E(Hi)|=k,1≤i≤r.本文证明了每个(mg+k,mf-k)-图有k个边不相交的(g,f)-因子正交于Hi,1≤i≤r.     

Intertwining wavelets or multiresolution analysis on graphs through random forests

We propose a new method for performing multiscale analysis of functions defined on the vertices of a finite connected weighted graph. Our approach relies on a random spanning forest to downsample the set of vertices, and on approximate solutions of Markov intertwining relation to provide a subgraph structure and a filter bank leading to a wavelet basis of the set of functions. Our construction involves two parameters q and $q^{\prime }$. The first one controls the mean number of kept vertices in the downsampling, while the second one is a tuning parameter between space localization and frequency localization. We provide an explicit reconstruction formula, bounds on the reconstruction operator norm and on the error in the intertwining relation, and a Jackson-like inequality. These bounds lead to recommend a way to choose the parameters q and $q^{\prime }$. We illustrate the method by numerical experiments.     

Recurrent points and non-wandering points of graph maps

Let G be a graph and f:G→G be a continuous map. Denote by P(f), R(f) and Ω(f) the sets of periodic points, recurrent points and non-wandering points of f, respectively. In this paper we show that: (1) If L=(x,y) is an open arc contained in an edge of G such that {fm(x),fk(y)}⊂(x,y) for some m,k∈N, then R(f)∩(x,y)≠∅; (2) Any isolated point of P(f) is also an isolated point of Ω(f); (3) If x∈Ω(f)−Ω(fn) for some n∈N, then x is an eventually periodic point. These generalize the corresponding results in W. Huang and X. Ye (2001) [9] and J. Xiong (1983, 1986) [17] and [19] on interval maps or tree maps.     

Cohen–Macaulayness of monomial ideals and symbolic powers of Stanley–Reisner ideals

We present criteria for the Cohen–Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen–Macaulayness of monomial ideals which are intersections of prime ideal powers. We can characterize the Cohen–Macaulayness of the second symbolic power or of all symbolic powers of a Stanley–Reisner ideal in terms of the simplicial complex. These characterizations show that the simplicial complex must be very compact if some symbolic power is Cohen–Macaulay. In particular, all symbolic powers are Cohen–Macaulay if and only if the simplicial complex is a matroid complex. We also prove that the Cohen–Macaulayness can pass from a symbolic power to another symbolic powers in different ways.     

Distributed computation of virtual coordinates for greedy routing in sensor networks

Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called “greedy routing” based on the “virtual” coordinates of the nodes derived from the embedding.     

Minimum sum set coloring of trees and line graphs of trees

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.