首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
We discuss dimension theory in the class of all topological groups. For locally compact topological groups there are many classical results in the literature. Dimension theory for non-locally compact topological groups is mysterious. It is for example unknown whether every connected (hence at least 1-dimensional) Polish group contains a homeomorphic copy of [0,1]. And it is unknown whether there is a homogeneous metrizable compact space the homeomorphism group of which is 2-dimensional. Other classical open problems are the following ones. Let G be a topological group with a countable network. Does it follow that dimG=indG=IndG? The same question if X is a compact coset space. We also do not know whether the inequality dim(G×H)dimG+dimH holds for arbitrary topological groups G and H which are subgroups of σ-compact topological groups. The aim of this paper is to discuss such and related problems. But we do not attempt to survey the literature.  相似文献   

3.
4.
5.
6.
7.
A long-standing Vizing’s conjecture asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers; one of the most significant results related to the conjecture is the bound of Clark and Suen, γ(GH)γ(G)γ(H)2, where γ stands for the domination number, and GH is the Cartesian product of graphs G and H. In this note, we improve this bound by employing the 2-packing number ρ(G) of a graph G into the formula, asserting that γ(GH)(2γ(G)?ρ(G))γ(H)3. The resulting bound is better than that of Clark and Suen whenever G is a graph with ρ(G)<γ(G)2, and in the case G has diameter 2 reads as γ(GH)(2γ(G)?1)γ(H)3.  相似文献   

8.
Let 1<c<3718,c2 and N be a sufficiently large real number. In this paper, we prove that, for almost all R(N,2N], the Diophantine inequality |p1c+p2c+p3c?R|<log?1N is solvable in primes p1,p2,p3. Moreover, we also investigate the problem of six primes and prove that the Diophantine inequality |p1c+p2c+p3c+p4c+p5c+p6c?N|<log?1N is solvable in primes p1,p2,p3,p4,p5,p6 for sufficiently large real number N.  相似文献   

9.
10.
For u,v positive integers with uv4(mod6), let ICKPD(u,v) denote a canonical Kirkman packing of order u missing one of order v. In this paper, it is shown that the necessary condition for existence of an ICKPD(u,v), namely u3v+4, is sufficient with a definite exception (u,v)=(16,4), and except possibly when v>76, v4(mod12) and u{3v+4,3v+10}.  相似文献   

11.
The well-known conjecture of Vizing on the domination number of Cartesian product graphs claims that for any two graphs G and H, γ(GH)γ(G)γ(H). We disprove its variations on independent domination number and Barcalkin–German number, i.e. Conjectures 9.6 and 9.2 from the recent survey Bre?ar et al. (2012) [4]. We also give some extensions of the double-projection argument of Clark and Suen (2000) [8], showing that their result can be improved in the case of bounded-degree graphs. Similarly, for rainbow domination number we show for every k1 that γrk(GH)kk+1γ(G)γ(H), which is closely related to Question 9.9 from the same survey. We also prove that the minimum possible counterexample to Vizing’s conjecture cannot have two neighboring vertices of degree two.  相似文献   

12.
13.
14.
15.
16.
For every real numbers a?1, b?1 with (a,b)(1,1), the curve parametrized by θR valued in C2?R4
γ:θ?(x(θ)+?1y(θ),u(θ)+?1v(θ))
with components:
x(θ):=a?1a(ab?1)cos?θ,y(θ):=b(a?1)ab?1sin?θ,u(θ):=b?1b(ab?1)sin?θ,v(θ):=?a(b?1)ab?1cos?θ,
has image contained in the CR-umbilical locus:
γ(R)?UmbCR(Ea,b)?Ea,b
of the ellipsoid Ea,b?C2 of equation ax2+y2+bu2+v2=1, where the CR-umbilical locus of a Levi nondegenerate hypersurface M3?C2 is the set of points at which the Cartan curvature of M vanishes.  相似文献   

17.
Given a bounded universe {0,1,,U?1}, we show how to perform predecessor searches in O(loglogΔ) expected time, where Δ is the difference between the element being searched for and its predecessor in the structure, while supporting updates in O(loglogΔ) expected amortized time, as well. This unifies the results of traditional bounded universe structures (which support predecessor searches in O(loglogU) time) and hashing (which supports membership queries in O(1) time). We also show how these results can be applied to approximate nearest neighbour queries and range searching.  相似文献   

18.
We consider the following Brezis–Nirenberg problem on S3
?ΔS3u=λu+u5inD,u>0inDandu=0on ?D,
where D is a geodesic ball on S3 with geodesic radius θ1, and ΔS3 is the Laplace–Beltrami operator on S3. We prove that for any λ<?34 and for every θ1<π with π?θ1 sufficiently small (depending on λ), there exists bubbling solution to the above problem. This solves a conjecture raised by Bandle and Benguria [J. Differential Equations 178 (2002) 264–279] and Brezis and Peletier [C. R. Acad. Sci. Paris, Ser. I 339 (2004) 291–394]. To cite this article: W. Chen, J. Wei, C. R. Acad. Sci. Paris, Ser. I 341 (2005).  相似文献   

19.
20.
Garaschuk and Lisoněk (2008) in [3] characterised ternary Kloosterman sums modulo 4, leaving the cases K(a)1(mod4) and K(a)3(mod4) as open problems. In this paper we complete the characterisation using well-known theorems on Gauss sums and Kloosterman sums. We also give the number of elements satisfying these congruences.  相似文献   

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

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

京公网安备 11010802026262号