首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
Let M be a compact Riemannian manifold, E a Riemannian vector bundle on M and Σ the sphere subbundle of E. We look for embeddings of Σ into E admitting prescribed mean curvatures of various types. To cite this article: P. Cherrier, A. Hanani, C. R. Acad. Sci. Paris, Ser. I 335 (2002) 525–528.  相似文献   

2.
We consider proper edge colorings of a graph G using colors of the set {1, . . . , k}. Such a coloring is called neighbor sum distinguishing if for any pair of adjacent vertices x and y the sum of colors taken on the edges incident to x is different from the sum of colors taken on the edges incident to y. The smallest value of k in such a coloring of G is denoted by ndiΣ(G). In the paper we conjecture that for any connected graph G ≠ C 5 of order n ≥ 3 we have ndiΣ(G) ≤ Δ(G) + 2. We prove this conjecture for several classes of graphs. We also show that ndiΣ(G) ≤ 7Δ(G)/2 for any graph G with Δ(G) ≥ 2 and ndiΣ(G) ≤ 8 if G is cubic.  相似文献   

3.
In this paper it is shown that every nonnegative definite symmetric random matrix with independent diagonal elements and at least one nondegenerate nondiagonal element has a noninfinitely divisible distribution. Using this result it is established that every Wishart distribution Wp(k, Σ, M) with both p and rank (Σ) ≥ 2 is noninfinitely divisible. The paper also establishes that any Wishart matrix having distribution Wp(k, Σ, 0) has the joint distribution of its elements in the rth row and rth column to be infinitely divisible for every r = 1,2,…,p.  相似文献   

4.
Recent articles by Kushner and Meisner (1980) and Kushner, Lebow and Meisner (1981) have posed the problem of characterising the ‘EP’ functions f(S) for which Ef(S) for which E(f(S)) = λnf(Σ) for some λn ? R, whenever the m × m matrix S has the Wishart distribution W(m, n, Σ). In this article we obtain integral representations for all nonnegative EP functions. It is also shown that any bounded EP function is harmonic, and that EP polynomials may be used to approximate the functions in certain Lp spaces.  相似文献   

5.
In this paper, we study the structure of Turing degrees below 0′ in the theory that is a fragment of Peano arithmetic without Σ1 induction, with special focus on proper d-r.e. degrees and non-r.e. degrees. We prove:
  1. P ? + BΣ1 + Exp ? There is a proper d-r.e. degree.
  2. P ? +BΣ1+ Exp ? IΣ1 ? There is a proper d-r.e. degree below 0′.
  3. P ? + BΣ1 + Exp ? There is a non-r.e. degree below 0′.
  相似文献   

6.
The usual assumption in multivariate hypothesis testing is that the sample consists of n independent, identically distributed Gaussian m-vectors. In this paper this assumption is weakened by considering a class of distributions for which the vector observations are not necessarily either Gaussian or independent. This class contains the elliptically symmetric laws with densities of the form f(X(n × m)) = ψ[tr(X ? M)′ (X ? M?1]. For testing the equality of k scale matrices and for the sphericity hypothesis it is shown, by using the structure of the underlying distribution rather than any specific form of the density, that the usual invariant normal-theory tests are exactly robust, for both the null and non-null cases, under this wider class.  相似文献   

7.
In this paper, we study the aggregation problem with power control under the physical interference. The maximum power is bounded. The goal is to assign power to nodes and schedule transmissions toward the sink without physical interferences such that the total number of time slots is minimized. Under the assumption that the unit disk graph G δ r with transmission range δ r is connected for some constant 0 < δ ≤ 1/31/α , where r is the maximum transmission range determined by the maximum power, an approximation algorithm is presented with at most b 3(log2 n + 6) + (R?1)(μ 1 + μ 2) time slots, where n is the number of nodes, R is the radius of graph G δ r with respect to the sink, and b, μ 1, μ 2 are constants. Since both R and log2 n are lower bounds for the optimal latency of aggregation in the unit disk graph G δ r , our algorithm has a constant-approximation ratio for the aggregation problem in G δ r .  相似文献   

8.
We provide estimates on the volume of tubular neighborhoods around a subvariety Σ of real projective space, intersected with a disk of radius σ. The bounds are in terms of σ, the dimension of the ambient space, and the degree of equations defining Σ. We use these bounds to obtain smoothed analysis estimates for some conic condition numbers. To cite this article: P. Bürgisser et al., C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

9.
10.
In this Note we propose a rigorous justification of the limit constitutive law of a periodic bi-anisotropic electromagnetic structure with memory. This study is based on the periodic unfolding method, introduced by D. Cioranescu, A. Damlamian and G. Griso, and is applied on the time domain and on the frequency domain. To cite this article: A. Bossavit et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).  相似文献   

11.
12.
A function f(x) defined on X = X1 × X2 × … × Xn where each Xi is totally ordered satisfying f(xy) f(xy) ≥ f(x) f(y), where the lattice operations ∨ and ∧ refer to the usual ordering on X, is said to be multivariate totally positive of order 2 (MTP2). A random vector Z = (Z1, Z2,…, Zn) of n-real components is MTP2 if its density is MTP2. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies ??1D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP2 properties. The MTP2 property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP2 kernels are presented and amplified by a wide variety of applications.  相似文献   

13.
In this paper we define an extended quasi-homogeneous polynomial system d x/dt = Q = Q 1 + Q 2 + ... + Q δ , where Q i are some 3-dimensional quasi-homogeneous vectors with weight α and degree i, i = 1, . . . ,δ. Firstly we investigate the limit set of trajectory of this system. Secondly let Q T be the projective vector field of Q. We show that if δ ≤ 3 and the number of closed orbits of Q T is known, then an upper bound for the number of isolated closed orbits of the system is obtained. Moreover this upper bound is sharp for δ = 3. As an application, we show that a 3-dimensional polynomial system of degree 3 (resp. 5) admits 26 (resp. 112) isolated closed orbits. Finally, we prove that a 3-dimensional Lotka-Volterra system has no isolated closed orbits in the first octant if it is extended quasi-homogeneous.  相似文献   

14.
ABSTRACT

A ring R is called an n-clean (resp. Σ-clean) ring if every element in R is n-clean (resp. Σ-clean). Clean rings are 1-clean and hence are Σ-clean. An example shows that there exists a 2-clean ring that is not clean. This shows that Σ-clean rings are a proper generalization of clean rings. The group ring ?(p) G with G a cyclic group of order 3 is proved to be Σ-clean. The m× m matrix ring M m (R) over an n-clean ring is n-clean, and the m×m (m>1) matrix ring M m (R) over any ring is Σ-clean. Additionally, rings satisfying a weakly unit 1-stable range were introduced. Rings satisfying weakly unit 1-stable range are left-right symmetric and are generalizations of abelian π-regular rings, abelian clean rings, and rings satisfying unit 1-stable range. A ring R satisfies a weakly unit 1-stable range if and only if whenever a 1 R + ˙˙˙ a m R = dR, with m ≥ 2, a 1,…, a m, d ∈ R, there exist u 1 ∈ U(R) and u 2,…, u m ∈ W(R) such that a 1 u 1 + ? a m u m = Rd.  相似文献   

15.
16.
We prove that the action of a countable discrete group on a locally compact invariant space of minimal harmonic functions is ameanable. To cite this article: P. Biane, E. Germain, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 355–358.  相似文献   

17.
Semidefinite programming, SDP, relaxations have proven to be extremely strong for many hard discrete optimization problems. This is in particular true for the quadratic assignment problem, QAP, arguably one of the hardest NP-hard discrete optimization problems. There are several difficulties that arise in efficiently solving the SDP relaxation, e.g., increased dimension; inefficiency of the current primal–dual interior point solvers in terms of both time and accuracy; and difficulty and high expense in adding cutting plane constraints. We propose using the alternating direction method of multipliers ADMM in combination with facial reduction, FR, to solve the SDP relaxation. This first order approach allows for: inexpensive iterations, a method of cheaply obtaining low rank solutions; and a trivial way of exploiting the FR for adding cutting plane inequalities. In fact, we solve the doubly nonnegative, DNN, relaxation that includes both the SDP and all the nonnegativity constraints. When compared to current approaches and current best available bounds we obtain robustness, efficiency and improved bounds.  相似文献   

18.
The abstract boundary M of a normal complex-analytic surface singularity is canonically equipped with a contact structure. We show that if M is a rational homology sphere, then this contact structure is uniquely determined by the topological type of M. An essential tool is the notion of open book carrying a contact structure, defined by E. Giroux. To cite this article: C. Caubel, P. Popescu-Pampu, C. R. Acad. Sci. Paris, Ser. I 339 (2004).  相似文献   

19.
We consider the equations governing incompressible, viscous fluids in three space dimensions, rotating around an inhomogeneous vector B(x): this is a generalization of the usual rotating fluid model (where B is constant). We prove the weak convergence of Leray-type solutions towards a vector field which satisfies the usual 2D Navier–Stokes equation in the regions of space where B is constant, with Dirichlet boundary conditions, and a heat–type equation elsewhere. The method of proof uses weak compactness arguments. To cite this article: I. Gallagher, L. Saint-Raymond, C. R. Acad. Sci. Paris, Ser. I 336 (2003).  相似文献   

20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号