zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Classification of Hermitian forms with the neighbour method. (English) Zbl 0936.68129
Summary: The neighbour method of Kneser can be adapted to the Hermitian case. Generalizing results of D. W. Hoffmann [Manuscr. Math. 71, No. 4, 399–429 (1991; Zbl 0729.11020)], we show that it can be used to classify any genus in a Hermitian space of dimension 2 by neighbour steps at suitable primes. The method was implemented for positive definite Hermitian lattices (not necessarily free) over (d). A table of class numbers of unimodular genera and the largest minima attained in those genera is given. We also describe a generalization of the LLL-algorithm to lattices in positive Hermitian spaces over number fields.
MSC:
11E41Class numbers of quadratic and Hermitian forms
11H50Minima of forms
11H55Quadratic forms
11Y16Algorithms; complexity (number theory)