Melnikov vector in higher dimensions
β Scribed by Masahiro Yamashita
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 943 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0362-546X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we study global texture in five-dimensional space-time. The self similar solution is obtained in higher dimension and is very similar to the four-dimensional solution. We investigate the gravitational field of the global texture configuration by solving Einstein field equations as well
We show that small blocking sets in PG(n, q) with respect to hyperplanes intersect every hyperplane in 1 modulo p points, where q= p h . The result is then extended to blocking sets with respect to k-dimensional subspaces and, at least when p>2, to intersections with arbitrary subspaces not just hyp
An n x n matrix C is called a weak Mange matrix if cii + c,~ GIs + cti for all 1 < i < r, s 6 n. It is well known that the classical linear assignment problem is optimally solved by the identity permutation if the underlying cost-matrix fulfills the weak Monge property. In this paper we introduce
proved that the discrepancy of arithmetic progressions contained in [1, N]={1, 2, ..., N} is at least cN 1/4 , and later it was proved that this result is sharp. We consider the d-dimensional version of this problem. We give a lower estimate for the discrepancy of arithmetic progressions on [1, N] d