𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Construction of a smooth mapping with prescribed jacobian. I

✍ Scribed by M. L. Gromov; Ya. M. Éliashberg

Publisher
Springer US
Year
1973
Tongue
English
Weight
535 KB
Volume
7
Category
Article
ISSN
0016-2663

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The construction of cubic and quartic pl
The construction of cubic and quartic planar maps with prescribed face degrees
✍ Gunnar Brinkmann; Thomas Harmuth; Oliver Heidemeier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 131 KB

In this paper, the existence and availability of computer programs to constructively enumerate all simple connected cubic or quartic planar maps with prescribed number of vertices and face degrees is announced and results of the programs are presented. The underlying algorithms of the computer progr

A stochastic approach to the constructio
A stochastic approach to the construction of one-dimensional chaotic maps with prescribed statistical properties
✍ F.K. Diakonos; D. Pingel; P. Schmelcher 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 142 KB

We use a recently found parametrization of the solutions of the inverse Frobenius-Perron problem within the class of complete unimodal maps to develop a Monte Carlo approach for the construction of one-dimensional chaotic dynamical laws with given statistical properties, i.e. invariant density and a

Fast construction of a symmetric nonnega
Fast construction of a symmetric nonnegative matrix with a prescribed spectrum
✍ O. Rojo; R. Soto; H. Rojo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 578 KB

## In this paper, for a prescribed real spectrum, using properties of the circulant matrices and of the symmetric persymmetric matrices, we derive a fast and stable algorithm to construct a symmetric nonnegative matrix which realizes the spectrum. The algorithm is based on the fast Fourier transfo

Constructing a bipartite graph of maximu
Constructing a bipartite graph of maximum connectivity with prescribed degrees
✍ Asano, Takao 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB 👁 3 views

d 2,n 2 ) is a bipartite graphical sequence, if there is a bipartite graph G with degrees {D 1 , D 2 } (i.e., G has two independent vertex sets In other words, {D 1 , D 2 } is a bipartite graphical sequence if and only if there is an n 1 1 n 2 matrix of 0's and 1's having d 1j 1 1's in row j 1 and