𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The existence of good extensible rank-1 lattices

✍ Scribed by Fred J. Hickernell; Harald Niederreiter

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
184 KB
Volume
19
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

✦ Synopsis

Extensible integration lattices have the attractive property that the number of points in the node set may be increased while retaining the existing points. It is shown here that there exist generating vectors, h; for extensible rank-1 lattices such that for n ΒΌ b; b 2 ; y points and dimensions s ΒΌ 1; 2; y the figures of merit R a ; P a and discrepancy are all small. The upper bounds obtained on these figures of merit for extensible lattices are some power of log n worse than the best upper bounds for lattices where h is allowed to vary with n and s:

πŸ“œ SIMILAR VOLUMES

Lattice rules of minimal and maximal ran
Lattice rules of minimal and maximal rank with good figures of merit
✍ T.N. Langtry πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 143 KB

For periodic integrands with unit period in each variable, certain error bounds for lattice rules are conveniently characterised by the ΓΏgure of merit , which was originally introduced in the context of number theoretic rules. The problem of ΓΏnding good rules of order N (that is, having N distinct n

Arithmeticity of rank-1 lattices with de
Arithmeticity of rank-1 lattices with dense commensurators in positive characteristic
✍ Lucy Lifschitz πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 126 KB

G. Margulis showed that if G is a semisimple Lie group and Ξ“ βŠ‚ G is an irreducible lattice, which has an infinite index in its commensurator, and which satisfies one of the following conditions: (1) it is cocompact; (2) at least one of the simple components of G is defined over a local field of cha

The rank of a distributive lattice
The rank of a distributive lattice
✍ I. Rabinovitch; I. Rival πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 427 KB

The rank of a partial ordering P is the maximum size of an n-redundant family of linear extensions of P whose intersection is P. A simple relationship is established between the rank of a finite distributive lattice and its subset of join irreducible elements.