首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Suppose that (Xt)t0 is a one-dimensional Brownian motion with negative drift ?μ. It is possible to make sense of conditioning this process to be in the state 0 at an independent exponential random time and if we kill the conditioned process at the exponential time the resulting process is Markov. If we let the rate parameter of the random time go to 0, then the limit of the killed Markov process evolves like X conditioned to hit 0, after which time it behaves as X killed at the last time X visits 0. Equivalently, the limit process has the dynamics of the killed “bang–bang” Brownian motion that evolves like Brownian motion with positive drift +μ when it is negative, like Brownian motion with negative drift ?μ when it is positive, and is killed according to the local time spent at 0.An extension of this result holds in great generality for a Borel right process conditioned to be in some state a at an exponential random time, at which time it is killed. Our proofs involve understanding the Campbell measures associated with local times, the use of excursion theory, and the development of a suitable analogue of the “bang–bang” construction for a general Markov process.As examples, we consider the special case when the transient Borel right process is a one-dimensional diffusion. Characterizing the limiting conditioned and killed process via its infinitesimal generator leads to an investigation of the h-transforms of transient one-dimensional diffusion processes that goes beyond what is known and is of independent interest.  相似文献   

3.
4.
Two equivariant problems of the form εΔu=Fu are considered, where F is a real function which is invariant under the action of a group G, and, using Morse theory, for each problem an arbitrarily great number of orbits of solutions is founded, choosing ε suitably small.The first problem is a O2-equivariant system of two equations, which can be seen as a complex Ginzburg-Landau equation, while the second one is a system of m equations which is equivariant for the action of a finite group of real orthogonal matrices m×m.  相似文献   

5.
We consider the Griffith fracture model in two spatial dimensions, and prove existence of strong minimizers, with closed jump set and continuously differentiable deformation fields. One key ingredient, which is the object of the present paper, is a generalization to the vectorial situation of the decay estimate by De Giorgi, Carriero, and Leaci. This is based on replacing the coarea formula by a method to approximate SBDp functions with small jump set by Sobolev functions, and is restricted to two dimensions. The other two ingredients will appear in companion papers and consist respectively in regularity results for vectorial elliptic problems of the elasticity type and in a method to approximate in energy GSBDp functions by SBVp ones.  相似文献   

6.
《Discrete Mathematics》2019,342(1):233-249
A Weyl arrangement is the hyperplane arrangement defined by a root system. Saito proved that every Weyl arrangement is free. The Weyl subarrangements of type A are represented by simple graphs. Stanley gave a characterization of freeness for this type of arrangements in terms of their graph. In addition, the Weyl subarrangements of type B can be represented by signed graphs. A characterization of freeness for them is not known. However, characterizations of freeness for a few restricted classes are known. For instance, Edelman and Reiner characterized the freeness of the arrangements between type A1 and type B. In this paper, we give a characterization of the freeness and supersolvability of the Weyl subarrangements of type B under certain assumption.  相似文献   

7.
Given two coprime polynomials P and Q in Z[x,y] of degree bounded by d and bitsize bounded by τ, we address the problem of solving the system {P,Q}. We are interested in certified numerical approximations or, more precisely, isolating boxes of the solutions. We are also interested in computing, as intermediate symbolic objects, rational parameterizations of the solutions, and in particular Rational Univariate Representations (RURs), which can easily turn many queries on the system into queries on univariate polynomials. Such representations require the computation of a separating form for the system, that is a linear combination of the variables that takes different values when evaluated at the distinct solutions of the system.We present new algorithms for computing linear separating forms, RUR decompositions and isolating boxes of the solutions. We show that these three algorithms have worst-case bit complexity O˜B(d6+d5τ), where O˜ refers to the complexity where polylogarithmic factors are omitted and OB refers to the bit complexity. We also present probabilistic Las Vegas variants of our two first algorithms, which have expected bit complexity O˜B(d5+d4τ). A key ingredient of our proofs of complexity is an amortized analysis of the triangular decomposition algorithm via subresultants, which is of independent interest.  相似文献   

8.
9.
10.
A permutation of the multiset {1,1,2,2,,n,n} is called a Stirling permutation of order n if every entry between the two occurrences of i is greater than i for each i{1,2,,n}. In this paper, we introduce the definitions of block, even indexed entry, odd indexed entry, Stirling derangement, marked permutation and bicolored increasing binary tree. We first study the joint distribution of ascent plateaux, even indexed entries and left-to-right minima over the set of Stirling permutations of order n. We then present an involution on Stirling derangements.  相似文献   

11.
We conjecture that the set of all Hilbert functions of (artinian) level algebras enjoys a very natural form of regularity, which we call the Interval Conjecture (IC): If, for some positive integer α, (1,h1,,hi,,he) and (1,h1,,hi+α,,he) are both level h-vectors, then (1,h1,,hi+β,,he) is also level for each integer β=0,1,,α. In the Gorenstein case, i.e. when he=1, we also supply the Gorenstein Interval Conjecture (GIC), which naturally generalizes the IC, and basically states that the same property simultaneously holds for any two symmetric entries, say hi and he?i, of a Gorenstein h-vector.These conjectures are inspired by the research performed in this area over the last few years. A series of recent results seems to indicate that it will be nearly impossible to characterize explicitly the sets of all Gorenstein or of all level Hilbert functions. Therefore, our conjectures would at least provide the existence of a very strong — and natural — form of order in the structure of such important and complicated sets.We are still far from proving the conjectures at this point. However, we will already solve a few interesting cases, especially when it comes to the IC, in this paper. Among them, that of Gorenstein h-vectors of socle degree 4, that of level h-vectors of socle degree 2, and that of non-unimodal level h-vectors of socle degree 3 and any given codimension.  相似文献   

12.
13.
Let Fn be a free group of rank n generated by x1,,xn. In this paper we discuss three algorithmic problems related to automorphisms of F2.A word u=u(x1,,xn) of Fn is called positive if no negative exponents of xi occur in u. A word u in Fn is called potentially positive if ?(u) is positive for some automorphism ? of Fn. We prove that there is an algorithm to decide whether or not a given word in F2 is potentially positive, which gives an affirmative solution to problem F34a in [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] for the case of F2.Two elements u and v in Fn are said to be boundedly translation equivalent if the ratio of the cyclic lengths of ?(u) and ?(v) is bounded away from 0 and from ∞ for every automorphism ? of Fn. We provide an algorithm to determine whether or not two given elements of F2 are boundedly translation equivalent, thus answering question F38c in the online version of [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] for the case of F2.We also provide an algorithm to decide whether or not a given finitely generated subgroup of F2 is the fixed point group of some automorphism of F2, which settles problem F1b in [G. Baumslag, A.G. Myasnikov, V. Shpilrain, Open problems in combinatorial group theory, second ed., in: Contemp. Math., vol. 296, 2002, pp. 1–38, online version: http://www.grouptheory.info] in the affirmative for the case of F2.  相似文献   

14.
15.
We construct planar bi-Sobolev mappings whose local volume distortion is bounded from below by a given function fLp with p>1. More precisely, for any 1<q<(p+1)/2 we construct W1,q-bi-Sobolev maps with identity boundary conditions; for fL, we provide bi-Lipschitz maps. The basic building block of our construction are bi-Lipschitz maps which stretch a given compact subset of the unit square by a given factor while preserving the boundary. The construction of these stretching maps relies on a slight strengthening of the celebrated covering result of Alberti, Csörnyei, and Preiss for measurable planar sets in the case of compact sets. We apply our result to a model functional in nonlinear elasticity, the integrand of which features fast blowup as the Jacobian determinant of the deformation becomes small. For such functionals, the derivation of the equilibrium equations for minimizers requires an additional regularization of test functions, which our maps provide.  相似文献   

16.
A spanning tree of a properly edge-colored complete graph, Kn, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if K2m is properly (2m?1)-edge-colored, then the edges of K2m can be partitioned into m rainbow spanning trees except when m=2. By means of an explicit, constructive approach, in this paper we construct ?6m+93? mutually edge-disjoint rainbow spanning trees for any positive value of m. Not only are the rainbow trees produced, but also some structure of each rainbow spanning tree is determined in the process. This improves upon best constructive result to date in the literature which produces exactly three rainbow trees.  相似文献   

17.
We consider the eigenvalue problem for Hodge-Laplacian on a Riemannian manifold M isometrically immersed into another Riemannian manifold M¯. We first assume the pull back Weitzenböck operator of M¯ bounded from below, and obtain an extrinsic lower bound for the first eigenvalue of Hodge-Laplacian. As applications, we obtain some rigidity results. Second, when the pull back Weitzenböck operator of M¯ bounded from both sides, we give a lower bound of the first eigenvalue by the Ricci curvature of M and some extrinsic geometry. As a consequence, we prove a weak Ejiri type theorem, that is, if the Ricci curvature bounded from below pointwisely by a function of the norm square of the mean curvature vector, then M is a homology sphere. In the end, we give an example to show that all the eigenvalue estimates are optimal when M¯ is the space form.  相似文献   

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

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