首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 500 毫秒
1.
2.
We give bounds on the first non-zero eigenvalue of the scalar Laplacian for both the Page and the Chen–LeBrun–Weber Einstein metrics. One notable feature is that these bounds are obtained without explicit knowledge of the metrics or numerical approximation to them. Our method also allows the estimation of the invariant part of the spectrum for both metrics. We go on to discuss an application of these bounds to the linear stability of the metrics. We also give numerical evidence to suggest that the bounds for both metrics are extremely close to the actual eigenvalue.  相似文献   

3.
O. Lazarev and E.H. Lieb proved that, given f1,…,fn∈L1([0,1];C)f1,,fnL1([0,1];C), there exists a smooth function ΦΦ that takes values on the unit circle and annihilates span{f1,…,fn}span{f1,,fn}. We give an alternative proof of that fact that also shows the W1,1W1,1 norm of ΦΦ can be bounded by 5πn+15πn+1. Answering a question raised by Lazarev and Lieb, we show that if p>1p>1 then there is no bound for the W1,pW1,p norm of any such multiplier in terms of the norms of f1,…,fnf1,,fn.  相似文献   

4.
The spt-crank of a vector partition, or an S  -partition, was introduced by Andrews, Garvan and Liang. Let NS(m,n)NS(m,n) denote the net number of S-partitions of n with spt-crank m, that is, the number of S  -partitions (π1,π2,π3)(π1,π2,π3) of n with spt-crank m   such that the length of π1π1 is odd minus the number of S  -partitions (π1,π2,π3)(π1,π2,π3) of n with spt-crank m   such that the length of π1π1 is even. Andrews, Dyson and Rhoades conjectured that {NS(m,n)}m{NS(m,n)}m is unimodal for any n  , and they showed that this conjecture is equivalent to an inequality between the rank and crank of ordinary partitions. They obtained an asymptotic formula for the difference between the rank and crank of ordinary partitions, which implies NS(m,n)≥NS(m+1,n)NS(m,n)NS(m+1,n) for sufficiently large n and fixed m. In this paper, we introduce a representation of an ordinary partition, called the m-Durfee rectangle symbol, which is a rectangular generalization of the Durfee symbol introduced by Andrews. We give a proof of the conjecture of Andrews, Dyson and Rhoades. We also show that this conjecture implies an inequality between the positive rank and crank moments obtained by Andrews, Chan and Kim.  相似文献   

5.
A solution of the Cauchy problem in an isotropic medium and in an anisotropic medium with clearly expressed vertical or horizontal permeability is constructed for the Barenblatt–Zheltov–Kochina model representation of the seepage of a fluid in fissured porous rock by reducing the seepage problems under consideration to solving an abstract Cauchy problem in a Banach space.  相似文献   

6.
I. D. Kan 《Mathematical Notes》2016,99(3-4):378-381
In the present paper, the inequality inverse to the Cauchy–Bunyakovskii–Schwarz inequality and generalizing other well-known inversions of this inequality is proved.  相似文献   

7.
8.
9.
Given positive integers a and n with (a,n)=1, we consider the Fermat–Euler dynamical system defined by the multiplication by a acting on the set of residues modulo n relatively prime to n. Given an integer M>1, the integers n for which the number of orbits of this dynamical system is a multiple of M form an ideal in the multiplicative semigroup of odd integers. We provide new results on the arithmetical properties of these ideals by using the topological properties of some directed graphs (the monads).   相似文献   

10.
Fornaro  S.  Metafune  G. 《Positivity》2020,24(4):915-931
Positivity - We study the analyticity of the Cox–Ingersoll–Ross semigroup generated by $$\begin{aligned} A_r u=\nu ^2 xu''+\gamma u'+\beta x u'-rx u, \end{aligned}$$ in...  相似文献   

11.
12.
The conjecture on spherical classes states that the Hopf invariant one and the Kervaire invariant one classes are the only elements in H?(Q0S0)H?(Q0S0) belonging to the image of the Hurewicz homomorphism. The Lannes–Zarati homomorphism is a map that corresponds to an associated graded (with a certain filtration) of the Hurewicz map. The algebraic version of the conjecture predicts that the s  -th Lannes–Zarati homomorphism vanishes in any positive stems for s>2s>2. In the article, we prove the conjecture for the fifth Lannes–Zarati homomorphism.  相似文献   

13.
Let N 0(T) be the number of zeros of the Davenport–Heilbronn function in the interval [1/2, 1/2+ i T]. It is proved that N 0(T) ? T (ln T)1/2+1/16?ε, where ε is an arbitrarily small positive number.  相似文献   

14.
Apart from the well-known weaknesses of the standard Malmquist productivity index related to infeasibility and not accounting for slacks, already addressed in the literature, we identify a new and significant drawback of the Malmquist–Luenberger index decomposition that questions its validity as an empirical tool for environmental productivity measurement associated with the production of bad outputs. In particular, we show that the usual interpretation of the technical change component in terms of production frontier shifts can be inconsistent with its numerical value, thereby resulting in an erroneous interpretation of this component that passes on to the index itself. We illustrate this issue with a simple numerical example. Finally, we propose a solution for this inconsistency issue based on incorporating a new postulate for the technology related to the production of bad outputs.  相似文献   

15.
16.
Let G be the symmetric group on n letters. Procesi and Formanek have shown that C n , the center of the generic division algebra of degree n defined over a field F, is stably isomorphic to F(Bn)GF(B_{n})^{G} where B n is a specific ZG-lattice. We refer to B n as the Procesi–Formanek lattice. The question of the stable rationality of C n is a long standing problem for which few results are known. Let F be an algebraically closed field of characteristic zero, let p be an odd prime, and let Bp*=HomZ(Bp,Z)B_{p}^{*}=Hom_{Z}(B_{p},Z) be the dual of the Procesi–Formanek lattice. We show that F(Bp*)GF(B_{p}^{*})^{G} is stably rational over F. An interesting question is whether there exists a connection between C p and F(Bp*)GF(B_{p}^{*})^{G}.  相似文献   

17.
The velocity–vorticity formulation of the 3D Navier–Stokes equations was recently found to give excellent numerical results for flows with strong rotation. In this work, we propose a new regularization of the 3D Navier–Stokes equations, which we call the 3D velocity–vorticity-Voigt (VVV) model, with a Voigt regularization term added to momentum equation in velocity–vorticity form, but with no regularizing term in the vorticity equation. We prove global well-posedness and regularity of this model under periodic boundary conditions. We prove convergence of the model's velocity and vorticity to their counterparts in the 3D Navier–Stokes equations as the Voigt modeling parameter tends to zero. We prove that the curl of the model's velocity converges to the model vorticity (which is solved for directly), as the Voigt modeling parameter tends to zero. Finally, we provide a criterion for finite-time blow-up of the 3D Navier–Stokes equations based on this inviscid regularization.  相似文献   

18.
Analogous to the Camassa–Holm equation, the Dullin–Gottwald–Holm equation also possesses peaked solitary waves, which are called peakons. We prove in this paper the stability of ordered trains of peakons for the Dullin–Gottwald–Holm equation.  相似文献   

19.
We show that the new pseudo-random number function, introduced recently by M. Naor and O. Reingold, possesses one more attractive and useful property. Namely, it is proved that for almost all values of parameters it produces a uniformly distributed sequence. The proof is based on some recent bounds of character sums with exponential functions.  相似文献   

20.
We construct a sequence of branching particle systems α n convergent in measure to the solution of the Kushner–Stratonovitch equation. The algorithm based on this result can be used to solve numerically the filtering problem. We prove that the rate of convergence of the algorithm is of order n ?. This paper is the third in a sequence, and represents the most efficient algorithm we have identified so far. Received: 4 February 1997 / Revised version: 26 October 1998  相似文献   

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

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