首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 580 毫秒
1.
The (complex-valued) Brownian motion of order n is defined as the limit of a random walk on the complex roots of the unity. Real-valued fractional noises are obtained as fractional derivatives of the Gaussian white noise (or order two). Here one combines these two approaches and one considers the new class of fractional noises obtained as fractional derivative of the complex-valued Brownian motion of order n. The key of the approach is the relation between differential and fractional differential provided by the fractional Taylor’s series of analytic function , where E is the Mittag–Leffler function on the one hand, and the generalized Maruyama’s notation, on the other hand. Some questions are revisited such as the definition of fractional Brownian motion as integral w.r.t. (dt), and the exponential growth equation driven by fractional Brownian motion, to which a new solution is proposed. As a first illustrative example of application, in mathematical finance, one proposes a new approach to the optimal management of a stochastic portfolio of fractional order via the Lagrange variational technique applied to the state moment dynamical equations. In the second example, one deals with non-random Lagrangian mechanics of fractional order. The last example proposes a new approach to fractional stochastic mechanics, and the solution so obtained gives rise to the question as to whether physical systems would not have their own internal random times.  相似文献   

2.
This paper presents a novel analytical approach utilizing fractal dimension criteria and the maximum Lyapunov exponent to characterize the conditions which can potentially lead to the chaotic motion of a simply supported thermo-mechanically coupled orthotropic rectangular plate undergoing large deflections. The study commences by deriving the governing partial differential equations of the rectangular plate, and then applies the Galerkin method to simplify these equations to a set of three ordinary differential equations. The associated power spectra, phase plots, Poincaré map, maximum Lyapunov exponents, and fractal and bifurcation diagrams are computed numerically. These features are used to characterize the dynamic behavior of the orthotropic rectangular plate under various excitation conditions. The maximum Lyapunov exponents and the correlation dimensions method indicate that chaotic motion of the orthotropic plate occurs at η1 = 1.0, , and for an external force of . The application of an external in-plane force of magnitude causes the orthotropic plate to perform bifurcation motion. Furthermore, when , aperiodic motion of the plate is observed. Hence, the dynamic motion of a thermo-mechanically coupled orthotropic rectangular plate undergoing large deflections can be controlled and manipulated to achieve periodic motion through an appropriate specification of the system parameters and loads.  相似文献   

3.
Nonlinear maps preserving Lie products on factor von Neumann algebras   总被引:2,自引:0,他引:2  
In this paper, we prove that every bijective map preserving Lie products from a factor von Neumann algebra into another factor von Neumann algebra is of the form Aψ(A)+ξ(A), where is an additive isomorphism or the negative of an additive anti-isomorphism and is a map with ξ(AB-BA)=0 for all .  相似文献   

4.
We use Adomian decomposition method for solving the fractional nonlinear two-point boundary value problem
where D is Caputo fractional derivative, c is a constant, μ > 0, and F:[0,1]×[0,)→[0,) a continuous function. The fractional Bratu problem is solved as an illustrative example.  相似文献   

5.
We consider in this paper goodness-of-fit tests of the null hypothesis that the underlying d.f. of a sample F(.), belongs to a given family of distribution functions . We propose a method for deriving approximate values of the power of a weighted Cramér–von Mises type test of goodness of fit. Our method relies on Karhunen–Loève [K.L] expansions on (0, 1] for weighted Brownian bridges.  相似文献   

6.
We consider the problem of computing a minimum weight pseudo-triangulation of a set of n points in the plane. We first present an -time algorithm that produces a pseudo-triangulation of weight which is shown to be asymptotically worst-case optimal, i.e., there exists a point set for which every pseudo-triangulation has weight , where is the weight of a minimum weight spanning tree of . We also present a constant factor approximation algorithm running in cubic time. In the process we give an algorithm that produces a minimum weight pseudo-triangulation of a simple polygon.  相似文献   

7.
For a Polish group let be the minimal number of translates of a fixed closed nowhere dense subset of required to cover . For many locally compact this cardinal is known to be consistently larger than which is the smallest cardinality of a covering of the real line by meagre sets. It is shown that for several non-locally compact groups . For example the equality holds for the group of permutations of the integers, the additive group of a separable Banach space with an unconditional basis and the group of homeomorphisms of various compact spaces.  相似文献   

8.
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set of n points in the plane, find a spanning tree of of minimum “area”, where the area of a spanning tree is the area of the union of the n−1 disks whose diameters are the edges in . We prove that the Euclidean minimum spanning tree of is a constant-factor approximation for mast. We then apply this result to obtain constant-factor approximations for the Minimum-Area Range Assignment (mara) problem, for the Minimum-Area Connected Disk Graph (macdg) problem, and for the Minimum-Area Tour (mat) problem. The first problem is a variant of the power assignment problem in radio networks, the second problem is a related natural problem, and the third problem is a variant of the traveling salesman problem.  相似文献   

9.
We construct a two-point selection , where is the set of the irrational numbers, such that the space is not normal and it is not collectionwise Hausdorff either. Here, τf denotes the topology generated by the two-point selection f. This example answers a question posed by V. Gutev and T. Nogura. We also show that if is a two-point selection such that the topology τf has countable pseudocharacter, then τf is a Tychonoff topology.  相似文献   

10.
We develop a number of space-efficient tools including an approach to simulate divide-and-conquer space-efficiently, stably selecting and unselecting a subset from a sorted set, and computing the kth smallest element in one dimension from a multi-dimensional set that is sorted in another dimension. We then apply these tools to solve several geometric problems that have solutions using some form of divide-and-conquer. Specifically, we present a deterministic algorithm running in time using extra memory given inputs of size n for the closest pair problem and a randomized solution running in expected time and using extra space for the bichromatic closest pair problem. For the orthogonal line segment intersection problem, we solve the problem in time using extra space where n is the number of horizontal and vertical line segments and k is the number of intersections.  相似文献   

11.
Two uniform asymptotic expansions are obtained for the Pollaczek polynomials Pn(cosθ;a,b). One is for , , in terms of elementary functions and in descending powers of . The other is for , in terms of a special function closely related to the modified parabolic cylinder functions, in descending powers of n. This interval contains a turning point and all possible zeros of Pn(cosθ) in θ(0,π/2].  相似文献   

12.
Let S be a set of n points in the plane and let be the set of all crossing-free spanning trees of S. We show that it is possible to transform any two trees in into each other by O(n2) local and constant-size edge slide operations. Previously no polynomial upper bound for this task was known, but in [O. Aichholzer, F. Aurenhammer, F. Hurtado, Sequences of spanning trees and a fixed tree theorem, Comput. Geom.: Theory Appl. 21 (1–2) (2002) 3–20] a bound of O(n2logn) operations was conjectured.  相似文献   

13.
A product formula for the parity generating function of the number of 1’s in invertible matrices over is given. The computation is based on algebraic tools such as the Bruhat decomposition. It is somewhat surprising that the number of such matrices with odd number of 1’s is greater than the number of those with even number of 1’s. The same technique can be used to obtain a parity generating function also for symplectic matrices over . We present also a generating function for the sum of entries of matrices over an arbitrary finite field calculated in . The Mahonian distribution appears in these formulas.  相似文献   

14.
Comfort and Hager investigate the notion of a maximal realcompact space and ask about the relationship to the first measurable cardinal . A space is said to be a space if the intersection of fewer than open sets is again open. They ask if each realcompact space is maximal realcompact. We establish that this question is undecidable.  相似文献   

15.
In this note, we consider a minimum degree condition for a hamiltonian graph to have a 2-factor with two components. Let G be a graph of order n3. Dirac's theorem says that if the minimum degree of G is at least , then G has a hamiltonian cycle. Furthermore, Brandt et al. [J. Graph Theory 24 (1997) 165–173] proved that if n8, then G has a 2-factor with two components. Both theorems are sharp and there are infinitely many graphs G of odd order and minimum degree which have no 2-factor. However, if hamiltonicity is assumed, we can relax the minimum degree condition for the existence of a 2-factor with two components. We prove in this note that a hamiltonian graph of order n6 and minimum degree at least has a 2-factor with two components.  相似文献   

16.
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected plane geometric graphs. In particular, we show that for G to become 2-edge connected, additional edges are required in some cases and that additional edges are always sufficient. For the special case of plane geometric trees, these bounds decrease to and , respectively.  相似文献   

17.
The combinatorial tool of generating functions for restricted partitions is used to generalize a quantum physics theorem relating distinct multiplets of different angular momenta in the composite Fermion model of the fractional quantum Hall effect. Specifically, if g(N,M) denotes the number of distinct multiplets of angular momentum and total angular momentum M, we prove that
where the sum is taken over all positive divisors of N and L(k)=kℓ-kN/2+3k/2-N+N/(2k)-1/2. The original Quinn–Wójs theorem results when k=1 and it appears that this generalization will be useful in further investigations of nuclear shells modeling elementary particle interactions when the particles are clustered together.  相似文献   

18.
The Lie admissible non-associative algebra is defined in the papers [Seul Hee Choi, Ki-Bong Nam, Derivations of a restricted Weyl type algebra I, Rocky Mountain J. Math. 37 (6) (2007) 1813–1830; Seul Hee Choi, Ki-Bong Nam, Weyl type non-associative algebra using additive groups I, Algebra Colloq. 14 (3) (2007) 479–488; Ki-Bong Nam, On Some Non-associative Algebras using Additive Groups, Southeast Asian Bull. Math., vol. 27, Springer-Verlag, 2003, 493–500]. We define in this work the algebra which generalizes the previous one and is not Lie admissible. We prove that the antisymmetrized Lie algebra is simple and contains the simple Lie algebra . We also prove that the matrix ring is embedded in .  相似文献   

19.
Let be a dilation-stable process on . We determine a Hausdorff measure function (a) such that the fractal set X[0,1]={X(t):0t1} has positive finite -measure. We also investigate the packing measure of X[0,1].  相似文献   

20.
In this work, the authors first show the existence of global attractors for the following lattice complex Ginzburg–Landau equation:
and for the following lattice Schrödinger equation:
Then they prove that the solutions of the lattice complex Ginzburg–Landau equation converge to that of the lattice Schrödinger equation as ε→0+. Also they prove the upper semicontinuity of as ε→0+ in the sense that .  相似文献   

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

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