首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 121 毫秒
1.
Circle graph is an intersection graph of chords of a circle. We denote the class of circle graphs by cir. In this paper we investigate the chromatic number of the circle graph as a function of the size of maximum clique ω=ω(G). More precisely we investigate f(k)=max{χ(G)|GCIR &ω(G)k}. Kratochvíl and Kostochka showed that f(k)502k32k64. The best lower bound is by Kostochka and is f(k)=Ω(klogk). We improve the upper bound to f(k)212k24k24. We also present the bound χ(G)ωlogn which shows, that the circle graphs with small maximum clique and large chromatic number must have many vertices.  相似文献   

2.
3.
4.
5.
6.
Let ω be a domain in R2 and let θ:ω¯R3 be a smooth immersion. The main purpose of this paper is to establish a “nonlinear Korn inequality on the surface θ(ω¯)”, asserting that, under ad hoc assumptions, the H1(ω)-distance between the surface θ(ω¯) and a deformed surface is “controlled” by the L1(ω)-distance between their fundamental forms. Naturally, the H1(ω)-distance between the two surfaces is only measured up to proper isometries of R3.This inequality implies in particular the following interesting per se sequential continuity property for a sequence of surfaces. Let θk:ωR3, k1, be mappings with the following properties: They belong to the space H1(ω); the vector fields normal to the surfaces θk(ω), k1, are well defined a.e. in ω and they also belong to the space H1(ω); the principal radii of curvature of the surfaces θk(ω), k1, stay uniformly away from zero; and finally, the fundamental forms of the surfaces θk(ω) converge in L1(ω) toward the fundamental forms of the surface θ(ω¯) as k. Then, up to proper isometries of R3, the surfaces θk(ω) converge in H1(ω) toward the surface θ(ω¯) as k.Such results have potential applications to nonlinear shell theory, the surface θ(ω¯) being then the middle surface of the reference configuration of a nonlinearly elastic shell.  相似文献   

7.
We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and we prove that its bit-time complexity is still O(n2) for two n-bit integers in the worst case. Our preliminar experiments show a potential speedup for small integers. A parallel version matches the best presently known time complexity, namely O(n/logn) time with O(n1+ϵ) processors, for any constant ϵ>0.  相似文献   

8.
9.
The main purpose of this Note is to show how a ‘nonlinear Korn's inequality on a surface’ can be established. This inequality implies in particular the following interesting per se sequential continuity property for a sequence of surfaces. Let ω be a domain in R2, let θ:ω¯R3 be a smooth immersion, and let θk:ω¯R3, k?1, be mappings with the following properties: They belong to the space H1(ω); the vector fields normal to the surfaces θk(ω), k?1, are well defined a.e. in ω and they also belong to the space H1(ω); the principal radii of curvature of the surfaces θk(ω) stay uniformly away from zero; and finally, the three fundamental forms of the surfaces θk(ω) converge in L1(ω) toward the three fundamental forms of the surface θ(ω) as k. Then, up to proper isometries of R3, the surfaces θk(ω) converge in H1(ω) toward the surface θ(ω) as k. To cite this article: P.G. Ciarlet et al., C. R. Acad. Sci. Paris, Ser. I 341 (2005).  相似文献   

10.
11.
12.
We present a fixed-parameter algorithm for the Minimum Convex Partition and the Minimum Weight Convex Partition problem. The algorithm is based on techniques developed for the Minimum Weight Triangulation problem. On a set P of n points the algorithm runs in O(2kk4n3+nlogn) time. The parameter k is the number of points in P lying in the interior of the convex hull of P.  相似文献   

13.
Let N+(k)=2k/2k3/2f(k) and N?(k)=2k/2k1/2g(k) where f(k) and g(k)0 arbitrarily slowly as k. We show that the probability of a random 2-coloring of {1,2,,N+(k)} containing a monochromatic k-term arithmetic progression approaches 1, and the probability of a random 2-coloring of {1,2,,N?(k)} containing a monochromatic k-term arithmetic progression approaches 0, as k. This improves an upper bound due to Brown, who had established an analogous result for N+(k)=2klogkf(k).  相似文献   

14.
15.
16.
17.
18.
We define a family KV(g,n+1) of Kashiwara–Vergne problems associated with compact connected oriented 2-manifolds of genus g with n+1 boundary components. The problem KV(0,3) is the classical Kashiwara–Vergne problem from Lie theory. We show the existence of solutions to KV(g,n+1) for arbitrary g and n. The key point is the solution to KV(1,1) based on the results by B. Enriquez on elliptic associators. Our construction is motivated by applications to the formality problem for the Goldman–Turaev Lie bialgebra g(g,n+1). In more detail, we show that every solution to KV(g,n+1) induces a Lie bialgebra isomorphism between g(g,n+1) and its associated graded grg(g,n+1). For g=0, a similar result was obtained by G. Massuyeau using the Kontsevich integral. For g1, n=0, our results imply that the obstruction to surjectivity of the Johnson homomorphism provided by the Turaev cobracket is equivalent to the Enomoto–Satoh obstruction.  相似文献   

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

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