𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Bosonization in higher dimensions
✍ C.P. Burgess; C.A. LΓΌtken; F. Quevedo πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 412 KB
Global Texture in Higher Dimension
✍ Subenoy Chakraborty; Md.Farook Rahaman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 106 KB

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

Small Blocking Sets in Higher Dimensions
✍ TamΓ‘s SzΕ‘nyi; Zsuzsa Weiner πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 133 KB

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

Weak Monge arrays in higher dimensions
✍ Dominique Fortin; RΓΌdiger Rudolf πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 797 KB

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

Discrepancy of Arithmetic Progressions i
✍ Benedek ValkΓ³ πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 136 KB

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