## SEARCH

#### Institution

##### ( see all 3046)

- University of California 140 (%)
- Cornell University 90 (%)
- University of Washington 85 (%)
- Universität Erlangen-Nürnberg 79 (%)
- Brown University 76 (%)

#### Author

##### ( see all 8574)

- Beutelspacher, Albrecht 48 (%)
- Peitgen, Heinz-Otto 47 (%)
- Jürgens, Hartmut 45 (%)
- Saupe, Dietmar 45 (%)
- Martin, Henno 43 (%)

#### Publication

##### ( see all 331)

- Journal of Soviet Mathematics 434 (%)
- Mathematical Notes 242 (%)
- Ukrainian Mathematical Journal 240 (%)
- Journal of Optimization Theory and Applications 175 (%)
- Archiv der Mathematik 174 (%)

#### Subject

##### ( see all 153)

- Mathematics [x] 9299 (%)
- Mathematics, general 2935 (%)
- Analysis 1551 (%)
- Applications of Mathematics 1475 (%)
- Probability Theory and Stochastic Processes 1107 (%)

## CURRENTLY DISPLAYING:

Most articles

Fewest articles

Showing 1 to 10 of 9299 matching Articles
Results per page:

## Measurable Functions on Fuzzy Measure Spaces

### Fuzzy Measure Theory (1992-01-01): 115-129 , January 01, 1992

In this chapter, let (*X*, ℱ) be a measurable space, *μ*: F → [0, ∞] be a fuzzy measure (or semicontinuous fuzzy measure), and B be the Borel field on (−∞, ∞).

## Ein lokaler Fundamentalsatz für Projektionen

### Geometriae Dedicata (1992-10-01) 44: 53-66 , October 01, 1992

A projection is a mapping between linear spaces, which preserves collinearity, and whose restriction to any line is injective or constant. Motivated by applications in photogrammetry, we prove that any projection from a subset *M* of a (little) Desarguesian projective space to another such space is a product of a central projection and an isomorphism, provided *M* is not too small and the image of *M* is not contained in one line.

## A combinatorial approach to complexity

### Combinatorica (1992-06-01) 12: 221-226 , June 01, 1992

We present a problem of construction of certain intersection graphs. If these graphs were explicitly constructed, we would have an explicit construction of Boolean functions of large complexity.

## A family of translation planes of order q 2m+1 with two orbits of length 2 and q 2m+1−1 on l ∞

### Geometriae Dedicata (1992-05-01) 42: 163-185 , May 01, 1992

A class of translation planes of order *q*^{2m+1}, where *q* is an odd prime power and *m*≥1, is constructed. If *m*=1, then this class is contained in the class of order *q*^{3} constructed by Hiramine [5]. These planes of order *q*^{2m+1} are of dimension 2*m*+1 over their kernels. If *q*^{2m+1}≠3^{3}, then the linear translation complements of these planes have two orbits of length 2 and *q*^{2m+1}−1 on *l*_{∞} and this class contains many planes which are not generalized André planes. If *q*^{2m+1}= 3^{3}, then each plane of this class is isomorphic to the Hering plane of order 27.

## On a class of matrices which arise in the numerical solution of Euler equations

### Numerische Mathematik (1992-12-01) 63: 411-431 , December 01, 1992

### Summary

We study block matrices*A*=[A_{ij}], where every block*A*_{ij}∈ℂ^{k,k} is Hermitian and*A*_{ii} is positive definite. We call such a matrix a generalized H-matrix if its block comparison matrix is a generalized M-matrix. These matrices arise in the numerical solution of Euler equations in fluid flow computations and in the study of invariant tori of dynamical systems. We discuss properties of these matrices and we give some equivalent conditions for a matrix to be a generalized H-matrix.

## Algebrogeometric solutions of the nonlinear boundary problem on a segment for the sine-Gordon equation

### Mathematical Notes (1992-10-01) 52: 1005-1011 , October 01, 1992

## Shannon’s Theorem

### Introduction to Coding Theory (1992-01-01) 86: 22-30 , January 01, 1992

This book will present an introduction to the mathematical aspects of the theory of *error-correcting codes*. This theory is applied in many situations which have as a common feature that information coming from some source is transmitted over a noisy communication channel to a receiver. Examples are telephone conversations, storage devices like magnetic tape units which feed some stored information to the computer, telegraph, etc. The following is a typical recent example. Many readers will have seen the excellent pictures which were taken of Mars, Saturn and other planets by satellites such as the Mariners, Voyagers, etc. In order to transmit these pictures to Earth a fine grid is placed on the picture and for each square of the grid the degree of blackness is measured, say in a scale of 0 to 63. These numbers are expressed in the binary system, i.e. each square produces a string of six Os and Is. The Os and 1 s are transmitted as two different signals to the receiver station on Earth (the Jet Propulsion Laboratory of the California Institute of Technology in Pasadena). On arrival the signal is very weak and it must be amplified. Due to the effect of thermal noise it happens occasionally that a signal which was transmitted as a 0 is interpreted by the receiver as a 1, and *vice versa*. If the 6-tuples of Os and Is that we mentioned above were transmitted as such, then the errors made by the receiver would have great effect on the pictures. In order to prevent this, so-called *redundancy* is built into the signal, i.e. the transmitted sequence consists of more than the necessary information. We are all familiar with the principle of redundancy from everyday language. The words of our language form a small part of all possible strings of letters (symbols). Consequently a misprint in a long(!) word is recognized because the word is changed into something that resembles the correct word more than it resembles any other word we know. This is the essence of the theory to be treated in this book. In the previous example the reader corrects the misprint. A more modest example of coding for noisy channels is the system used on paper tape for computers. In order to represent 32 distinct symbols one can use 5-tuples of Os and is (i.e. the integers 0 to 31 in binary). In practice, one redundant *bit* (= binary digit) is added to the 5-tuple in such a way that the resulting 6-tuple has an even number of 1s. A failure of the machines that use these tapes occurs very rarely but it is possible that an occasional incorrect bit occurs. The result is incorrect parity of the 6-tuple, i.e. it will have an odd number of ones. In this case the machine stops because it detects an error. This is an example of what is called a *single-error-detecting-code*.

## p-harmonic maps and minimal submanifolds

### Mathematische Annalen (1992-12-01) 294: 611-624 , December 01, 1992

## Duality in infinite dimensional linear programming

### Mathematical Programming (1992-01-01) 53: 79-97 , January 01, 1992

We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finitely many constraints. Examples include production planning and equipment replacement over an infinite horizon. We form the natural dual linear programming problem and prove strong duality under a transversality condition that dual prices are asymptotically zero. That is, we show, under this transversality condition, that optimal solutions are attained in both primal and dual problems and their optimal values are equal. The transversality condition, and hence strong duality, is established for an infinite horizon production planning problem.

## Involution and Prolongation

### Exterior Differential Systems and Equivalence Problems (1992-01-01) 73: 67-87 , January 01, 1992

Let Σ be a closed differential system, and also let X be an irreducible component in the variety *𝒱* (Σ). For any q, 0 ≤ q ≤ p, we let G (X) c G (M) denote the totality of q-planes contained in some p-plane in X. Note that the q-planes in G_{q} (X) are acutally integral. The characters s_{q} (X) and s’_{q}(X), 0 ≤ q ≤ p, are defined as follows: the sum
$$
\sum\limits_{i = 0}^q {{s_i}} \left( X \right)$$
is the maximum dimension of the polar systems of integral q-elements in *𝒱*_{q} (Σ) near a point of G_{q} (X); the sum
$$
\sum\limits_{1 = 0}^q {{{s'}_i}} \left( X \right)$$
is the maximum dimension of the polar systems of the E^{q}’s in G_{q} (X). We then have the following basic result: the irreducible component X contains an ordinary integral element if and only if
$$
{s_q}\left( X \right) = {s'_q}\left( X \right),\quad 0 \leqslant q \leqslant p - 1$$
. At the end of §1 we give a proof of Cartan’s test using this result.