首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 93 毫秒
1.
2.
3.
In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed ss-dimensional sequence mm, whose elements are vectors obtained by concatenating dd-dimensional vectors from a low-discrepancy sequence qq with (s−d)(sd)-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0ε>0 the difference of the star discrepancies of the first NN points of mm and qq is bounded by εε with probability at least 1−2exp(−ε2N/2)12exp(ε2N/2) for NN sufficiently large. The authors did not study how large NN actually has to be and if and how this actually depends on the parameters ss and εε. In this note we derive a lower bound for NN, which significantly depends on ss and εε. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first NN points of mm and qq, which holds without any restrictions on NN. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes NN. We compare this bound to other known bounds.  相似文献   

4.
5.
In 1994 Dias da Silva and Hamidoune solved a long-standing open problem of Erd?s and Heilbronn using the structure of cyclic spaces for derivatives on Grassmannians and the representation theory of symmetric groups. They proved that for any subset AA of the pp-element group Z/pZZ/pZ (where pp is a prime), at least min{p,m|A|−m2+1}min{p,m|A|m2+1} different elements of the group can be written as the sum of mm different elements of AA. In this note we present an easily accessible simplified version of their proof for the case m=2m=2, and explain how the method can be applied to obtain the corresponding inverse theorem.  相似文献   

6.
We prove that if for a continuous map ff on a compact metric space XX, the chain recurrent set, R(f)R(f) has more than one chain component, then ff does not satisfy the asymptotic average shadowing property. We also show that if a continuous map ff on a compact metric space XX has the asymptotic average shadowing property and if AA is an attractor for ff, then AA is the single attractor for ff and we have A=R(f)A=R(f). We also study diffeomorphisms with asymptotic average shadowing property and prove that if MM is a compact manifold which is not finite with dimM=2dimM=2, then the C1C1 interior of the set of all C1C1 diffeomorphisms with the asymptotic average shadowing property is characterized by the set of ΩΩ-stable diffeomorphisms.  相似文献   

7.
Brooks’ theorem is a fundamental result in the theory of graph coloring. Catlin proved the following strengthening of Brooks’ theorem: Let dd be an integer at least 3, and let GG be a graph with maximum degree dd. If GG does not contain Kd+1Kd+1 as a subgraph, then GG has a dd-coloring in which one color class has size α(G)α(G). Here α(G)α(G) denotes the independence number of GG. We give a unified proof of Brooks’ theorem and Catlin’s theorem.  相似文献   

8.
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence xx over a finite alphabet is ultimately periodic if and only if, for some nn, the number of different factors of length nn appearing in xx is less than n+1n+1. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2d2. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of ZdZd definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉Z;<,+. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension dd and characterize sets of ZdZd definable in 〈Z;<,+〉Z;<,+ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.  相似文献   

9.
In this paper, we study degenerate CR embeddings ff of a strictly pseudoconvex hypersurface M⊂Cn+1MCn+1 into a sphere SS in a higher dimensional complex space CN+1CN+1. The degeneracy of the mapping ff will be characterized in terms of the ranks of the CR second fundamental form and its covariant derivatives. In 2004, the author, together with X. Huang and D. Zaitsev, established a rigidity result for CR embeddings ff into spheres in low codimensions. A key step in the proof of this result was to show that degenerate mappings are necessarily contained in a complex plane section of the target sphere (partial rigidity). In the 2004 paper, it was shown that if the total rank dd of the second fundamental form and all of its covariant derivatives is <n<n (here, nn is the CR dimension of MM), then f(M)f(M) is contained in a complex plane of dimension n+d+1n+d+1. The converse of this statement is also true, as is easy to see. When the total rank dd exceeds nn, it is no longer true, in general, that f(M)f(M) is contained in a complex plane of dimension n+d+1n+d+1, as can be seen by examples. In this paper, we carry out a systematic study of degenerate CR mappings into spheres. We show that when the ranks of the second fundamental form and its covariant derivatives exceed the CR dimension nn, then partial rigidity may still persist, but there is a “defect” kk that arises from the ranks exceeding nn such that f(M)f(M) is only contained in a complex plane of dimension n+d+k+1n+d+k+1. Moreover, this defect occurs in general, as is illustrated by examples.  相似文献   

10.
A dd-arc-dominated digraph is a digraph DD of minimum out-degree dd such that for every arc (x,y)(x,y) of DD, there exists a vertex uu of DD of out-degree dd such that (u,x)(u,x) and (u,y)(u,y) are arcs of DD. Henning and Yeo [Vertex disjoint cycles of different length in digraphs, SIAM J. Discrete Math. 26 (2012) 687–694] conjectured that a digraph with minimum out-degree at least four contains two vertex-disjoint cycles of different length. In this paper, we verify this conjecture for 4-arc-dominated digraphs.  相似文献   

11.
Let TT be a tree with ss ends and f,gf,g be continuous maps from TT to TT with f°g=g°ff°g=g°f. In this note we show that if there exists a positive integer m≥2m2 such that gcd(m,l)=1gcd(m,l)=1 for any 2≤l≤s2ls and f,gf,g share a periodic point which is a kmkm-periodic point of ff for some positive integer kk, then the topological entropy of f°gf°g is positive.  相似文献   

12.
Let RR be a commutative ring with identity. We will say that an RR-module MM satisfies the weak Nakayama property, if IM=MIM=M, where II is an ideal of RR, implies that for any x∈MxM there exists a∈IaI such that (a−1)x=0(a1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if RR is a local ring, then RR is a Max ring if and only if J(R)J(R), the Jacobson radical of RR, is TT-nilpotent if and only if every RR-module satisfies the weak Nakayama property.  相似文献   

13.
Suppose XX is a real qq-uniformly smooth Banach space and F,K:X→XF,K:XX are Lipschitz ??-strongly accretive maps with D(K)=F(X)=XD(K)=F(X)=X. Let uu denote the unique solution of the Hammerstein equation u+KFu=0u+KFu=0. An iteration process recently introduced by Chidume and Zegeye is shown to converge strongly to uu. No invertibility assumption is imposed on KK and the operators KK and FF need not be defined on compact subsets of XX. Furthermore, our new technique of proof is of independent interest. Finally, some interesting open questions are included.  相似文献   

14.
The paper deals with the radially symmetric solutions of ut=Δu+um(x,t)vn(0,t)ut=Δu+um(x,t)vn(0,t), vt=Δv+up(0,t)vq(x,t)vt=Δv+up(0,t)vq(x,t), subject to null Dirichlet boundary conditions. For the blow-up classical solutions, we propose the critical exponents for non-simultaneous blow-up by determining the complete and optimal classification for all the non-negative exponents: (i) There exist initial data such that uu (vv) blows up alone if and only if m>p+1m>p+1 (q>n+1q>n+1), which means that any blow-up is simultaneous if and only if m≤p+1mp+1, q≤n+1qn+1. (ii) Any blow-up is uu (vv) blowing up with vv (uu) remaining bounded if and only if m>p+1m>p+1, q≤n+1qn+1 (m≤p+1mp+1, q>n+1q>n+1). (iii) Both non-simultaneous and simultaneous blow-up may occur if and only if m>p+1m>p+1, q>n+1q>n+1. Moreover, we consider the blow-up rate and set estimates which were not obtained in the previously known work for the same model.  相似文献   

15.
A subset S⊆VSV in a graph G=(V,E)G=(V,E) is a [j,k][j,k]-set if, for every vertex v∈V?SvV?S, j≤|N(v)∩S|≤kj|N(v)S|k for non-negative integers jj and kk, that is, every vertex v∈V?SvV?S is adjacent to at least jj but not more than kk vertices in SS. In this paper, we focus on small jj and kk, and relate the concept of [j,k][j,k]-sets to a host of other concepts in domination theory, including perfect domination, efficient domination, nearly perfect sets, 2-packings, and kk-dependent sets. We also determine bounds on the cardinality of minimum [1, 2]-sets, and investigate extremal graphs achieving these bounds. This study has implications for restrained domination as well. Using a result for [1, 3]-sets, we show that, for any grid graph GG, the restrained domination number is equal to the domination number of GG.  相似文献   

16.
Based on the classical Hermite spline interpolant H2n1H2n1, which is the piecewise interpolation polynomial of class Cn−1Cn1 and degree 2n−12n1, a piecewise interpolation polynomial H2nH2n of degree 2n2n is given. The formulas for computing H2nH2n by H2n1H2n1 and computing H2n+1H2n+1 by H2nH2n are shown. Thus a simple recursive method for the construction of the piecewise interpolation polynomial set {Hj}{Hj} is presented. The piecewise interpolation polynomial H2nH2n satisfies the same interpolation conditions as the interpolant H2n1H2n1, and is an optimal approximation of the interpolant H2n+1H2n+1. Some interesting properties are also proved.  相似文献   

17.
Let R(G)R(G) be the graph obtained from GG by adding a new vertex corresponding to each edge of GG and by joining each new vertex to the end vertices of the corresponding edge, and Q(G)Q(G) be the graph obtained from GG by inserting a new vertex into every edge of GG and by joining by edges those pairs of these new vertices which lie on adjacent edges of GG. In this paper, we determine the Laplacian polynomials of R(G)R(G) and Q(G)Q(G) of a regular graph GG; on the other hand, we derive formulae and lower bounds of the Kirchhoff index of these graphs.  相似文献   

18.
19.
This paper is devoted to construct a family of fifth degree cubature formulae for nn-cube with symmetric measure and nn-dimensional spherically symmetrical region. The formula fornn-cube contains at most n2+5n+3n2+5n+3 points and for nn-dimensional spherically symmetrical region contains only n2+3n+3n2+3n+3 points. Moreover, the numbers can be reduced to n2+3n+1n2+3n+1 and n2+n+1n2+n+1 if n=7n=7 respectively, the latter of which is minimal.  相似文献   

20.
We introduce (n+1)(n+1)-preprojective algebras of algebras of global dimension nn. We show that if an algebra is nn-representation-finite then its (n+1)(n+1)-preprojective algebra is self-injective. In this situation, we show that the stable module category of the (n+1)(n+1)-preprojective algebra is (n+1)(n+1)-Calabi–Yau, and, more precisely, it is the (n+1)(n+1)-Amiot cluster category of the stable nn-Auslander algebra of the original algebra. In particular this stable category contains an (n+1)(n+1)-cluster tilting object. We show that even if the (n+1)(n+1)-preprojective algebra is not self-injective, under certain assumptions (which are always satisfied for n∈{1,2}n{1,2}) the results above still hold for the stable category of Cohen–Macaulay modules.  相似文献   

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

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